./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/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_3e871d53-100f-41d1-a357-70bdeaaeb654/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/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-1dbac8b [2018-11-10 13:04:31,276 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:04:31,277 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:04:31,284 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:04:31,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:04:31,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:04:31,285 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:04:31,287 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:04:31,288 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:04:31,288 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:04:31,289 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:04:31,289 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:04:31,290 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:04:31,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:04:31,291 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:04:31,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:04:31,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:04:31,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:04:31,295 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:04:31,296 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:04:31,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:04:31,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:04:31,299 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:04:31,299 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:04:31,300 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:04:31,300 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:04:31,301 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:04:31,301 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:04:31,302 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:04:31,303 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:04:31,303 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:04:31,303 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:04:31,304 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:04:31,304 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:04:31,304 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:04:31,305 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:04:31,305 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 13:04:31,315 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:04:31,316 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:04:31,316 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:04:31,316 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 13:04:31,317 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:04:31,317 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:04:31,317 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:04:31,317 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:04:31,317 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:04:31,318 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:04:31,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:04:31,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:04:31,318 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:04:31,318 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:04:31,318 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:04:31,318 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:04:31,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:04:31,319 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:04:31,319 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:04:31,319 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:04:31,319 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:04:31,319 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:04:31,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:04:31,320 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:04:31,320 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:04:31,320 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:04:31,320 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:04:31,320 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:04:31,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:04:31,321 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_3e871d53-100f-41d1-a357-70bdeaaeb654/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-10 13:04:31,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:04:31,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:04:31,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:04:31,351 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:04:31,352 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:04:31,352 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-11-10 13:04:31,395 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/bin-2019/uautomizer/data/bcea24732/a0e99fde723f4a7a9f829ba8b213880a/FLAG3cde29823 [2018-11-10 13:04:31,800 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:04:31,801 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-11-10 13:04:31,806 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/bin-2019/uautomizer/data/bcea24732/a0e99fde723f4a7a9f829ba8b213880a/FLAG3cde29823 [2018-11-10 13:04:31,815 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/bin-2019/uautomizer/data/bcea24732/a0e99fde723f4a7a9f829ba8b213880a [2018-11-10 13:04:31,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:04:31,818 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 13:04:31,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:04:31,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:04:31,822 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:04:31,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:04:31" (1/1) ... [2018-11-10 13:04:31,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce791db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:31, skipping insertion in model container [2018-11-10 13:04:31,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:04:31" (1/1) ... [2018-11-10 13:04:31,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:04:31,853 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:04:31,976 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:04:31,979 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:04:32,008 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:04:32,018 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:04:32,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:32 WrapperNode [2018-11-10 13:04:32,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:04:32,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:04:32,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:04:32,019 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:04:32,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:32" (1/1) ... [2018-11-10 13:04:32,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:32" (1/1) ... [2018-11-10 13:04:32,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:32" (1/1) ... [2018-11-10 13:04:32,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:32" (1/1) ... [2018-11-10 13:04:32,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:32" (1/1) ... [2018-11-10 13:04:32,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:32" (1/1) ... [2018-11-10 13:04:32,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:32" (1/1) ... [2018-11-10 13:04:32,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:04:32,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:04:32,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:04:32,095 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:04:32,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/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-10 13:04:32,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:04:32,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:04:32,137 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-10 13:04:32,137 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-10 13:04:32,137 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-10 13:04:32,137 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-11-10 13:04:32,137 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-10 13:04:32,137 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-10 13:04:32,137 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-11-10 13:04:32,138 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-10 13:04:32,138 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-10 13:04:32,138 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-10 13:04:32,138 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-10 13:04:32,138 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-10 13:04:32,138 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-10 13:04:32,138 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-10 13:04:32,138 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-10 13:04:32,138 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-10 13:04:32,138 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-10 13:04:32,139 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-10 13:04:32,139 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-10 13:04:32,139 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-10 13:04:32,139 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:04:32,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 13:04:32,139 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-10 13:04:32,139 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-10 13:04:32,140 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-10 13:04:32,140 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-11-10 13:04:32,140 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-10 13:04:32,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 13:04:32,140 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-10 13:04:32,140 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-10 13:04:32,140 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-11-10 13:04:32,140 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-10 13:04:32,140 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-10 13:04:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-10 13:04:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-10 13:04:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-10 13:04:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-10 13:04:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-10 13:04:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-10 13:04:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-10 13:04:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-10 13:04:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-10 13:04:32,141 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-10 13:04:32,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:04:32,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:04:32,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:04:32,548 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:04:32,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:04:32 BoogieIcfgContainer [2018-11-10 13:04:32,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:04:32,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:04:32,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:04:32,553 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:04:32,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:04:31" (1/3) ... [2018-11-10 13:04:32,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d233b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:04:32, skipping insertion in model container [2018-11-10 13:04:32,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:32" (2/3) ... [2018-11-10 13:04:32,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d233b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:04:32, skipping insertion in model container [2018-11-10 13:04:32,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:04:32" (3/3) ... [2018-11-10 13:04:32,557 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02_true-unreach-call_false-termination.cil.c [2018-11-10 13:04:32,563 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:04:32,569 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:04:32,579 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:04:32,601 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:04:32,601 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:04:32,602 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:04:32,602 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:04:32,602 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:04:32,602 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:04:32,602 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:04:32,602 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:04:32,602 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:04:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2018-11-10 13:04:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:04:32,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:32,627 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-10 13:04:32,629 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:32,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:32,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1391083364, now seen corresponding path program 1 times [2018-11-10 13:04:32,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:32,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:32,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:32,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:32,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:32,814 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-10 13:04:32,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:32,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:04:32,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:04:32,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:04:32,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:04:32,834 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 4 states. [2018-11-10 13:04:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:32,987 INFO L93 Difference]: Finished difference Result 341 states and 482 transitions. [2018-11-10 13:04:32,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:04:32,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-10 13:04:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:32,999 INFO L225 Difference]: With dead ends: 341 [2018-11-10 13:04:32,999 INFO L226 Difference]: Without dead ends: 170 [2018-11-10 13:04:33,003 INFO L605 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-10 13:04:33,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-10 13:04:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-11-10 13:04:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-10 13:04:33,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 227 transitions. [2018-11-10 13:04:33,046 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 227 transitions. Word has length 93 [2018-11-10 13:04:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:33,047 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 227 transitions. [2018-11-10 13:04:33,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:04:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 227 transitions. [2018-11-10 13:04:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:04:33,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:33,051 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-10 13:04:33,051 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:33,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:33,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1364017762, now seen corresponding path program 1 times [2018-11-10 13:04:33,052 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:33,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:33,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:33,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:33,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:33,178 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-10 13:04:33,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:33,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:04:33,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:04:33,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:04:33,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:04:33,180 INFO L87 Difference]: Start difference. First operand 170 states and 227 transitions. Second operand 5 states. [2018-11-10 13:04:33,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:33,516 INFO L93 Difference]: Finished difference Result 351 states and 485 transitions. [2018-11-10 13:04:33,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:04:33,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-10 13:04:33,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:33,518 INFO L225 Difference]: With dead ends: 351 [2018-11-10 13:04:33,518 INFO L226 Difference]: Without dead ends: 201 [2018-11-10 13:04:33,519 INFO L605 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-10 13:04:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-10 13:04:33,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 170. [2018-11-10 13:04:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-10 13:04:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 226 transitions. [2018-11-10 13:04:33,537 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 226 transitions. Word has length 93 [2018-11-10 13:04:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:33,537 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 226 transitions. [2018-11-10 13:04:33,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:04:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 226 transitions. [2018-11-10 13:04:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:04:33,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:33,539 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-10 13:04:33,539 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:33,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:33,539 INFO L82 PathProgramCache]: Analyzing trace with hash 396667108, now seen corresponding path program 1 times [2018-11-10 13:04:33,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:33,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:33,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:33,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:33,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:33,613 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-10 13:04:33,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:33,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:04:33,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:04:33,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:04:33,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:04:33,615 INFO L87 Difference]: Start difference. First operand 170 states and 226 transitions. Second operand 5 states. [2018-11-10 13:04:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:33,883 INFO L93 Difference]: Finished difference Result 351 states and 484 transitions. [2018-11-10 13:04:33,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:04:33,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-10 13:04:33,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:33,885 INFO L225 Difference]: With dead ends: 351 [2018-11-10 13:04:33,885 INFO L226 Difference]: Without dead ends: 201 [2018-11-10 13:04:33,886 INFO L605 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-10 13:04:33,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-10 13:04:33,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 170. [2018-11-10 13:04:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-10 13:04:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 225 transitions. [2018-11-10 13:04:33,903 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 225 transitions. Word has length 93 [2018-11-10 13:04:33,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:33,903 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 225 transitions. [2018-11-10 13:04:33,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:04:33,904 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 225 transitions. [2018-11-10 13:04:33,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:04:33,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:33,905 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-10 13:04:33,908 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:33,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:33,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1989842398, now seen corresponding path program 1 times [2018-11-10 13:04:33,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:33,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:33,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:33,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:33,969 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-10 13:04:33,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:33,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:04:33,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:04:33,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:04:33,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:04:33,970 INFO L87 Difference]: Start difference. First operand 170 states and 225 transitions. Second operand 5 states. [2018-11-10 13:04:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:34,177 INFO L93 Difference]: Finished difference Result 349 states and 478 transitions. [2018-11-10 13:04:34,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:04:34,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-10 13:04:34,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:34,178 INFO L225 Difference]: With dead ends: 349 [2018-11-10 13:04:34,179 INFO L226 Difference]: Without dead ends: 199 [2018-11-10 13:04:34,179 INFO L605 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-10 13:04:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-10 13:04:34,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 170. [2018-11-10 13:04:34,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-10 13:04:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 224 transitions. [2018-11-10 13:04:34,192 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 224 transitions. Word has length 93 [2018-11-10 13:04:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:34,193 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 224 transitions. [2018-11-10 13:04:34,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:04:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 224 transitions. [2018-11-10 13:04:34,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:04:34,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:34,195 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-10 13:04:34,195 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:34,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:34,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1812498724, now seen corresponding path program 1 times [2018-11-10 13:04:34,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:34,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:34,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:34,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:34,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:34,249 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-10 13:04:34,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:34,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:04:34,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:04:34,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:04:34,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:04:34,250 INFO L87 Difference]: Start difference. First operand 170 states and 224 transitions. Second operand 5 states. [2018-11-10 13:04:34,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:34,506 INFO L93 Difference]: Finished difference Result 368 states and 506 transitions. [2018-11-10 13:04:34,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:04:34,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-10 13:04:34,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:34,508 INFO L225 Difference]: With dead ends: 368 [2018-11-10 13:04:34,508 INFO L226 Difference]: Without dead ends: 218 [2018-11-10 13:04:34,509 INFO L605 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-10 13:04:34,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-10 13:04:34,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 170. [2018-11-10 13:04:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-10 13:04:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 223 transitions. [2018-11-10 13:04:34,525 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 223 transitions. Word has length 93 [2018-11-10 13:04:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:34,525 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 223 transitions. [2018-11-10 13:04:34,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:04:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 223 transitions. [2018-11-10 13:04:34,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:04:34,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:34,526 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-10 13:04:34,526 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:34,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:34,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1528528414, now seen corresponding path program 1 times [2018-11-10 13:04:34,527 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:34,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:34,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:34,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:34,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:34,584 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-10 13:04:34,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:34,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:04:34,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:04:34,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:04:34,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:04:34,585 INFO L87 Difference]: Start difference. First operand 170 states and 223 transitions. Second operand 5 states. [2018-11-10 13:04:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:34,906 INFO L93 Difference]: Finished difference Result 361 states and 494 transitions. [2018-11-10 13:04:34,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:04:34,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-10 13:04:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:34,908 INFO L225 Difference]: With dead ends: 361 [2018-11-10 13:04:34,908 INFO L226 Difference]: Without dead ends: 211 [2018-11-10 13:04:34,909 INFO L605 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-10 13:04:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-10 13:04:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 170. [2018-11-10 13:04:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-10 13:04:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 222 transitions. [2018-11-10 13:04:34,926 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 222 transitions. Word has length 93 [2018-11-10 13:04:34,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:34,926 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 222 transitions. [2018-11-10 13:04:34,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:04:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 222 transitions. [2018-11-10 13:04:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:04:34,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:34,927 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-10 13:04:34,928 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:34,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:34,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1550285156, now seen corresponding path program 1 times [2018-11-10 13:04:34,928 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:34,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:34,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:34,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:34,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:34,981 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-10 13:04:34,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:34,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:04:34,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:04:34,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:04:34,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:04:34,982 INFO L87 Difference]: Start difference. First operand 170 states and 222 transitions. Second operand 4 states. [2018-11-10 13:04:35,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:35,110 INFO L93 Difference]: Finished difference Result 460 states and 629 transitions. [2018-11-10 13:04:35,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:04:35,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-10 13:04:35,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:35,112 INFO L225 Difference]: With dead ends: 460 [2018-11-10 13:04:35,112 INFO L226 Difference]: Without dead ends: 311 [2018-11-10 13:04:35,113 INFO L605 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-10 13:04:35,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-10 13:04:35,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 310. [2018-11-10 13:04:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-11-10 13:04:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 404 transitions. [2018-11-10 13:04:35,132 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 404 transitions. Word has length 93 [2018-11-10 13:04:35,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:35,132 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 404 transitions. [2018-11-10 13:04:35,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:04:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 404 transitions. [2018-11-10 13:04:35,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 13:04:35,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:35,134 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-10 13:04:35,134 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:35,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:35,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1511392395, now seen corresponding path program 1 times [2018-11-10 13:04:35,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:35,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:35,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:35,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:35,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:35,189 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-10 13:04:35,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:04:35,189 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/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-10 13:04:35,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:35,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:04:35,292 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-10 13:04:35,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:04:35,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-10 13:04:35,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:04:35,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:04:35,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:04:35,311 INFO L87 Difference]: Start difference. First operand 310 states and 404 transitions. Second operand 7 states. [2018-11-10 13:04:35,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:35,448 INFO L93 Difference]: Finished difference Result 901 states and 1262 transitions. [2018-11-10 13:04:35,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:04:35,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2018-11-10 13:04:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:35,453 INFO L225 Difference]: With dead ends: 901 [2018-11-10 13:04:35,453 INFO L226 Difference]: Without dead ends: 612 [2018-11-10 13:04:35,455 INFO L605 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-10 13:04:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-11-10 13:04:35,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 585. [2018-11-10 13:04:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-11-10 13:04:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 787 transitions. [2018-11-10 13:04:35,506 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 787 transitions. Word has length 149 [2018-11-10 13:04:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:35,507 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 787 transitions. [2018-11-10 13:04:35,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:04:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 787 transitions. [2018-11-10 13:04:35,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 13:04:35,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:35,510 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-10 13:04:35,510 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:35,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:35,510 INFO L82 PathProgramCache]: Analyzing trace with hash -62092307, now seen corresponding path program 1 times [2018-11-10 13:04:35,511 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:35,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:35,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:35,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:35,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:35,583 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-10 13:04:35,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:04:35,583 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/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-10 13:04:35,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:35,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:04:35,724 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-10 13:04:35,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:04:35,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-10 13:04:35,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:04:35,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:04:35,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:04:35,752 INFO L87 Difference]: Start difference. First operand 585 states and 787 transitions. Second operand 7 states. [2018-11-10 13:04:35,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:35,896 INFO L93 Difference]: Finished difference Result 1532 states and 2167 transitions. [2018-11-10 13:04:35,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:04:35,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2018-11-10 13:04:35,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:35,902 INFO L225 Difference]: With dead ends: 1532 [2018-11-10 13:04:35,902 INFO L226 Difference]: Without dead ends: 974 [2018-11-10 13:04:35,905 INFO L605 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-10 13:04:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-11-10 13:04:35,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2018-11-10 13:04:35,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2018-11-10 13:04:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1311 transitions. [2018-11-10 13:04:35,979 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1311 transitions. Word has length 170 [2018-11-10 13:04:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:35,979 INFO L481 AbstractCegarLoop]: Abstraction has 972 states and 1311 transitions. [2018-11-10 13:04:35,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:04:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1311 transitions. [2018-11-10 13:04:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 13:04:35,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:35,982 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-10 13:04:35,982 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:35,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:35,983 INFO L82 PathProgramCache]: Analyzing trace with hash -2070823885, now seen corresponding path program 1 times [2018-11-10 13:04:35,983 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:35,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:35,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:35,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:35,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:36,018 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-10 13:04:36,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:36,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:04:36,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:04:36,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:04:36,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:04:36,019 INFO L87 Difference]: Start difference. First operand 972 states and 1311 transitions. Second operand 4 states. [2018-11-10 13:04:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:36,173 INFO L93 Difference]: Finished difference Result 1917 states and 2584 transitions. [2018-11-10 13:04:36,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:04:36,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-11-10 13:04:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:36,178 INFO L225 Difference]: With dead ends: 1917 [2018-11-10 13:04:36,178 INFO L226 Difference]: Without dead ends: 966 [2018-11-10 13:04:36,182 INFO L605 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-10 13:04:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2018-11-10 13:04:36,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 966. [2018-11-10 13:04:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-11-10 13:04:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1299 transitions. [2018-11-10 13:04:36,251 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1299 transitions. Word has length 149 [2018-11-10 13:04:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:36,251 INFO L481 AbstractCegarLoop]: Abstraction has 966 states and 1299 transitions. [2018-11-10 13:04:36,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:04:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1299 transitions. [2018-11-10 13:04:36,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 13:04:36,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:36,254 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-10 13:04:36,254 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:36,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:36,254 INFO L82 PathProgramCache]: Analyzing trace with hash -255644513, now seen corresponding path program 1 times [2018-11-10 13:04:36,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:36,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:36,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:36,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:36,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:36,305 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 13:04:36,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:04:36,305 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/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-10 13:04:36,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:36,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:04:36,443 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-10 13:04:36,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:04:36,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-10 13:04:36,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:04:36,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:04:36,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:04:36,471 INFO L87 Difference]: Start difference. First operand 966 states and 1299 transitions. Second operand 5 states. [2018-11-10 13:04:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:37,008 INFO L93 Difference]: Finished difference Result 4576 states and 6994 transitions. [2018-11-10 13:04:37,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:04:37,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2018-11-10 13:04:37,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:37,028 INFO L225 Difference]: With dead ends: 4576 [2018-11-10 13:04:37,028 INFO L226 Difference]: Without dead ends: 3631 [2018-11-10 13:04:37,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 152 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-10 13:04:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3631 states. [2018-11-10 13:04:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3631 to 3576. [2018-11-10 13:04:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3576 states. [2018-11-10 13:04:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 5092 transitions. [2018-11-10 13:04:37,340 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 5092 transitions. Word has length 150 [2018-11-10 13:04:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:37,340 INFO L481 AbstractCegarLoop]: Abstraction has 3576 states and 5092 transitions. [2018-11-10 13:04:37,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:04:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 5092 transitions. [2018-11-10 13:04:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 13:04:37,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:37,345 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-10 13:04:37,345 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:37,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:37,345 INFO L82 PathProgramCache]: Analyzing trace with hash 573128957, now seen corresponding path program 1 times [2018-11-10 13:04:37,345 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:37,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:37,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:37,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:37,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:37,391 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-10 13:04:37,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:37,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:04:37,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:04:37,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:04:37,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:04:37,392 INFO L87 Difference]: Start difference. First operand 3576 states and 5092 transitions. Second operand 4 states. [2018-11-10 13:04:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:37,684 INFO L93 Difference]: Finished difference Result 6269 states and 8856 transitions. [2018-11-10 13:04:37,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:04:37,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-11-10 13:04:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:37,698 INFO L225 Difference]: With dead ends: 6269 [2018-11-10 13:04:37,698 INFO L226 Difference]: Without dead ends: 2714 [2018-11-10 13:04:37,710 INFO L605 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-10 13:04:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2018-11-10 13:04:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2714. [2018-11-10 13:04:37,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2018-11-10 13:04:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3789 transitions. [2018-11-10 13:04:37,913 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3789 transitions. Word has length 150 [2018-11-10 13:04:37,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:37,913 INFO L481 AbstractCegarLoop]: Abstraction has 2714 states and 3789 transitions. [2018-11-10 13:04:37,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:04:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3789 transitions. [2018-11-10 13:04:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 13:04:37,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:37,917 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-10 13:04:37,917 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:37,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:37,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1757771340, now seen corresponding path program 1 times [2018-11-10 13:04:37,918 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:37,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:37,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:37,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:37,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:37,967 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-10 13:04:37,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:04:37,967 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/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-10 13:04:37,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:38,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:04:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 13:04:38,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:04:38,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-10 13:04:38,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:04:38,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:04:38,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:04:38,124 INFO L87 Difference]: Start difference. First operand 2714 states and 3789 transitions. Second operand 7 states. [2018-11-10 13:04:38,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:38,422 INFO L93 Difference]: Finished difference Result 5844 states and 8588 transitions. [2018-11-10 13:04:38,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:04:38,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2018-11-10 13:04:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:38,438 INFO L225 Difference]: With dead ends: 5844 [2018-11-10 13:04:38,438 INFO L226 Difference]: Without dead ends: 3151 [2018-11-10 13:04:38,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:04:38,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-11-10 13:04:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 3149. [2018-11-10 13:04:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3149 states. [2018-11-10 13:04:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4275 transitions. [2018-11-10 13:04:38,663 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4275 transitions. Word has length 151 [2018-11-10 13:04:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:38,663 INFO L481 AbstractCegarLoop]: Abstraction has 3149 states and 4275 transitions. [2018-11-10 13:04:38,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:04:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4275 transitions. [2018-11-10 13:04:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 13:04:38,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:38,670 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:38,670 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:38,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:38,671 INFO L82 PathProgramCache]: Analyzing trace with hash -611012435, now seen corresponding path program 1 times [2018-11-10 13:04:38,671 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:38,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:38,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:38,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:38,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-10 13:04:38,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:38,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:04:38,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:04:38,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:04:38,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:04:38,738 INFO L87 Difference]: Start difference. First operand 3149 states and 4275 transitions. Second operand 5 states. [2018-11-10 13:04:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:39,336 INFO L93 Difference]: Finished difference Result 7575 states and 10446 transitions. [2018-11-10 13:04:39,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:04:39,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2018-11-10 13:04:39,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:39,360 INFO L225 Difference]: With dead ends: 7575 [2018-11-10 13:04:39,361 INFO L226 Difference]: Without dead ends: 4448 [2018-11-10 13:04:39,372 INFO L605 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-10 13:04:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2018-11-10 13:04:39,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 4016. [2018-11-10 13:04:39,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4016 states. [2018-11-10 13:04:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4016 states to 4016 states and 5211 transitions. [2018-11-10 13:04:39,673 INFO L78 Accepts]: Start accepts. Automaton has 4016 states and 5211 transitions. Word has length 195 [2018-11-10 13:04:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:39,673 INFO L481 AbstractCegarLoop]: Abstraction has 4016 states and 5211 transitions. [2018-11-10 13:04:39,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:04:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 4016 states and 5211 transitions. [2018-11-10 13:04:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 13:04:39,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:39,679 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:39,679 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:39,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:39,679 INFO L82 PathProgramCache]: Analyzing trace with hash -247545937, now seen corresponding path program 1 times [2018-11-10 13:04:39,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:39,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:39,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:39,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:39,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-10 13:04:39,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:39,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:04:39,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:04:39,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:04:39,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:04:39,742 INFO L87 Difference]: Start difference. First operand 4016 states and 5211 transitions. Second operand 5 states. [2018-11-10 13:04:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:40,090 INFO L93 Difference]: Finished difference Result 8010 states and 10432 transitions. [2018-11-10 13:04:40,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:04:40,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2018-11-10 13:04:40,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:40,103 INFO L225 Difference]: With dead ends: 8010 [2018-11-10 13:04:40,103 INFO L226 Difference]: Without dead ends: 4016 [2018-11-10 13:04:40,110 INFO L605 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-10 13:04:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2018-11-10 13:04:40,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 4016. [2018-11-10 13:04:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4016 states. [2018-11-10 13:04:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4016 states to 4016 states and 5175 transitions. [2018-11-10 13:04:40,266 INFO L78 Accepts]: Start accepts. Automaton has 4016 states and 5175 transitions. Word has length 195 [2018-11-10 13:04:40,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:40,266 INFO L481 AbstractCegarLoop]: Abstraction has 4016 states and 5175 transitions. [2018-11-10 13:04:40,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:04:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4016 states and 5175 transitions. [2018-11-10 13:04:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 13:04:40,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:40,271 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:40,271 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:40,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:40,271 INFO L82 PathProgramCache]: Analyzing trace with hash 41273453, now seen corresponding path program 1 times [2018-11-10 13:04:40,271 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:40,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:40,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:40,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:40,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-10 13:04:40,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:40,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:04:40,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:04:40,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:04:40,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:04:40,331 INFO L87 Difference]: Start difference. First operand 4016 states and 5175 transitions. Second operand 5 states. [2018-11-10 13:04:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:40,713 INFO L93 Difference]: Finished difference Result 8010 states and 10360 transitions. [2018-11-10 13:04:40,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:04:40,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2018-11-10 13:04:40,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:40,724 INFO L225 Difference]: With dead ends: 8010 [2018-11-10 13:04:40,724 INFO L226 Difference]: Without dead ends: 4016 [2018-11-10 13:04:40,732 INFO L605 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-10 13:04:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2018-11-10 13:04:40,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 4016. [2018-11-10 13:04:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4016 states. [2018-11-10 13:04:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4016 states to 4016 states and 5139 transitions. [2018-11-10 13:04:40,889 INFO L78 Accepts]: Start accepts. Automaton has 4016 states and 5139 transitions. Word has length 195 [2018-11-10 13:04:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:40,889 INFO L481 AbstractCegarLoop]: Abstraction has 4016 states and 5139 transitions. [2018-11-10 13:04:40,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:04:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4016 states and 5139 transitions. [2018-11-10 13:04:40,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 13:04:40,894 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:40,894 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:40,894 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:40,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:40,894 INFO L82 PathProgramCache]: Analyzing trace with hash -503599121, now seen corresponding path program 1 times [2018-11-10 13:04:40,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:40,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:40,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:40,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:40,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-10 13:04:40,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:40,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:04:40,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:04:40,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:04:40,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:04:40,964 INFO L87 Difference]: Start difference. First operand 4016 states and 5139 transitions. Second operand 5 states. [2018-11-10 13:04:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:41,415 INFO L93 Difference]: Finished difference Result 8086 states and 11172 transitions. [2018-11-10 13:04:41,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:04:41,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2018-11-10 13:04:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:41,429 INFO L225 Difference]: With dead ends: 8086 [2018-11-10 13:04:41,429 INFO L226 Difference]: Without dead ends: 4092 [2018-11-10 13:04:41,441 INFO L605 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-10 13:04:41,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2018-11-10 13:04:41,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 3842. [2018-11-10 13:04:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3842 states. [2018-11-10 13:04:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3842 states to 3842 states and 4817 transitions. [2018-11-10 13:04:41,622 INFO L78 Accepts]: Start accepts. Automaton has 3842 states and 4817 transitions. Word has length 195 [2018-11-10 13:04:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:41,623 INFO L481 AbstractCegarLoop]: Abstraction has 3842 states and 4817 transitions. [2018-11-10 13:04:41,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:04:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3842 states and 4817 transitions. [2018-11-10 13:04:41,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-11-10 13:04:41,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:41,630 INFO L375 BasicCegarLoop]: trace histogram [6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 13:04:41,630 INFO L424 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:41,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:41,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1362735680, now seen corresponding path program 1 times [2018-11-10 13:04:41,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:41,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:41,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:41,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:41,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 31 proven. 16 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-11-10 13:04:41,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:04:41,702 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/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-10 13:04:41,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:41,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:04:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-11-10 13:04:41,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:04:41,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-10 13:04:41,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 13:04:41,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 13:04:41,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:04:41,970 INFO L87 Difference]: Start difference. First operand 3842 states and 4817 transitions. Second operand 8 states. [2018-11-10 13:04:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:43,172 INFO L93 Difference]: Finished difference Result 7926 states and 10427 transitions. [2018-11-10 13:04:43,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:04:43,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 319 [2018-11-10 13:04:43,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:43,191 INFO L225 Difference]: With dead ends: 7926 [2018-11-10 13:04:43,191 INFO L226 Difference]: Without dead ends: 4105 [2018-11-10 13:04:43,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 321 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:04:43,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2018-11-10 13:04:43,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 3750. [2018-11-10 13:04:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3750 states. [2018-11-10 13:04:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3750 states to 3750 states and 4627 transitions. [2018-11-10 13:04:43,505 INFO L78 Accepts]: Start accepts. Automaton has 3750 states and 4627 transitions. Word has length 319 [2018-11-10 13:04:43,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:43,506 INFO L481 AbstractCegarLoop]: Abstraction has 3750 states and 4627 transitions. [2018-11-10 13:04:43,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 13:04:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3750 states and 4627 transitions. [2018-11-10 13:04:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 13:04:43,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:43,514 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, 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-10 13:04:43,514 INFO L424 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:43,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:43,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1404969028, now seen corresponding path program 1 times [2018-11-10 13:04:43,514 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:43,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:43,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:43,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:43,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-10 13:04:43,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:43,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:04:43,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:04:43,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:04:43,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:04:43,617 INFO L87 Difference]: Start difference. First operand 3750 states and 4627 transitions. Second operand 5 states. [2018-11-10 13:04:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:44,398 INFO L93 Difference]: Finished difference Result 8758 states and 12588 transitions. [2018-11-10 13:04:44,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:04:44,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2018-11-10 13:04:44,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:44,422 INFO L225 Difference]: With dead ends: 8758 [2018-11-10 13:04:44,422 INFO L226 Difference]: Without dead ends: 5030 [2018-11-10 13:04:44,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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-10 13:04:44,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5030 states. [2018-11-10 13:04:44,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5030 to 4229. [2018-11-10 13:04:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4229 states. [2018-11-10 13:04:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4229 states to 4229 states and 5047 transitions. [2018-11-10 13:04:44,847 INFO L78 Accepts]: Start accepts. Automaton has 4229 states and 5047 transitions. Word has length 218 [2018-11-10 13:04:44,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:44,847 INFO L481 AbstractCegarLoop]: Abstraction has 4229 states and 5047 transitions. [2018-11-10 13:04:44,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:04:44,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4229 states and 5047 transitions. [2018-11-10 13:04:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-11-10 13:04:44,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:44,860 INFO L375 BasicCegarLoop]: trace histogram [6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 13:04:44,860 INFO L424 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:44,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:44,860 INFO L82 PathProgramCache]: Analyzing trace with hash 4589754, now seen corresponding path program 1 times [2018-11-10 13:04:44,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:44,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:44,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:44,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:44,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 35 proven. 26 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2018-11-10 13:04:44,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:04:44,989 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/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-10 13:04:44,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:45,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:04:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-10 13:04:45,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:04:45,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-10 13:04:45,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:04:45,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:04:45,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:04:45,151 INFO L87 Difference]: Start difference. First operand 4229 states and 5047 transitions. Second operand 9 states. [2018-11-10 13:04:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:45,441 INFO L93 Difference]: Finished difference Result 7256 states and 8958 transitions. [2018-11-10 13:04:45,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 13:04:45,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 321 [2018-11-10 13:04:45,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:45,449 INFO L225 Difference]: With dead ends: 7256 [2018-11-10 13:04:45,449 INFO L226 Difference]: Without dead ends: 3051 [2018-11-10 13:04:45,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-11-10 13:04:45,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2018-11-10 13:04:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 2826. [2018-11-10 13:04:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2826 states. [2018-11-10 13:04:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3230 transitions. [2018-11-10 13:04:45,582 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3230 transitions. Word has length 321 [2018-11-10 13:04:45,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:45,583 INFO L481 AbstractCegarLoop]: Abstraction has 2826 states and 3230 transitions. [2018-11-10 13:04:45,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:04:45,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3230 transitions. [2018-11-10 13:04:45,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-10 13:04:45,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:45,587 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-10 13:04:45,587 INFO L424 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:45,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:45,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1135406973, now seen corresponding path program 1 times [2018-11-10 13:04:45,587 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:45,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:45,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:45,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:45,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:45,631 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-10 13:04:45,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:04:45,631 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/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-10 13:04:45,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:45,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:04:45,722 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-10 13:04:45,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:04:45,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-11-10 13:04:45,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:45,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:45,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:45,740 INFO L87 Difference]: Start difference. First operand 2826 states and 3230 transitions. Second operand 3 states. [2018-11-10 13:04:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:45,880 INFO L93 Difference]: Finished difference Result 4644 states and 5261 transitions. [2018-11-10 13:04:45,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:45,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-11-10 13:04:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:45,887 INFO L225 Difference]: With dead ends: 4644 [2018-11-10 13:04:45,887 INFO L226 Difference]: Without dead ends: 2457 [2018-11-10 13:04:45,891 INFO L605 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-10 13:04:45,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2018-11-10 13:04:46,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2424. [2018-11-10 13:04:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2424 states. [2018-11-10 13:04:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 2700 transitions. [2018-11-10 13:04:46,059 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 2700 transitions. Word has length 219 [2018-11-10 13:04:46,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:46,059 INFO L481 AbstractCegarLoop]: Abstraction has 2424 states and 2700 transitions. [2018-11-10 13:04:46,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:46,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 2700 transitions. [2018-11-10 13:04:46,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-10 13:04:46,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:46,064 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 13:04:46,064 INFO L424 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:46,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:46,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1544162813, now seen corresponding path program 1 times [2018-11-10 13:04:46,064 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:46,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:46,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:46,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:46,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:46,146 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-10 13:04:46,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:04:46,147 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/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-10 13:04:46,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:46,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:04:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 129 proven. 61 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 13:04:46,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:04:46,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-10 13:04:46,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 13:04:46,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 13:04:46,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:04:46,373 INFO L87 Difference]: Start difference. First operand 2424 states and 2700 transitions. Second operand 8 states. [2018-11-10 13:04:46,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:46,922 INFO L93 Difference]: Finished difference Result 4908 states and 5525 transitions. [2018-11-10 13:04:46,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:04:46,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 266 [2018-11-10 13:04:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:46,928 INFO L225 Difference]: With dead ends: 4908 [2018-11-10 13:04:46,928 INFO L226 Difference]: Without dead ends: 2778 [2018-11-10 13:04:46,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:04:46,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2018-11-10 13:04:47,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2475. [2018-11-10 13:04:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2018-11-10 13:04:47,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 2726 transitions. [2018-11-10 13:04:47,046 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 2726 transitions. Word has length 266 [2018-11-10 13:04:47,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:47,047 INFO L481 AbstractCegarLoop]: Abstraction has 2475 states and 2726 transitions. [2018-11-10 13:04:47,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 13:04:47,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2726 transitions. [2018-11-10 13:04:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-10 13:04:47,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:47,050 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-10 13:04:47,051 INFO L424 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:47,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:47,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1054270179, now seen corresponding path program 1 times [2018-11-10 13:04:47,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:47,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:47,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:47,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:47,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:47,124 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-10 13:04:47,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:04:47,124 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/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-10 13:04:47,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:47,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:04:47,293 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-10 13:04:47,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:04:47,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-10 13:04:47,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:04:47,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:04:47,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:04:47,312 INFO L87 Difference]: Start difference. First operand 2475 states and 2726 transitions. Second operand 7 states. [2018-11-10 13:04:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:47,889 INFO L93 Difference]: Finished difference Result 3394 states and 3780 transitions. [2018-11-10 13:04:47,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 13:04:47,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 273 [2018-11-10 13:04:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:47,894 INFO L225 Difference]: With dead ends: 3394 [2018-11-10 13:04:47,894 INFO L226 Difference]: Without dead ends: 1233 [2018-11-10 13:04:47,897 INFO L605 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-10 13:04:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-11-10 13:04:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1175. [2018-11-10 13:04:47,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2018-11-10 13:04:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1253 transitions. [2018-11-10 13:04:47,991 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1253 transitions. Word has length 273 [2018-11-10 13:04:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:47,991 INFO L481 AbstractCegarLoop]: Abstraction has 1175 states and 1253 transitions. [2018-11-10 13:04:47,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:04:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1253 transitions. [2018-11-10 13:04:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-10 13:04:47,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:47,994 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-10 13:04:47,994 INFO L424 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:47,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:47,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1647777794, now seen corresponding path program 1 times [2018-11-10 13:04:47,995 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:47,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:47,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:47,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:47,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:48,169 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-10 13:04:48,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:48,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:04:48,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:04:48,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:04:48,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:04:48,171 INFO L87 Difference]: Start difference. First operand 1175 states and 1253 transitions. Second operand 7 states. [2018-11-10 13:04:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:49,402 INFO L93 Difference]: Finished difference Result 2886 states and 3094 transitions. [2018-11-10 13:04:49,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 13:04:49,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 274 [2018-11-10 13:04:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:49,409 INFO L225 Difference]: With dead ends: 2886 [2018-11-10 13:04:49,409 INFO L226 Difference]: Without dead ends: 2333 [2018-11-10 13:04:49,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:04:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2018-11-10 13:04:49,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 2226. [2018-11-10 13:04:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2018-11-10 13:04:49,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 2383 transitions. [2018-11-10 13:04:49,532 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 2383 transitions. Word has length 274 [2018-11-10 13:04:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:49,533 INFO L481 AbstractCegarLoop]: Abstraction has 2226 states and 2383 transitions. [2018-11-10 13:04:49,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:04:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 2383 transitions. [2018-11-10 13:04:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-11-10 13:04:49,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:49,536 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-10 13:04:49,536 INFO L424 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:49,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:49,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1343794107, now seen corresponding path program 1 times [2018-11-10 13:04:49,536 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:49,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:49,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:49,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:49,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:49,617 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-10 13:04:49,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:04:49,617 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:04:49,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:49,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:04:49,831 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-10 13:04:49,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:04:49,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-10 13:04:49,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 13:04:49,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 13:04:49,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:04:49,850 INFO L87 Difference]: Start difference. First operand 2226 states and 2383 transitions. Second operand 8 states. [2018-11-10 13:04:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:50,178 INFO L93 Difference]: Finished difference Result 3455 states and 3703 transitions. [2018-11-10 13:04:50,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:04:50,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 329 [2018-11-10 13:04:50,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:50,180 INFO L225 Difference]: With dead ends: 3455 [2018-11-10 13:04:50,180 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 13:04:50,184 INFO L605 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-10 13:04:50,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 13:04:50,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 13:04:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 13:04:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:04:50,185 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 329 [2018-11-10 13:04:50,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:50,185 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:04:50,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 13:04:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:04:50,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 13:04:50,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 13:04:50,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:50,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:51,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:51,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:51,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:51,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:51,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:51,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:51,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:51,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:51,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:51,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:52,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:04:53,008 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-11-10 13:04:54,135 WARN L179 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 181 DAG size of output: 98 [2018-11-10 13:04:54,381 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-11-10 13:04:54,788 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 82 [2018-11-10 13:04:55,254 WARN L179 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 94 [2018-11-10 13:04:55,362 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2018-11-10 13:04:55,740 WARN L179 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 126 [2018-11-10 13:04:55,945 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 91 [2018-11-10 13:04:56,978 WARN L179 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 113 [2018-11-10 13:04:57,329 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 107 [2018-11-10 13:04:57,969 WARN L179 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 90 [2018-11-10 13:04:58,191 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-11-10 13:04:58,556 WARN L179 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 81 [2018-11-10 13:04:58,917 WARN L179 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 126 [2018-11-10 13:04:59,351 WARN L179 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 91 [2018-11-10 13:05:00,044 WARN L179 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 93 [2018-11-10 13:05:01,726 WARN L179 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 170 DAG size of output: 109 [2018-11-10 13:05:02,124 WARN L179 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 86 [2018-11-10 13:05:02,792 WARN L179 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 106 [2018-11-10 13:05:04,294 WARN L179 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 173 DAG size of output: 115 [2018-11-10 13:05:05,215 WARN L179 SmtUtils]: Spent 916.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 105 [2018-11-10 13:05:05,520 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-11-10 13:05:05,891 WARN L179 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-11-10 13:05:06,557 WARN L179 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 98 [2018-11-10 13:05:06,953 WARN L179 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 84 [2018-11-10 13:05:07,226 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-11-10 13:05:08,006 WARN L179 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 141 [2018-11-10 13:05:08,770 WARN L179 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 88 [2018-11-10 13:05:08,982 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 85 [2018-11-10 13:05:09,771 WARN L179 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 141 [2018-11-10 13:05:09,875 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 91 [2018-11-10 13:05:10,094 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-11-10 13:05:10,958 WARN L179 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 86 [2018-11-10 13:05:11,330 WARN L179 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-11-10 13:05:11,788 WARN L179 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 94 [2018-11-10 13:05:12,407 WARN L179 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 96 [2018-11-10 13:05:12,873 WARN L179 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 117 [2018-11-10 13:05:13,169 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 80 [2018-11-10 13:05:13,453 WARN L179 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 84 [2018-11-10 13:05:14,362 WARN L179 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 105 [2018-11-10 13:05:15,032 WARN L179 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 130 [2018-11-10 13:05:16,737 WARN L179 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 229 DAG size of output: 169 [2018-11-10 13:05:16,992 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2018-11-10 13:05:17,563 WARN L179 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2018-11-10 13:05:17,789 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-11-10 13:05:18,706 WARN L179 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 93 [2018-11-10 13:05:18,963 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 107 [2018-11-10 13:05:19,187 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-11-10 13:05:20,085 WARN L179 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 132 [2018-11-10 13:05:20,632 WARN L179 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2018-11-10 13:05:22,194 WARN L179 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 229 DAG size of output: 169 [2018-11-10 13:05:22,196 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 108) no Hoare annotation was computed. [2018-11-10 13:05:22,197 INFO L421 ceAbstractionStarter]: At program point L95-2(lines 83 114) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse6 (= ~T2_E~0 0)) (.cse10 (= ~T1_E~0 1))) (let ((.cse39 (= 1 ~m_pc~0)) (.cse12 (= 1 ~t2_pc~0)) (.cse40 (not .cse10)) (.cse41 (not .cse6)) (.cse42 (not .cse2)) (.cse35 (<= 2 ~m_st~0)) (.cse43 (not (= ~M_E~0 0))) (.cse44 (= ~m_i~0 1)) (.cse36 (= 0 ~t2_st~0)) (.cse45 (not .cse1)) (.cse46 (not (= ~M_E~0 1))) (.cse47 (<= 2 ~E_1~0)) (.cse48 (not (= ~E_M~0 1)))) (let ((.cse14 (and (not (= ~t2_pc~0 1)) .cse40 .cse41 .cse42 .cse35 .cse43 .cse44 .cse36 .cse45 .cse46 .cse47 .cse48)) (.cse30 (not (= |old(~t1_pc~0)| 1))) (.cse27 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse28 (<= 2 ~E_2~0)) (.cse29 (<= (+ ~local~0 1) ~token~0)) (.cse37 (not (= 0 |old(~m_st~0)|))) (.cse38 (= ~m_st~0 0)) (.cse19 (not (= 0 |old(~t2_st~0)|))) (.cse0 (< ~E_1~0 2)) (.cse31 (< |old(~t2_st~0)| 2)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse4 (< |old(~token~0)| ~local~0)) (.cse5 (< |old(~m_st~0)| 2)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse32 (not .cse12)) (.cse11 (not .cse44)) (.cse20 (not .cse39)) (.cse21 (not (= 1 ~t1_i~0))) (.cse22 (< |old(~E_2~0)| 2)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse25 (= |old(~t1_st~0)| 0)) (.cse13 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse33 (<= 2 ~t2_st~0)) (.cse34 (and .cse40 .cse12 .cse41 .cse42 .cse35 .cse43 .cse44 (= ~t1_i~0 1) (not (= ~E_M~0 0)) .cse45 .cse46 .cse39 (= ~t2_i~0 1) .cse47 .cse48)) (.cse15 (<= ~token~0 ~local~0)) (.cse16 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse17 (= ~E_2~0 |old(~E_2~0)|)) (.cse18 (<= ~local~0 ~token~0)) (.cse26 (< 0 |old(~t1_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse2 (and .cse13 .cse14 .cse27 .cse28 .cse29 .cse16) .cse3 .cse30 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or (or .cse0 .cse1 .cse31 .cse2 .cse30 .cse5 .cse6 .cse7 .cse8 .cse9 .cse32 .cse10 .cse11 .cse20 .cse21 .cse23 .cse24) (and .cse13 .cse33 .cse27 .cse34 .cse28 .cse29 .cse16) (and .cse35 .cse27 .cse28 .cse16 .cse36 .cse13 .cse29) .cse3 .cse4 .cse22 .cse25) (or .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse32 .cse10 .cse37 .cse11 (and .cse13 .cse33 .cse38 .cse15 .cse16 .cse17 .cse18) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse39) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse37 (and .cse13 .cse15 (and .cse38 .cse36) .cse16 .cse17 .cse18) .cse11 .cse12 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse39) (or .cse0 .cse1 .cse31 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse32 .cse10 .cse11 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (and .cse13 .cse33 .cse34 .cse15 .cse16 .cse17 .cse18) .cse26))))) [2018-11-10 13:05:22,197 INFO L425 ceAbstractionStarter]: For program point L87(lines 87 91) no Hoare annotation was computed. [2018-11-10 13:05:22,198 INFO L421 ceAbstractionStarter]: At program point transmit1ENTRY(lines 80 115) the Hoare annotation is: (let ((.cse33 (= 1 ~m_pc~0)) (.cse31 (= 0 ~t2_st~0)) (.cse12 (= 1 ~t2_pc~0)) (.cse35 (<= 2 ~m_st~0)) (.cse28 (= ~token~0 |old(~token~0)|)) (.cse29 (= |old(~E_2~0)| ~E_2~0)) (.cse30 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse32 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse34 (<= 2 ~t2_st~0))) (let ((.cse25 (and .cse35 .cse28 .cse29 .cse30 .cse32 .cse34)) (.cse22 (< |old(~t2_st~0)| 2)) (.cse27 (= ~m_st~0 0)) (.cse24 (not .cse12)) (.cse26 (not (= 0 |old(~m_st~0)|))) (.cse21 (< 0 |old(~t1_pc~0)|)) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse15 (and .cse35 .cse28 .cse29 .cse30 .cse31 .cse32)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse23 (not (= |old(~t1_pc~0)| 1))) (.cse4 (< |old(~token~0)| ~local~0)) (.cse5 (< |old(~m_st~0)| 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse13 (not (= 0 |old(~t2_st~0)|))) (.cse14 (not .cse33)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (< |old(~E_2~0)| 2)) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= |old(~t1_st~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or (or .cse0 .cse1 .cse22 .cse2 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse14 .cse16 .cse18 .cse19) .cse25 .cse3 .cse4 .cse17 .cse20) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse14 .cse16 .cse17 .cse18 .cse19 .cse25 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse33) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 (and .cse27 .cse28 .cse29 .cse30 .cse32 .cse34) .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse26 .cse11 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse33) (or .cse0 .cse1 .cse2 .cse15 .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2018-11-10 13:05:22,198 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-10 13:05:22,198 INFO L421 ceAbstractionStarter]: At program point L88(lines 83 114) the Hoare annotation is: (let ((.cse30 (= 1 ~m_pc~0)) (.cse26 (= 1 ~t2_pc~0))) (let ((.cse4 (not (= |old(~t1_pc~0)| 1))) (.cse18 (<= 2 ~m_st~0)) (.cse19 (= ~token~0 |old(~token~0)|)) (.cse20 (= |old(~E_2~0)| ~E_2~0)) (.cse21 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse22 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse10 (not .cse26)) (.cse5 (< |old(~m_st~0)| 2)) (.cse13 (not .cse30)) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 1)) (.cse17 (< ~local~0 |old(~token~0)|)) (.cse23 (< |old(~token~0)| ~local~0)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse11 (= ~T1_E~0 1)) (.cse29 (not (= 0 |old(~m_st~0)|))) (.cse12 (not (= ~m_i~0 1))) (.cse27 (not (= 0 |old(~t2_st~0)|))) (.cse14 (not (= 1 ~t1_i~0))) (.cse24 (< |old(~E_2~0)| 2)) (.cse15 (not (= 1 ~t2_i~0))) (.cse16 (= 0 ~E_M~0)) (.cse25 (= |old(~t1_st~0)| 0)) (.cse28 (< 0 |old(~t1_pc~0)|))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse17 (and .cse18 .cse19 .cse20 .cse21 .cse22 (<= 2 ~t2_st~0)) .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse17 .cse4 .cse23 (and .cse18 .cse19 .cse20 .cse21 (= 0 ~t2_st~0) .cse22) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse26 .cse27 .cse13 .cse14 .cse24 .cse15 .cse16 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse15 .cse16 .cse25 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse12 .cse14 .cse24 .cse15 .cse16 .cse25 .cse28 .cse30) (or .cse0 .cse1 .cse3 .cse17 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse26 .cse27 .cse13 .cse14 .cse24 .cse15 .cse16 .cse25 .cse28) (or .cse0 .cse1 .cse3 .cse17 .cse23 .cse6 .cse7 .cse8 .cse9 .cse11 .cse29 .cse12 .cse26 .cse27 .cse14 .cse24 .cse15 .cse16 .cse25 .cse28 .cse30)))) [2018-11-10 13:05:22,198 INFO L425 ceAbstractionStarter]: For program point transmit1EXIT(lines 80 115) no Hoare annotation was computed. [2018-11-10 13:05:22,198 INFO L421 ceAbstractionStarter]: At program point L109(lines 80 115) the Hoare annotation is: (let ((.cse18 (= 1 ~t2_pc~0)) (.cse26 (= 1 ~m_pc~0)) (.cse29 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~t1_st~0)) (.cse35 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse36 (<= 2 ~E_2~0)) (.cse7 (= 0 ~t2_st~0)) (.cse37 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse38 (<= (+ ~local~0 1) ~token~0))) (let ((.cse33 (not (= |old(~t1_pc~0)| 1))) (.cse34 (and .cse29 .cse4 .cse35 .cse36 .cse7 .cse37 .cse38)) (.cse28 (< |old(~m_st~0)| 2)) (.cse19 (not (= 0 |old(~t2_st~0)|))) (.cse32 (not .cse26)) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse27 (< |old(~t2_st~0)| 2)) (.cse8 (= ~T2_E~0 1)) (.cse9 (< ~local~0 |old(~token~0)|)) (.cse10 (< |old(~token~0)| ~local~0)) (.cse11 (= ~T2_E~0 0)) (.cse12 (= 0 ~M_E~0)) (.cse13 (= 1 ~M_E~0)) (.cse14 (= 1 ~E_M~0)) (.cse31 (not .cse18)) (.cse15 (= ~T1_E~0 1)) (.cse16 (not (= 0 |old(~m_st~0)|))) (.cse17 (not (= ~m_i~0 1))) (.cse20 (not (= 1 ~t1_i~0))) (.cse21 (< |old(~E_2~0)| 2)) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= ~m_st~0 0)) (.cse5 (= ~E_2~0 |old(~E_2~0)|)) (.cse6 (= ~token~0 |old(~token~0)|)) (.cse30 (<= 2 ~t2_st~0)) (.cse24 (= |old(~t1_st~0)| 0)) (.cse25 (< 0 |old(~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 .cse26) (or .cse0 .cse1 .cse27 .cse8 .cse9 .cse10 .cse28 .cse11 (and .cse2 .cse29 .cse4 .cse5 .cse6 .cse30) .cse12 .cse13 .cse14 .cse31 .cse15 .cse17 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse8 .cse9 .cse33 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse34 .cse19 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24) (or (or .cse0 .cse1 .cse27 .cse8 .cse33 .cse28 .cse11 .cse12 .cse13 .cse14 .cse31 .cse15 .cse17 .cse32 .cse20 .cse22 .cse23) .cse9 .cse10 .cse21 .cse24 .cse34 (and .cse29 .cse4 .cse35 .cse36 .cse37 .cse30 .cse38)) (or .cse0 .cse1 (and .cse2 .cse29 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse32 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse27 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse31 .cse15 .cse16 .cse17 .cse20 .cse21 .cse22 .cse23 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse30) .cse24 .cse25 .cse26)))) [2018-11-10 13:05:22,199 INFO L421 ceAbstractionStarter]: At program point L105(line 105) the Hoare annotation is: (let ((.cse31 (= 1 ~m_pc~0)) (.cse22 (= 1 ~t2_pc~0))) (let ((.cse21 (not (= |old(~t1_pc~0)| 1))) (.cse24 (<= 2 ~m_st~0)) (.cse25 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse26 (not (= ~E_2~0 0))) (.cse27 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse28 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse29 (<= (+ ~local~0 1) ~token~0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse11 (not .cse22)) (.cse6 (< |old(~m_st~0)| 2)) (.cse14 (not .cse31)) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 1)) (.cse4 (< ~local~0 |old(~token~0)|)) (.cse5 (< |old(~token~0)| ~local~0)) (.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)) (.cse30 (not (= 0 |old(~m_st~0)|))) (.cse13 (not (= ~m_i~0 1))) (.cse23 (not (= 0 |old(~t2_st~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)) (.cse20 (< 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) (or .cse0 .cse1 .cse3 .cse4 .cse21 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse22 .cse23 .cse14 .cse15 .cse16 (and .cse24 .cse25 .cse26 .cse27 (= 0 ~t2_st~0) .cse28 .cse29) .cse17 .cse18 .cse19) (or (or .cse0 .cse1 .cse2 .cse3 .cse21 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18) .cse4 .cse5 .cse16 (and .cse24 .cse25 .cse26 .cse27 .cse28 (<= 2 ~t2_st~0) .cse29) .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse30 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse22 .cse23 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse30 .cse13 .cse22 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse31)))) [2018-11-10 13:05:22,199 INFO L425 ceAbstractionStarter]: For program point L105-1(line 105) no Hoare annotation was computed. [2018-11-10 13:05:22,199 INFO L425 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 440 450) no Hoare annotation was computed. [2018-11-10 13:05:22,199 INFO L421 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 440 450) the Hoare annotation is: (let ((.cse31 (= |old(~t1_st~0)| 0)) (.cse35 (= 1 ~m_pc~0)) (.cse37 (+ ~local~0 1)) (.cse26 (= 1 ~t2_pc~0))) (let ((.cse21 (< ~E_1~0 2)) (.cse3 (< |old(~t2_st~0)| 2)) (.cse22 (<= 2 ~m_st~0)) (.cse2 (<= 2 ~t2_st~0)) (.cse24 (< |old(~m_st~0)| 2)) (.cse12 (not .cse26)) (.cse25 (< ~token~0 .cse37)) (.cse28 (not .cse35)) (.cse29 (< .cse37 ~token~0)) (.cse30 (= 0 ~E_2~0)) (.cse6 (not (= ~t1_pc~0 1))) (.cse1 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse13 (< |old(~t1_st~0)| 2)) (.cse0 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 1)) (.cse5 (< ~local~0 ~token~0)) (.cse7 (< ~token~0 ~local~0)) (.cse8 (= ~T2_E~0 0)) (.cse32 (= 0 ~t1_st~0)) (.cse23 (= 0 ~t2_st~0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse33 (not .cse31)) (.cse11 (= 1 ~E_M~0)) (.cse14 (= ~T1_E~0 1)) (.cse15 (not (= ~m_i~0 1))) (.cse27 (not (= 0 |old(~t2_st~0)|))) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (< ~E_2~0 2)) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse34 (< 0 ~t1_pc~0))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse0 .cse4 (and .cse22 .cse1 .cse23) .cse6 .cse24 .cse8 .cse9 .cse10 .cse11 .cse14 .cse25 .cse15 .cse26 .cse27 .cse28 .cse17 .cse19 .cse29 .cse20 .cse30 .cse31) (or .cse0 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 (and .cse32 .cse2) .cse10 .cse33 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse35) (let ((.cse36 (+ ~local~0 2))) (or .cse13 (or .cse21 .cse0 .cse4 .cse6 .cse24 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse28 .cse17 .cse19 .cse20) (and .cse22 .cse1) (< .cse36 ~token~0) .cse18 (< ~token~0 .cse36))) (or .cse21 .cse0 .cse3 .cse4 .cse6 (and .cse22 .cse1 .cse2) .cse24 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse25 .cse15 .cse28 .cse17 .cse19 .cse29 .cse20 .cse30 .cse31) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse1 .cse23) .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse26 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse35) (or .cse0 .cse4 .cse5 .cse7 .cse8 (and .cse32 .cse23) .cse9 .cse10 .cse33 .cse11 .cse14 .cse15 .cse26 .cse27 .cse16 .cse17 .cse18 .cse19 .cse20 .cse34 .cse35)))) [2018-11-10 13:05:22,199 INFO L425 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 440 450) no Hoare annotation was computed. [2018-11-10 13:05:22,199 INFO L425 ceAbstractionStarter]: For program point L415(lines 415 419) no Hoare annotation was computed. [2018-11-10 13:05:22,200 INFO L421 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse34 (= |old(~t1_st~0)| 0)) (.cse29 (<= 2 ~m_st~0)) (.cse21 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse22 (<= 2 ~t2_st~0)) (.cse38 (= 1 ~m_pc~0)) (.cse31 (= 1 ~t2_pc~0)) (.cse39 (+ ~local~0 1)) (.cse40 (+ ~local~0 2))) (let ((.cse27 (< .cse40 ~token~0)) (.cse28 (< ~token~0 .cse40)) (.cse12 (< ~token~0 .cse39)) (.cse33 (= 0 ~E_2~0)) (.cse18 (< .cse39 ~token~0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse5 (< |old(~m_st~0)| 2)) (.cse9 (not .cse31)) (.cse14 (not .cse38)) (.cse20 (and .cse29 .cse21 .cse22)) (.cse4 (not (= ~t1_pc~0 1))) (.cse10 (< |old(~t1_st~0)| 2)) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 1)) (.cse23 (< ~local~0 ~token~0)) (.cse24 (< ~token~0 ~local~0)) (.cse6 (= ~T2_E~0 0)) (.cse35 (= 0 ~t1_st~0)) (.cse30 (= 0 ~t2_st~0)) (.cse7 (= 0 ~M_E~0)) (.cse25 (= 1 ~M_E~0)) (.cse36 (not .cse34)) (.cse8 (= 1 ~E_M~0)) (.cse11 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse32 (not (= 0 |old(~t2_st~0)|))) (.cse26 (= 0 ~E_1~0)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (< ~E_2~0 2)) (.cse17 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse37 (< 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) (or (and .cse21 .cse22) .cse10 .cse23 .cse24 (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse25 .cse8 .cse9 .cse11 .cse13 .cse26 .cse15 .cse17 .cse19) .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse24 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse27 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse20 .cse15 .cse16 .cse17 .cse19 .cse28) (or .cse0 .cse1 .cse3 (and .cse29 .cse21 .cse30) .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 .cse11 .cse12 .cse13 .cse31 .cse32 .cse14 .cse15 .cse17 .cse18 .cse19 .cse33 .cse34) (or .cse1 .cse2 .cse3 .cse23 .cse24 .cse6 .cse7 (and .cse35 .cse22) .cse25 .cse36 .cse8 .cse9 .cse11 .cse13 .cse26 .cse15 .cse16 .cse17 .cse19 .cse37 .cse38) (or .cse10 (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse11 .cse13 .cse14 .cse15 .cse17 .cse19) (and .cse29 .cse21) .cse27 .cse16 .cse28) (or .cse12 .cse33 .cse18 .cse34 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse17 .cse19) .cse20) (or .cse1 .cse3 .cse23 .cse4 .cse24 .cse6 (and .cse21 .cse30) .cse7 .cse25 .cse8 .cse10 .cse11 .cse13 .cse31 .cse32 .cse26 .cse15 .cse16 .cse17 .cse19 .cse38) (or .cse0 (= ~m_st~0 0) .cse1 .cse3 .cse23 .cse24 .cse6 .cse7 .cse25 .cse36 .cse8 .cse11 (not (= 0 |old(~m_st~0)|)) .cse13 .cse31 .cse32 .cse15 .cse16 .cse17 .cse19 .cse37 .cse38) (or .cse1 .cse3 .cse23 .cse24 .cse6 (and .cse35 .cse30) .cse7 .cse25 .cse36 .cse8 .cse11 .cse13 .cse31 .cse32 .cse26 .cse15 .cse16 .cse17 .cse19 .cse37 .cse38)))) [2018-11-10 13:05:22,200 INFO L421 ceAbstractionStarter]: At program point L415-2(lines 415 419) the Hoare annotation is: (let ((.cse35 (= 1 ~t2_pc~0)) (.cse22 (= 1 ~m_pc~0)) (.cse31 (<= 2 ~m_st~0)) (.cse32 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse15 (<= 2 ~t2_st~0)) (.cse41 (+ ~local~0 1)) (.cse39 (= |old(~t1_st~0)| 0)) (.cse42 (+ ~local~0 2))) (let ((.cse40 (= ~m_st~0 0)) (.cse24 (< .cse42 ~token~0)) (.cse30 (< ~token~0 .cse42)) (.cse13 (= 0 ~t1_st~0)) (.cse14 (= activate_threads_~tmp~1 0)) (.cse33 (= 0 ~t2_st~0)) (.cse8 (not .cse39)) (.cse36 (not (= 0 |old(~t2_st~0)|))) (.cse21 (< 0 ~t1_pc~0)) (.cse34 (< ~token~0 .cse41)) (.cse27 (and .cse31 .cse32 .cse15)) (.cse38 (= 0 ~E_2~0)) (.cse37 (< .cse41 ~token~0)) (.cse23 (< ~E_1~0 2)) (.cse26 (< |old(~m_st~0)| 2)) (.cse29 (not .cse22)) (.cse28 (< |old(~t1_st~0)| 2)) (.cse3 (< ~local~0 ~token~0)) (.cse4 (< ~token~0 ~local~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse2 (= ~T2_E~0 1)) (.cse25 (not (= ~t1_pc~0 1))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse10 (not .cse35)) (.cse11 (= ~T1_E~0 1)) (.cse12 (not (= ~m_i~0 1))) (.cse16 (= 0 ~E_1~0)) (.cse17 (not (= 1 ~t1_i~0))) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 ~E_M~0)) (.cse18 (< ~E_2~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse23 .cse0 .cse1 .cse2 .cse24 .cse25 .cse26 .cse5 .cse6 .cse27 .cse9 .cse10 .cse28 .cse11 .cse12 .cse29 .cse17 .cse18 .cse19 .cse20 .cse30) (or .cse23 .cse0 .cse2 .cse25 .cse26 .cse5 (and .cse31 .cse32 .cse33) .cse6 .cse7 .cse9 .cse11 .cse34 .cse12 .cse35 .cse36 .cse29 .cse17 .cse19 .cse37 .cse20 .cse38 .cse39) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse25 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse28 .cse11 .cse12 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (or .cse23 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 (not (= 0 |old(~m_st~0)|)) .cse40 .cse12 .cse35 .cse36 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse23 .cse0 .cse1 .cse2 .cse3 .cse25 .cse4 .cse27 .cse26 .cse5 .cse6 .cse9 .cse10 .cse28 .cse11 .cse12 .cse29 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse2 .cse3 .cse25 .cse4 .cse5 .cse6 .cse7 .cse9 .cse28 .cse11 .cse12 .cse35 .cse36 .cse16 .cse17 .cse18 .cse19 .cse20 (and .cse32 .cse14 .cse33) .cse22) (or .cse28 (or .cse23 .cse0 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse29 .cse17 .cse19 .cse20) (and .cse40 .cse32 .cse9) (and .cse31 .cse32) .cse24 .cse18 .cse30) (or .cse0 .cse2 .cse3 .cse4 (and .cse13 .cse14 .cse33) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse35 .cse36 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse23 .cse0 .cse1 .cse2 .cse25 .cse26 .cse5 .cse27 .cse6 .cse9 .cse10 .cse28 .cse11 .cse34 .cse12 .cse29 .cse17 .cse18 .cse19 .cse37 .cse20) (or .cse34 .cse27 .cse38 .cse37 .cse39 (or .cse23 .cse0 .cse1 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse29 .cse17 .cse19 .cse20)) (or .cse28 .cse3 .cse4 (or .cse0 .cse1 .cse2 .cse25 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse16 .cse17 .cse19 .cse20) .cse18 (and .cse32 .cse15))))) [2018-11-10 13:05:22,200 INFO L425 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-11-10 13:05:22,200 INFO L425 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2018-11-10 13:05:22,201 INFO L421 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 406 439) the Hoare annotation is: (let ((.cse34 (= |old(~t1_st~0)| 0)) (.cse29 (<= 2 ~m_st~0)) (.cse21 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse22 (<= 2 ~t2_st~0)) (.cse38 (= 1 ~m_pc~0)) (.cse31 (= 1 ~t2_pc~0)) (.cse39 (+ ~local~0 1)) (.cse40 (+ ~local~0 2))) (let ((.cse27 (< .cse40 ~token~0)) (.cse28 (< ~token~0 .cse40)) (.cse12 (< ~token~0 .cse39)) (.cse33 (= 0 ~E_2~0)) (.cse18 (< .cse39 ~token~0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse5 (< |old(~m_st~0)| 2)) (.cse9 (not .cse31)) (.cse14 (not .cse38)) (.cse20 (and .cse29 .cse21 .cse22)) (.cse4 (not (= ~t1_pc~0 1))) (.cse10 (< |old(~t1_st~0)| 2)) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 1)) (.cse23 (< ~local~0 ~token~0)) (.cse24 (< ~token~0 ~local~0)) (.cse6 (= ~T2_E~0 0)) (.cse35 (= 0 ~t1_st~0)) (.cse30 (= 0 ~t2_st~0)) (.cse7 (= 0 ~M_E~0)) (.cse25 (= 1 ~M_E~0)) (.cse36 (not .cse34)) (.cse8 (= 1 ~E_M~0)) (.cse11 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse32 (not (= 0 |old(~t2_st~0)|))) (.cse26 (= 0 ~E_1~0)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (< ~E_2~0 2)) (.cse17 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse37 (< 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) (or (and .cse21 .cse22) .cse10 .cse23 .cse24 (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse25 .cse8 .cse9 .cse11 .cse13 .cse26 .cse15 .cse17 .cse19) .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse24 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse27 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse20 .cse15 .cse16 .cse17 .cse19 .cse28) (or .cse0 .cse1 .cse3 (and .cse29 .cse21 .cse30) .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 .cse11 .cse12 .cse13 .cse31 .cse32 .cse14 .cse15 .cse17 .cse18 .cse19 .cse33 .cse34) (or .cse1 .cse2 .cse3 .cse23 .cse24 .cse6 .cse7 (and .cse35 .cse22) .cse25 .cse36 .cse8 .cse9 .cse11 .cse13 .cse26 .cse15 .cse16 .cse17 .cse19 .cse37 .cse38) (or .cse10 (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse11 .cse13 .cse14 .cse15 .cse17 .cse19) (and .cse29 .cse21) .cse27 .cse16 .cse28) (or .cse12 .cse33 .cse18 .cse34 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse17 .cse19) .cse20) (or .cse1 .cse3 .cse23 .cse4 .cse24 .cse6 (and .cse21 .cse30) .cse7 .cse25 .cse8 .cse10 .cse11 .cse13 .cse31 .cse32 .cse26 .cse15 .cse16 .cse17 .cse19 .cse38) (or .cse0 (= ~m_st~0 0) .cse1 .cse3 .cse23 .cse24 .cse6 .cse7 .cse25 .cse36 .cse8 .cse11 (not (= 0 |old(~m_st~0)|)) .cse13 .cse31 .cse32 .cse15 .cse16 .cse17 .cse19 .cse37 .cse38) (or .cse1 .cse3 .cse23 .cse24 .cse6 (and .cse35 .cse30) .cse7 .cse25 .cse36 .cse8 .cse11 .cse13 .cse31 .cse32 .cse26 .cse15 .cse16 .cse17 .cse19 .cse37 .cse38)))) [2018-11-10 13:05:22,201 INFO L425 ceAbstractionStarter]: For program point L429(line 429) no Hoare annotation was computed. [2018-11-10 13:05:22,201 INFO L425 ceAbstractionStarter]: For program point L431-2(lines 406 439) no Hoare annotation was computed. [2018-11-10 13:05:22,201 INFO L425 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 406 439) no Hoare annotation was computed. [2018-11-10 13:05:22,201 INFO L425 ceAbstractionStarter]: For program point L423(lines 423 427) no Hoare annotation was computed. [2018-11-10 13:05:22,201 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-10 13:05:22,202 INFO L421 ceAbstractionStarter]: At program point L423-2(lines 423 427) the Hoare annotation is: (let ((.cse23 (= 1 ~m_pc~0)) (.cse29 (= 1 ~t2_pc~0)) (.cse36 (<= 2 ~m_st~0)) (.cse3 (= activate_threads_~tmp___0~0 0)) (.cse27 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse6 (<= 2 ~t2_st~0)) (.cse43 (+ ~local~0 1)) (.cse42 (= |old(~t1_st~0)| 0)) (.cse44 (+ ~local~0 2))) (let ((.cse34 (< .cse44 ~token~0)) (.cse37 (< ~token~0 .cse44)) (.cse24 (= 1 ~E_1~0)) (.cse28 (< |old(~t1_st~0)| 2)) (.cse35 (= ~m_st~0 0)) (.cse4 (= 0 ~t1_st~0)) (.cse5 (= activate_threads_~tmp~1 0)) (.cse25 (= 0 ~t2_st~0)) (.cse7 (< ~local~0 ~token~0)) (.cse8 (< ~token~0 ~local~0)) (.cse12 (not .cse42)) (.cse30 (not (= 0 |old(~t2_st~0)|))) (.cse17 (= 0 ~E_1~0)) (.cse19 (< ~E_2~0 2)) (.cse22 (< 0 ~t1_pc~0)) (.cse39 (< ~token~0 .cse43)) (.cse38 (and .cse36 .cse3 .cse27 .cse6)) (.cse41 (= 0 ~E_2~0)) (.cse40 (< .cse43 ~token~0)) (.cse31 (< ~E_1~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< |old(~t2_st~0)| 2)) (.cse2 (= ~T2_E~0 1)) (.cse26 (not (= ~t1_pc~0 1))) (.cse32 (< |old(~m_st~0)| 2)) (.cse9 (= ~T2_E~0 0)) (.cse10 (= 0 ~M_E~0)) (.cse11 (= 1 ~M_E~0)) (.cse13 (= 1 ~E_M~0)) (.cse14 (not .cse29)) (.cse15 (= ~T1_E~0 1)) (.cse16 (not (= ~m_i~0 1))) (.cse33 (not .cse23)) (.cse18 (not (= 1 ~t1_i~0))) (.cse20 (not (= 1 ~t2_i~0))) (.cse21 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or (and .cse24 .cse4 .cse5 .cse25) .cse0 .cse2 .cse7 .cse26 .cse8 .cse9 (and .cse3 .cse27 .cse5 .cse25) .cse10 .cse11 .cse13 .cse28 .cse15 .cse16 .cse29 .cse30 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (or .cse28 (or .cse31 .cse0 .cse2 .cse26 .cse32 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse33 .cse18 .cse20 .cse21) .cse34 .cse19 (and .cse35 .cse3 .cse27 .cse13) (and (and .cse36 .cse3) .cse27) .cse37) (or .cse31 .cse0 .cse1 .cse2 .cse34 .cse26 .cse32 .cse9 .cse10 .cse13 .cse14 .cse28 .cse15 .cse16 .cse33 .cse18 .cse19 .cse20 .cse21 .cse37 .cse38) (or .cse31 .cse0 .cse2 .cse26 .cse32 .cse9 .cse10 .cse11 .cse13 .cse15 .cse39 .cse16 .cse29 .cse30 .cse33 (and .cse36 .cse3 .cse27 .cse25) .cse18 .cse20 .cse40 .cse21 .cse41 .cse42) (or .cse28 (and .cse24 .cse4 .cse6) .cse7 (and .cse3 .cse27 .cse6) .cse8 (or .cse0 .cse1 .cse2 .cse26 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21) .cse19) (or .cse31 .cse0 .cse1 .cse2 .cse26 .cse32 .cse9 .cse10 .cse13 .cse14 .cse28 .cse15 .cse39 .cse16 .cse33 .cse18 .cse19 .cse20 .cse40 .cse21 .cse38) (or .cse0 .cse1 .cse2 .cse7 .cse26 .cse8 .cse9 .cse5 .cse10 .cse11 .cse13 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (or .cse31 .cse0 .cse1 .cse38 .cse2 .cse7 .cse26 .cse8 .cse32 .cse9 .cse10 .cse13 .cse14 .cse28 .cse15 .cse16 .cse33 .cse18 .cse19 .cse20 .cse21) (or .cse31 .cse0 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse35 .cse15 (not (= 0 |old(~m_st~0)|)) .cse16 .cse29 .cse30 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or (and .cse3 .cse4 .cse5 .cse25) .cse0 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse29 .cse30 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse39 .cse38 .cse41 .cse40 .cse42 (or .cse31 .cse0 .cse1 .cse2 .cse26 .cse32 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse33 .cse18 .cse20 .cse21))))) [2018-11-10 13:05:22,202 INFO L421 ceAbstractionStarter]: At program point L124(lines 119 150) the Hoare annotation is: (let ((.cse19 (= 1 ~m_pc~0)) (.cse26 (+ ~local~0 1))) (let ((.cse21 (< |old(~token~0)| .cse26)) (.cse23 (< .cse26 |old(~token~0)|)) (.cse12 (not (= 0 |old(~m_st~0)|))) (.cse25 (< 0 ~t1_pc~0)) (.cse10 (< |old(~t1_st~0)| 2)) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (< |old(~token~0)| ~local~0)) (.cse20 (< |old(~m_st~0)| 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse24 (not (= |old(~t1_st~0)| 0))) (.cse9 (= 1 |old(~E_M~0)|)) (.cse11 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 |old(~t2_pc~0)|)) (.cse22 (not .cse19)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (< ~E_2~0 2)) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 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) (or .cse0 .cse1 .cse2 .cse4 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse21 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse23 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse24 .cse9 .cse11 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse25) (or .cse10 .cse21 (or .cse0 .cse1 .cse2 .cse4 .cse20 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse22 .cse15 .cse17 .cse18) .cse16 .cse23 (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)|))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse24 .cse9 .cse11 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18)))) [2018-11-10 13:05:22,202 INFO L421 ceAbstractionStarter]: At program point L145(lines 116 151) the Hoare annotation is: (let ((.cse25 (= 1 ~m_pc~0)) (.cse37 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse39 (<= 2 ~m_st~0)) (.cse11 (= |old(~E_M~0)| ~E_M~0)) (.cse12 (= 1 ~t2_pc~0)) (.cse13 (= ~token~0 |old(~token~0)|)) (.cse14 (= 0 ~t1_st~0)) (.cse15 (<= 2 ~t2_st~0)) (.cse41 (+ ~local~0 1))) (let ((.cse24 (< 0 ~t1_pc~0)) (.cse29 (< |old(~token~0)| .cse41)) (.cse32 (< .cse41 |old(~token~0)|)) (.cse33 (and .cse39 .cse11 .cse12 .cse13 .cse14 .cse15)) (.cse8 (not (= |old(~t1_st~0)| 0))) (.cse31 (and .cse39 .cse11 .cse12 .cse13 .cse37 .cse15)) (.cse27 (< |old(~m_st~0)| 2)) (.cse30 (not .cse25)) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse26 (not (= ~t1_pc~0 1))) (.cse4 (< |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)|)) (.cse28 (< |old(~t1_st~0)| 2)) (.cse16 (= ~T1_E~0 1)) (.cse17 (not (= 0 |old(~m_st~0)|))) (.cse10 (= ~m_st~0 0)) (.cse18 (not (= ~m_i~0 1))) (.cse19 (= 1 |old(~t2_pc~0)|)) (.cse20 (not (= 1 ~t1_i~0))) (.cse21 (< ~E_2~0 2)) (.cse22 (not (= 1 ~t2_i~0))) (.cse23 (= 0 |old(~E_M~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) (or .cse0 .cse1 .cse2 .cse26 .cse27 .cse5 .cse6 .cse7 .cse9 .cse28 .cse16 .cse29 .cse18 .cse19 .cse30 .cse31 .cse20 .cse21 .cse22 .cse32 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse18 .cse19 .cse30 .cse33 .cse20 .cse21 .cse22 .cse23 .cse24) (let ((.cse40 (+ ~local~0 2))) (let ((.cse34 (not (= ~E_M~0 0))) (.cse35 (not (= ~E_M~0 1))) (.cse36 (<= ~token~0 .cse40)) (.cse38 (<= .cse40 ~token~0))) (or .cse28 .cse29 (or .cse0 .cse1 .cse2 .cse26 .cse27 .cse5 .cse6 .cse7 .cse9 (not .cse19) .cse16 .cse18 .cse30 .cse20 .cse22 .cse23) .cse21 .cse32 (and .cse10 .cse34 .cse35 .cse36 .cse12 .cse37 .cse15 .cse38) (and .cse39 .cse34 .cse35 .cse36 .cse12 .cse37 .cse15 .cse38)))) (or .cse0 .cse1 .cse2 .cse3 .cse26 .cse4 .cse33 .cse27 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse31 .cse2 .cse3 .cse26 .cse4 .cse27 .cse5 .cse6 .cse7 .cse9 .cse28 .cse16 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse9 .cse28 .cse16 .cse17 (and .cse10 .cse11 .cse12 .cse13 .cse37 .cse15) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25)))) [2018-11-10 13:05:22,202 INFO L425 ceAbstractionStarter]: For program point transmit2EXIT(lines 116 151) no Hoare annotation was computed. [2018-11-10 13:05:22,203 INFO L421 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: (let ((.cse19 (= 1 ~m_pc~0)) (.cse27 (+ ~local~0 1))) (let ((.cse12 (not (= 0 |old(~m_st~0)|))) (.cse25 (< 0 ~t1_pc~0)) (.cse21 (< |old(~token~0)| .cse27)) (.cse23 (< .cse27 |old(~token~0)|)) (.cse10 (< |old(~t1_st~0)| 2)) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse3 (< ~local~0 |old(~token~0)|)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (< |old(~token~0)| ~local~0)) (.cse20 (< |old(~m_st~0)| 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse24 (not (= |old(~t1_st~0)| 0))) (.cse9 (= 1 |old(~E_M~0)|)) (.cse11 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse14 (= 1 |old(~t2_pc~0)|)) (.cse22 (not .cse19)) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (< ~E_2~0 2)) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 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) (or .cse0 .cse1 .cse2 .cse4 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse21 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse23 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse24 .cse9 .cse11 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19) (or .cse10 .cse21 (or .cse0 .cse1 .cse2 .cse4 .cse20 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse22 .cse15 .cse17 .cse18) .cse16 .cse23 (let ((.cse26 (+ ~local~0 2))) (and (<= 2 ~m_st~0) (not (= ~E_M~0 0)) (<= ~token~0 .cse26) (= 1 ~t2_pc~0) (= ~t1_st~0 |old(~t1_st~0)|) (<= .cse26 ~token~0)))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse24 .cse9 .cse11 .cse13 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18)))) [2018-11-10 13:05:22,203 INFO L425 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-11-10 13:05:22,203 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 144) no Hoare annotation was computed. [2018-11-10 13:05:22,203 INFO L421 ceAbstractionStarter]: At program point L131-2(lines 119 150) the Hoare annotation is: (let ((.cse29 (<= 2 ~m_st~0)) (.cse1 (<= ~token~0 ~local~0)) (.cse10 (= ~T2_E~0 0)) (.cse39 (= ~m_i~0 1)) (.cse3 (= 0 ~t1_st~0)) (.cse6 (= ~T1_E~0 0)) (.cse24 (= 1 ~m_pc~0)) (.cse4 (<= ~local~0 ~token~0)) (.cse5 (= |old(~E_M~0)| ~E_M~0)) (.cse40 (+ ~local~0 1))) (let ((.cse2 (= ~m_st~0 0)) (.cse16 (not (= 0 |old(~m_st~0)|))) (.cse27 (< |old(~t1_st~0)| 2)) (.cse31 (< |old(~token~0)| .cse40)) (.cse36 (< .cse40 |old(~token~0)|)) (.cse30 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse23 (< 0 ~t1_pc~0)) (.cse0 (< ~E_1~0 2)) (.cse7 (= ~T2_E~0 1)) (.cse38 (and .cse29 .cse1 (and (not .cse10) (not (= ~M_E~0 0)) .cse39 .cse3 (not .cse6) .cse24 (not (= ~E_1~0 0))) .cse4 .cse5)) (.cse8 (< ~local~0 |old(~token~0)|)) (.cse25 (not (= ~t1_pc~0 1))) (.cse9 (< |old(~token~0)| ~local~0)) (.cse26 (< |old(~m_st~0)| 2)) (.cse11 (= 0 ~M_E~0)) (.cse12 (= 1 ~M_E~0)) (.cse13 (not (= |old(~t1_st~0)| 0))) (.cse14 (= 1 |old(~E_M~0)|)) (.cse15 (= ~T1_E~0 1)) (.cse17 (not .cse39)) (.cse18 (= 1 |old(~t2_pc~0)|)) (.cse28 (not .cse24)) (.cse19 (not (= 1 ~t1_i~0))) (.cse20 (< ~E_2~0 2)) (.cse21 (not (= 1 ~t2_i~0))) (.cse22 (= 0 |old(~E_M~0)|))) (and (or .cse0 (and .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) (or .cse0 .cse6 .cse7 .cse8 .cse25 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse27 .cse15 .cse17 .cse18 .cse28 (and .cse29 .cse30 .cse1 .cse4 .cse5) .cse19 .cse20 .cse21 .cse22) (let ((.cse37 (+ ~local~0 2))) (let ((.cse32 (not (= ~E_M~0 0))) (.cse33 (<= .cse37 ~token~0)) (.cse34 (not (= ~E_M~0 1))) (.cse35 (<= ~token~0 .cse37))) (or .cse27 .cse31 (or .cse0 .cse6 .cse7 .cse25 .cse26 .cse10 .cse11 .cse12 .cse14 (not .cse18) .cse15 .cse17 .cse28 .cse19 .cse21 .cse22) (and .cse30 (and .cse2 .cse32) .cse33 .cse34 .cse35) .cse20 (and .cse29 .cse30 .cse32 .cse33 .cse34 .cse35) .cse36))) (or .cse0 .cse6 .cse7 .cse8 .cse25 .cse9 (and .cse30 .cse2 .cse1 .cse4 .cse5) .cse10 .cse11 .cse12 .cse14 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24) (or .cse0 .cse6 .cse7 .cse25 .cse26 .cse10 .cse11 .cse12 .cse14 .cse27 .cse15 .cse31 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse36 .cse22 (and (= ~token~0 |old(~token~0)|) .cse29 .cse30 .cse5)) (or .cse0 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse28 .cse38 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse6 .cse7 .cse38 .cse8 .cse25 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22)))) [2018-11-10 13:05:22,203 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 127) no Hoare annotation was computed. [2018-11-10 13:05:22,204 INFO L421 ceAbstractionStarter]: At program point transmit2ENTRY(lines 116 151) the Hoare annotation is: (let ((.cse32 (= 0 ~t1_st~0)) (.cse29 (= 1 ~m_pc~0)) (.cse35 (+ ~local~0 1)) (.cse26 (not (= ~t2_pc~0 1))) (.cse20 (<= 2 ~m_st~0)) (.cse21 (= |old(~E_M~0)| ~E_M~0)) (.cse22 (= ~token~0 |old(~token~0)|)) (.cse23 (= ~t1_st~0 |old(~t1_st~0)|))) (let ((.cse0 (< |old(~t1_st~0)| 2)) (.cse30 (and .cse26 .cse20 .cse21 .cse22 .cse23)) (.cse1 (< |old(~token~0)| .cse35)) (.cse19 (< .cse35 |old(~token~0)|)) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse27 (= ~m_st~0 0)) (.cse33 (< 0 ~t1_pc~0)) (.cse2 (< ~E_1~0 2)) (.cse3 (= ~T1_E~0 0)) (.cse4 (= ~T2_E~0 1)) (.cse24 (< ~local~0 |old(~token~0)|)) (.cse5 (not (= ~t1_pc~0 1))) (.cse25 (< |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)) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse10 (= 1 |old(~E_M~0)|)) (.cse12 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse11 (= 1 |old(~t2_pc~0)|)) (.cse14 (not .cse29)) (.cse15 (not (= 1 ~t1_i~0))) (.cse18 (< ~E_2~0 2)) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 |old(~E_M~0)|)) (.cse34 (and .cse26 .cse20 .cse21 .cse22 .cse32))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 (and .cse20 .cse21 (= 1 ~t2_pc~0) .cse22 .cse23)) (or .cse2 .cse3 .cse4 .cse24 .cse5 .cse25 .cse7 (and .cse26 .cse27 .cse21 .cse22 .cse23) .cse8 .cse9 .cse10 .cse0 .cse12 .cse28 .cse13 .cse11 .cse15 .cse18 .cse16 .cse17 .cse29) (or .cse2 .cse3 .cse4 .cse24 .cse5 .cse25 .cse30 .cse6 .cse7 .cse8 .cse9 .cse10 .cse0 .cse12 .cse13 .cse11 .cse14 .cse15 .cse18 .cse16 .cse17) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse0 .cse12 .cse30 .cse1 .cse13 .cse11 .cse14 .cse15 .cse18 .cse16 .cse19 .cse17) (or .cse2 .cse3 .cse4 .cse24 .cse25 .cse7 .cse8 .cse9 .cse31 .cse10 .cse12 .cse28 .cse13 .cse11 .cse15 .cse18 .cse16 .cse17 (and .cse26 .cse27 .cse21 .cse22 .cse32) .cse33 .cse29) (or .cse2 .cse3 .cse34 .cse4 .cse24 .cse25 .cse6 .cse7 .cse8 .cse9 .cse31 .cse10 .cse12 .cse13 .cse11 .cse14 .cse15 .cse18 .cse16 .cse17 .cse33) (or .cse2 .cse3 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse31 .cse10 .cse12 .cse13 .cse11 .cse14 .cse15 .cse18 .cse16 .cse17 .cse34)))) [2018-11-10 13:05:22,204 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-10 13:05:22,204 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 240 264) no Hoare annotation was computed. [2018-11-10 13:05:22,204 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 257) no Hoare annotation was computed. [2018-11-10 13:05:22,204 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 258) no Hoare annotation was computed. [2018-11-10 13:05:22,204 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 240 264) the Hoare annotation is: true [2018-11-10 13:05:22,204 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 259) no Hoare annotation was computed. [2018-11-10 13:05:22,204 INFO L421 ceAbstractionStarter]: At program point L261(lines 243 263) the Hoare annotation is: (let ((.cse26 (= 1 ~m_pc~0)) (.cse24 (= 1 ~t2_pc~0))) (let ((.cse14 (not (= 0 ~t2_st~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse10 (< ~t1_st~0 2)) (.cse23 (not (= 0 ~m_st~0))) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse27 (< ~t2_st~0 2)) (.cse2 (= ~T2_E~0 1)) (.cse20 (< ~local~0 ~token~0)) (.cse21 (< ~token~0 ~local~0)) (.cse5 (< ~m_st~0 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse22 (not (= ~t1_st~0 0))) (.cse9 (= 1 ~E_M~0)) (.cse28 (not .cse24)) (.cse11 (= ~T1_E~0 1)) (.cse13 (not (= ~m_i~0 1))) (.cse15 (not .cse26)) (.cse16 (not (= 1 ~t1_i~0))) (.cse17 (< ~E_2~0 2)) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse3 (= exists_runnable_thread_~__retres1~3 1)) (.cse25 (< 0 ~t1_pc~0))) (and (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< .cse12 ~token~0) .cse19)) (or .cse0 .cse1 .cse2 .cse20 .cse21 .cse3 .cse6 .cse7 .cse8 .cse22 .cse9 .cse11 .cse23 .cse13 .cse24 .cse14 .cse16 .cse17 .cse18 .cse19 .cse25 .cse26) (or .cse3 .cse0 .cse1 .cse2 .cse20 .cse21 .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse11 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse25) (or .cse0 .cse1 .cse27 .cse2 .cse20 .cse21 .cse3 .cse6 .cse7 .cse8 .cse22 .cse9 .cse28 .cse11 .cse23 .cse13 .cse16 .cse17 .cse18 .cse19 .cse25 .cse26) (or .cse0 .cse1 .cse27 .cse2 .cse20 .cse4 .cse21 .cse5 .cse6 .cse7 .cse3 .cse8 .cse22 .cse9 .cse28 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse21 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse24 .cse14 .cse15 .cse3 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse27 .cse2 .cse20 .cse4 .cse21 .cse3 .cse6 .cse7 .cse8 .cse9 .cse28 .cse10 .cse11 .cse23 .cse13 .cse16 .cse17 .cse18 .cse19 .cse26) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse21 .cse6 .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse23 .cse13 .cse24 .cse14 .cse16 .cse17 .cse18 .cse19 .cse26) (or .cse0 .cse1 .cse2 .cse20 .cse4 .cse21 .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse11 .cse3 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse29 (+ ~local~0 2))) (or .cse0 .cse1 .cse27 .cse2 (< .cse29 ~token~0) .cse4 .cse6 .cse3 .cse7 .cse8 .cse9 .cse28 .cse10 .cse11 .cse23 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 (< ~token~0 .cse29))) (or .cse0 .cse1 .cse27 .cse2 .cse20 .cse21 .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse28 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse3 .cse25)))) [2018-11-10 13:05:22,204 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 240 264) no Hoare annotation was computed. [2018-11-10 13:05:22,205 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 171 189) no Hoare annotation was computed. [2018-11-10 13:05:22,205 INFO L421 ceAbstractionStarter]: At program point L186(lines 174 188) the Hoare annotation is: (let ((.cse32 (= 1 ~m_pc~0)) (.cse22 (= 1 ~t2_pc~0)) (.cse35 (+ ~local~0 2)) (.cse36 (+ ~local~0 1)) (.cse26 (= ~t1_st~0 0))) (let ((.cse23 (not (= 0 ~t2_st~0))) (.cse25 (= 0 ~E_2~0)) (.cse29 (not .cse26)) (.cse31 (< 0 ~t1_pc~0)) (.cse21 (< ~token~0 .cse36)) (.cse24 (< .cse36 ~token~0)) (.cse33 (= 1 ~E_1~0)) (.cse8 (= 1 ~M_E~0)) (.cse30 (= 0 ~E_1~0)) (.cse27 (< ~local~0 ~token~0)) (.cse28 (< ~token~0 ~local~0)) (.cse1 (< ~E_1~0 2)) (.cse2 (= ~T1_E~0 0)) (.cse34 (< ~t2_st~0 2)) (.cse3 (= ~T2_E~0 1)) (.cse18 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse16 (< .cse35 ~token~0)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (< ~m_st~0 2)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse20 (= 1 ~E_M~0)) (.cse9 (not .cse22)) (.cse0 (< ~t1_st~0 2)) (.cse10 (= ~T1_E~0 1)) (.cse11 (not (= ~m_i~0 1))) (.cse12 (not .cse32)) (.cse13 (not (= 1 ~t1_i~0))) (.cse17 (< ~E_2~0 2)) (.cse14 (not (= 1 ~t2_i~0))) (.cse15 (= 0 ~E_M~0)) (.cse19 (< ~token~0 .cse35))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse10 .cse21 .cse11 .cse22 .cse23 .cse12 .cse18 .cse13 .cse14 .cse24 .cse15 .cse25 .cse26) (or .cse2 .cse3 .cse27 .cse28 .cse6 .cse7 .cse8 .cse29 .cse20 .cse10 .cse11 .cse22 .cse23 .cse18 .cse30 .cse13 .cse17 .cse14 .cse15 .cse31 .cse32) (or (or .cse1 (not .cse20) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 0 ~m_st~0)) .cse11 .cse12 .cse13 .cse14) .cse0 .cse18 .cse16 .cse17 .cse19) (or .cse2 .cse18 .cse3 .cse27 .cse4 .cse28 .cse6 .cse7 .cse8 .cse20 .cse0 .cse10 .cse11 .cse22 .cse23 .cse33 .cse30 .cse13 .cse17 .cse14 .cse15 .cse32) (or .cse21 .cse25 .cse24 .cse26 .cse18 (or .cse1 .cse2 .cse34 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)) (or .cse18 .cse2 .cse34 .cse3 .cse27 .cse28 .cse6 .cse7 .cse8 .cse29 .cse20 .cse9 .cse10 .cse11 .cse30 .cse13 .cse17 .cse14 .cse15 .cse31 .cse32) (or .cse1 .cse2 .cse34 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse0 .cse10 .cse21 .cse11 .cse12 .cse13 .cse17 .cse14 .cse24 .cse15 .cse18) (or .cse2 .cse34 .cse3 .cse33 .cse27 .cse4 .cse28 .cse6 .cse7 .cse8 .cse20 .cse9 .cse0 .cse10 .cse11 .cse18 .cse30 .cse13 .cse17 .cse14 .cse15) (or .cse1 .cse2 .cse34 .cse3 .cse27 .cse4 .cse28 .cse18 .cse5 .cse6 .cse7 .cse20 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14 .cse15) (or .cse1 .cse2 .cse34 .cse3 .cse18 .cse16 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 .cse19)))) [2018-11-10 13:05:22,205 INFO L428 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 171 189) the Hoare annotation is: true [2018-11-10 13:05:22,205 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 171 189) no Hoare annotation was computed. [2018-11-10 13:05:22,205 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 181) no Hoare annotation was computed. [2018-11-10 13:05:22,205 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 184) no Hoare annotation was computed. [2018-11-10 13:05:22,205 INFO L425 ceAbstractionStarter]: For program point L175-2(lines 175 184) no Hoare annotation was computed. [2018-11-10 13:05:22,205 INFO L425 ceAbstractionStarter]: For program point L382-1(lines 371 404) no Hoare annotation was computed. [2018-11-10 13:05:22,206 INFO L421 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 368 405) the Hoare annotation is: (let ((.cse25 (= 1 ~m_pc~0)) (.cse24 (= 1 ~t2_pc~0))) (let ((.cse2 (< ~t2_st~0 2)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (< ~m_st~0 2)) (.cse10 (not .cse24)) (.cse11 (< ~t1_st~0 2)) (.cse15 (not .cse25)) (.cse0 (< |old(~E_1~0)| 2)) (.cse16 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0))) (.cse1 (= |old(~T1_E~0)| 0)) (.cse3 (= |old(~T2_E~0)| 1)) (.cse22 (< ~local~0 ~token~0)) (.cse23 (< ~token~0 ~local~0)) (.cse6 (= |old(~T2_E~0)| 0)) (.cse7 (= 0 |old(~M_E~0)|)) (.cse8 (= 1 |old(~M_E~0)|)) (.cse9 (= 1 |old(~E_M~0)|)) (.cse12 (= |old(~T1_E~0)| 1)) (.cse14 (not (= ~m_i~0 1))) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (< |old(~E_2~0)| 2)) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 |old(~E_M~0)|))) (and (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 .cse13) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< .cse13 ~token~0) .cse20)) (let ((.cse21 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse16 (< .cse21 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 (< ~token~0 .cse21))) (or .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse16) (or .cse0 .cse16 .cse1 .cse3 .cse22 .cse23 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9 .cse12 (not (= 0 ~m_st~0)) .cse14 .cse24 (not (= 0 ~t2_st~0)) .cse17 .cse18 .cse19 .cse20 (< 0 ~t1_pc~0) .cse25)))) [2018-11-10 13:05:22,206 INFO L425 ceAbstractionStarter]: For program point L372-1(lines 371 404) no Hoare annotation was computed. [2018-11-10 13:05:22,206 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 368 405) no Hoare annotation was computed. [2018-11-10 13:05:22,206 INFO L425 ceAbstractionStarter]: For program point L387-1(lines 371 404) no Hoare annotation was computed. [2018-11-10 13:05:22,206 INFO L425 ceAbstractionStarter]: For program point L377-1(lines 371 404) no Hoare annotation was computed. [2018-11-10 13:05:22,206 INFO L425 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 368 405) no Hoare annotation was computed. [2018-11-10 13:05:22,206 INFO L425 ceAbstractionStarter]: For program point L392-1(lines 371 404) no Hoare annotation was computed. [2018-11-10 13:05:22,206 INFO L425 ceAbstractionStarter]: For program point L226-1(lines 220 238) no Hoare annotation was computed. [2018-11-10 13:05:22,206 INFO L425 ceAbstractionStarter]: For program point L221-1(lines 220 238) no Hoare annotation was computed. [2018-11-10 13:05:22,206 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 217 239) no Hoare annotation was computed. [2018-11-10 13:05:22,206 INFO L421 ceAbstractionStarter]: At program point init_threadsENTRY(lines 217 239) the Hoare annotation is: (or (< ~E_1~0 2) (and (= ~m_st~0 0) (= 0 ~t1_st~0) (= 0 ~t2_st~0)) (= ~T1_E~0 0) (= ~T2_E~0 1) (< ~local~0 ~token~0) (< ~token~0 ~local~0) (= ~T2_E~0 0) (= 0 ~M_E~0) (= 1 ~M_E~0) (not (= |old(~t1_st~0)| 0)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 ~t2_pc~0) (not (= 0 |old(~t2_st~0)|)) (not (= 1 ~t1_i~0)) (< ~E_2~0 2) (not (= 1 ~t2_i~0)) (= 0 ~E_M~0) (< 0 ~t1_pc~0) (= 1 ~m_pc~0)) [2018-11-10 13:05:22,206 INFO L425 ceAbstractionStarter]: For program point L231-1(lines 217 239) no Hoare annotation was computed. [2018-11-10 13:05:22,206 INFO L425 ceAbstractionStarter]: For program point L593(line 593) no Hoare annotation was computed. [2018-11-10 13:05:22,207 INFO L421 ceAbstractionStarter]: At program point L592(line 592) the Hoare annotation is: (or (< |old(~E_1~0)| 2) (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (not (= ~t2_i~0 1)) (<= ~token~0 ~local~0) (= |old(~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) (= ~t1_pc~0 |old(~t1_pc~0)|) (not (= ~m_i~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~t2_pc~0)|) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_2~0)| 2) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-10 13:05:22,207 INFO L421 ceAbstractionStarter]: At program point L592-1(line 592) the Hoare annotation is: (or (< |old(~E_1~0)| 2) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (= ~m_i~0 1) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= ~t2_i~0 1) (= |old(~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) (= ~t1_pc~0 |old(~t1_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~t2_pc~0)|) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_2~0)| 2) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-10 13:05:22,207 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 587 598) the Hoare annotation is: (or (< |old(~E_1~0)| 2) (= |old(~T1_E~0)| 0) (= 1 |old(~t2_i~0)|) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= 1 |old(~t1_i~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (not (= ~t1_i~0 1)) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (not (= ~t2_i~0 1)) (<= ~token~0 ~local~0) (= |old(~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) (= ~t1_pc~0 |old(~t1_pc~0)|) (not (= ~m_i~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= 1 |old(~M_E~0)|) (= |old(~m_i~0)| 1) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~t2_pc~0)|) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_2~0)| 2) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-10 13:05:22,207 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 587 598) no Hoare annotation was computed. [2018-11-10 13:05:22,207 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 587 598) no Hoare annotation was computed. [2018-11-10 13:05:22,207 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-10 13:05:22,207 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-10 13:05:22,207 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-10 13:05:22,208 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-10 13:05:22,208 INFO L425 ceAbstractionStarter]: For program point masterEXIT(lines 36 79) no Hoare annotation was computed. [2018-11-10 13:05:22,208 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-10 13:05:22,208 INFO L421 ceAbstractionStarter]: At program point L44(lines 39 78) the Hoare annotation is: (let ((.cse22 (= 1 ~t2_pc~0))) (let ((.cse12 (< |old(~t1_st~0)| 2)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse5 (not (= ~t1_pc~0 1))) (.cse11 (not .cse22)) (.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= ~T1_E~0 0)) (.cse3 (= ~T2_E~0 1)) (.cse4 (< |old(~local~0)| |old(~token~0)|)) (.cse6 (< |old(~token~0)| |old(~local~0)|)) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse20 (not (= |old(~t1_st~0)| 0))) (.cse10 (= 1 ~E_M~0)) (.cse13 (= ~T1_E~0 1)) (.cse14 (not (= ~m_i~0 1))) (.cse23 (not (= 0 |old(~t2_st~0)|))) (.cse15 (not (= 1 ~t1_i~0))) (.cse16 (< ~E_2~0 2)) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 ~E_M~0)) (.cse21 (< 0 ~t1_pc~0)) (.cse19 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21 .cse19) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse22 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse25 (+ |old(~local~0)| 2))) (or (let ((.cse24 (+ ~local~0 2))) (and (= |old(~E_1~0)| ~E_1~0) (<= ~token~0 .cse24) (= ~token~0 |old(~token~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (<= 2 ~t2_st~0) (= 1 ~m_pc~0) (<= .cse24 ~token~0))) .cse12 (< .cse25 |old(~token~0)|) .cse16 (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 (not .cse19) .cse15 .cse17 .cse18) (< |old(~token~0)| .cse25))) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse13 .cse14 .cse22 .cse23 .cse15 .cse16 .cse17 .cse18 .cse21 .cse19)))) [2018-11-10 13:05:22,208 INFO L421 ceAbstractionStarter]: At program point L73(lines 36 79) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse19 (= ~T1_E~0 1)) (.cse3 (= ~T2_E~0 1)) (.cse6 (= ~T2_E~0 0))) (let ((.cse37 (not .cse6)) (.cse38 (not .cse3)) (.cse39 (not (= ~M_E~0 0))) (.cse40 (= ~m_i~0 1)) (.cse41 (not (= ~E_M~0 0))) (.cse42 (<= 2 ~E_2~0)) (.cse43 (not (= ~M_E~0 1))) (.cse44 (= ~t2_i~0 1)) (.cse45 (= 1 ~t1_pc~0)) (.cse46 (not (= ~E_M~0 1))) (.cse47 (not .cse19)) (.cse33 (= 1 ~t2_pc~0)) (.cse48 (= ~t1_i~0 1)) (.cse35 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse11 (<= 2 ~t2_st~0)) (.cse49 (not .cse1)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (= 0 ~t1_st~0)) (.cse36 (= 0 ~t2_st~0)) (.cse12 (= 1 ~m_pc~0)) (.cse13 (<= ~local~0 ~token~0))) (let ((.cse16 (not (= |old(~t1_st~0)| 0))) (.cse25 (< 0 ~t1_pc~0)) (.cse32 (and .cse7 .cse8 .cse9 .cse10 .cse36 .cse12 .cse13)) (.cse34 (not (= 0 |old(~t2_st~0)|))) (.cse0 (< |old(~E_1~0)| 2)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse4 (< |old(~local~0)| |old(~token~0)|)) (.cse31 (not (= ~t1_pc~0 1))) (.cse5 (< |old(~token~0)| |old(~local~0)|)) (.cse29 (and .cse37 .cse38 .cse39 .cse40 .cse7 .cse41 (<= 2 ~t1_st~0) .cse42 .cse43 .cse8 .cse44 .cse45 .cse9 .cse46 .cse47 .cse33 .cse48 .cse35 .cse11 .cse49 .cse12 .cse13)) (.cse14 (= 0 ~M_E~0)) (.cse15 (= 1 ~M_E~0)) (.cse17 (= 1 ~E_M~0)) (.cse18 (not .cse33)) (.cse27 (< |old(~t1_st~0)| 2)) (.cse20 (not .cse40)) (.cse21 (not (= 1 ~t1_i~0))) (.cse22 (< ~E_2~0 2)) (.cse23 (not (= 1 ~t2_i~0))) (.cse24 (= 0 ~E_M~0)) (.cse30 (and .cse37 .cse38 .cse39 .cse40 .cse7 .cse41 .cse42 .cse43 .cse8 .cse44 .cse45 .cse9 .cse46 .cse47 .cse33 .cse48 .cse10 .cse11 .cse49 .cse12 .cse13)) (.cse26 (= 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) (let ((.cse28 (+ |old(~local~0)| 2))) (or .cse27 (< .cse28 |old(~token~0)|) .cse22 .cse29 .cse30 (or .cse0 .cse1 .cse2 .cse3 .cse31 .cse6 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 (not .cse26) .cse21 .cse23 .cse24) (< |old(~token~0)| .cse28))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse14 .cse15 .cse16 .cse32 .cse17 .cse19 .cse20 .cse33 .cse34 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse1 .cse3 .cse4 .cse31 .cse5 .cse32 .cse6 .cse14 .cse15 .cse17 .cse27 .cse19 .cse20 .cse33 .cse34 (and .cse7 .cse8 .cse9 .cse35 .cse36 .cse12 .cse13) .cse21 .cse22 .cse23 .cse24 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse29 .cse6 .cse14 .cse15 .cse17 .cse18 .cse27 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse30 .cse26))))) [2018-11-10 13:05:22,209 INFO L421 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: (let ((.cse23 (= 1 ~t2_pc~0))) (let ((.cse5 (< |old(~t2_st~0)| 2)) (.cse12 (not .cse23)) (.cse7 (not (= ~t1_pc~0 1))) (.cse0 (< |old(~t1_st~0)| 2)) (.cse3 (< |old(~E_1~0)| 2)) (.cse4 (= ~T1_E~0 0)) (.cse6 (= ~T2_E~0 1)) (.cse19 (< |old(~local~0)| |old(~token~0)|)) (.cse20 (< |old(~token~0)| |old(~local~0)|)) (.cse8 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse11 (= 1 ~E_M~0)) (.cse13 (= ~T1_E~0 1)) (.cse14 (not (= ~m_i~0 1))) (.cse24 (not (= 0 |old(~t2_st~0)|))) (.cse16 (not (= 1 ~t1_i~0))) (.cse2 (< ~E_2~0 2)) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 ~E_M~0)) (.cse22 (< 0 ~t1_pc~0)) (.cse15 (= 1 |old(~m_pc~0)|))) (and (let ((.cse1 (+ |old(~local~0)| 2))) (or .cse0 (< .cse1 |old(~token~0)|) .cse2 (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not .cse15) .cse16 .cse17 .cse18) (< |old(~token~0)| .cse1))) (or .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse16 .cse2 .cse17 .cse18 .cse15) (or .cse3 .cse4 .cse5 .cse6 .cse19 .cse20 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse16 .cse2 .cse17 .cse18 .cse22 .cse15) (or .cse3 .cse4 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse0 .cse13 .cse14 .cse23 .cse24 .cse16 .cse2 .cse17 .cse18 .cse15) (or .cse3 .cse4 .cse6 .cse19 .cse20 .cse8 .cse9 .cse10 .cse21 .cse11 .cse13 .cse14 .cse23 .cse24 .cse16 .cse2 .cse17 .cse18 .cse22 .cse15)))) [2018-11-10 13:05:22,209 INFO L421 ceAbstractionStarter]: At program point L65(lines 39 78) the Hoare annotation is: (let ((.cse28 (= 1 ~t2_pc~0))) (let ((.cse27 (= 0 ~t2_st~0)) (.cse29 (not (= 0 |old(~t2_st~0)|))) (.cse5 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse19 (< |old(~t1_st~0)| 2)) (.cse12 (not (= ~t1_pc~0 1))) (.cse0 (< |old(~E_1~0)| 2)) (.cse8 (= ~T1_E~0 0)) (.cse9 (< |old(~t2_st~0)| 2)) (.cse10 (= ~T2_E~0 1)) (.cse11 (< |old(~local~0)| |old(~token~0)|)) (.cse13 (< |old(~token~0)| |old(~local~0)|)) (.cse14 (= ~T2_E~0 0)) (.cse15 (= 0 ~M_E~0)) (.cse16 (= 1 ~M_E~0)) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse17 (= 1 ~E_M~0)) (.cse18 (not .cse28)) (.cse20 (= ~T1_E~0 1)) (.cse21 (not (= ~m_i~0 1))) (.cse22 (not (= 1 ~t1_i~0))) (.cse23 (< ~E_2~0 2)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~E_M~0)) (.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~token~0 |old(~token~0)|)) (.cse30 (= 0 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse32 (< 0 ~t1_pc~0)) (.cse26 (= 1 |old(~m_pc~0)|))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse8 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse7) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse28 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse8 .cse10 .cse11 (and .cse1 .cse2 .cse3 .cse4 .cse30 .cse27 .cse7) .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse20 .cse21 .cse28 .cse29 .cse22 .cse23 .cse24 .cse25 .cse32 .cse26) (let ((.cse34 (+ |old(~local~0)| 2))) (or (let ((.cse33 (+ ~local~0 2))) (and .cse1 (<= ~token~0 .cse33) .cse4 .cse5 .cse6 (= 1 ~m_pc~0) (<= .cse33 ~token~0))) .cse19 (< .cse34 |old(~token~0)|) .cse23 (or .cse0 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 (not .cse26) .cse22 .cse24 .cse25) (< |old(~token~0)| .cse34))) (or .cse0 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (and .cse1 .cse2 .cse3 .cse4 .cse30 .cse6 .cse7) .cse32 .cse26)))) [2018-11-10 13:05:22,209 INFO L421 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse31 (= 1 ~t2_pc~0))) (let ((.cse8 (< |old(~t2_st~0)| 2)) (.cse17 (not .cse31)) (.cse4 (<= 2 ~t2_st~0)) (.cse3 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse11 (not (= ~t1_pc~0 1))) (.cse18 (< |old(~t1_st~0)| 2)) (.cse0 (< |old(~E_1~0)| 2)) (.cse7 (= ~T1_E~0 0)) (.cse9 (= ~T2_E~0 1)) (.cse10 (< |old(~local~0)| |old(~token~0)|)) (.cse12 (< |old(~token~0)| |old(~local~0)|)) (.cse13 (= ~T2_E~0 0)) (.cse14 (= 0 ~M_E~0)) (.cse15 (= 1 ~M_E~0)) (.cse27 (not (= |old(~t1_st~0)| 0))) (.cse16 (= 1 ~E_M~0)) (.cse1 (not (= ~m_pc~0 1))) (.cse2 (<= ~token~0 ~local~0)) (.cse26 (= 0 ~t1_st~0)) (.cse30 (= 0 ~t2_st~0)) (.cse5 (not (= ~E_1~0 0))) (.cse6 (<= ~local~0 ~token~0)) (.cse19 (= ~T1_E~0 1)) (.cse20 (not (= ~m_i~0 1))) (.cse32 (not (= 0 |old(~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)) (.cse28 (< 0 ~t1_pc~0)) (.cse25 (= 1 |old(~m_pc~0)|))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 (and .cse1 .cse2 .cse26 .cse4 .cse5 .cse6) .cse14 .cse15 .cse27 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse28 .cse25) (let ((.cse29 (+ |old(~local~0)| 2))) (or .cse18 (< .cse29 |old(~token~0)|) .cse22 (or .cse0 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 (not .cse25) .cse21 .cse23 .cse24) (and .cse2 .cse3 .cse4 (= 1 ~m_pc~0) .cse5 .cse6) (< |old(~token~0)| .cse29))) (or .cse0 .cse7 .cse9 .cse10 (and .cse1 .cse2 .cse3 .cse30 .cse5 .cse6) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse31 .cse32 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 (and .cse1 .cse2 .cse26 .cse30 .cse5 .cse6) .cse19 .cse20 .cse31 .cse32 .cse21 .cse22 .cse23 .cse24 .cse28 .cse25)))) [2018-11-10 13:05:22,210 INFO L425 ceAbstractionStarter]: For program point L57-1(line 57) no Hoare annotation was computed. [2018-11-10 13:05:22,210 INFO L425 ceAbstractionStarter]: For program point L51(lines 51 72) no Hoare annotation was computed. [2018-11-10 13:05:22,210 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-11-10 13:05:22,210 INFO L421 ceAbstractionStarter]: At program point masterENTRY(lines 36 79) the Hoare annotation is: (let ((.cse28 (= 1 ~t2_pc~0))) (let ((.cse27 (= 0 ~t2_st~0)) (.cse29 (not (= 0 |old(~t2_st~0)|))) (.cse5 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse19 (< |old(~t1_st~0)| 2)) (.cse12 (not (= ~t1_pc~0 1))) (.cse0 (< |old(~E_1~0)| 2)) (.cse8 (= ~T1_E~0 0)) (.cse9 (< |old(~t2_st~0)| 2)) (.cse10 (= ~T2_E~0 1)) (.cse11 (< |old(~local~0)| |old(~token~0)|)) (.cse13 (< |old(~token~0)| |old(~local~0)|)) (.cse14 (= ~T2_E~0 0)) (.cse15 (= 0 ~M_E~0)) (.cse16 (= 1 ~M_E~0)) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse17 (= 1 ~E_M~0)) (.cse18 (not .cse28)) (.cse20 (= ~T1_E~0 1)) (.cse21 (not (= ~m_i~0 1))) (.cse22 (not (= 1 ~t1_i~0))) (.cse23 (< ~E_2~0 2)) (.cse24 (not (= 1 ~t2_i~0))) (.cse25 (= 0 ~E_M~0)) (.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~token~0 |old(~token~0)|)) (.cse30 (= 0 ~t1_st~0)) (.cse6 (<= 2 ~t2_st~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse32 (< 0 ~t1_pc~0)) (.cse26 (= 1 |old(~m_pc~0)|))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse8 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse7) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse28 .cse29 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse0 .cse8 .cse10 .cse11 (and .cse1 .cse2 .cse3 .cse4 .cse30 .cse27 .cse7) .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse20 .cse21 .cse28 .cse29 .cse22 .cse23 .cse24 .cse25 .cse32 .cse26) (let ((.cse34 (+ |old(~local~0)| 2))) (or (let ((.cse33 (+ ~local~0 2))) (and .cse1 (<= ~token~0 .cse33) .cse4 .cse5 .cse6 (= 1 ~m_pc~0) (<= .cse33 ~token~0))) .cse19 (< .cse34 |old(~token~0)|) .cse23 (or .cse0 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 (not .cse26) .cse22 .cse24 .cse25) (< |old(~token~0)| .cse34))) (or .cse0 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (and .cse1 .cse2 .cse3 .cse4 .cse30 .cse6 .cse7) .cse32 .cse26)))) [2018-11-10 13:05:22,213 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 451 459) no Hoare annotation was computed. [2018-11-10 13:05:22,213 INFO L421 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 451 459) the Hoare annotation is: (let ((.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< ~t2_st~0 2)) (.cse3 (= ~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 (not (= 1 ~m_pc~0))) (.cse19 (= |old(~M_E~0)| ~M_E~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 (< ~local~0 ~token~0) .cse4 (< ~token~0 ~local~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse20 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse19 (< .cse20 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~token~0 .cse20))) (let ((.cse21 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 .cse21) .cse13 .cse14 .cse19 .cse15 .cse16 .cse17 (< .cse21 ~token~0) .cse18)))) [2018-11-10 13:05:22,213 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 451 459) no Hoare annotation was computed. [2018-11-10 13:05:22,213 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:05:22,213 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~t1_pc~0 |old(~t1_pc~0)|) (= |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-10 13:05:22,216 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:05:22,216 INFO L428 ceAbstractionStarter]: At program point L524(lines 513 526) the Hoare annotation is: true [2018-11-10 13:05:22,216 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 509 527) no Hoare annotation was computed. [2018-11-10 13:05:22,216 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-11-10 13:05:22,216 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 509 527) the Hoare annotation is: true [2018-11-10 13:05:22,216 INFO L428 ceAbstractionStarter]: At program point L515(line 515) the Hoare annotation is: true [2018-11-10 13:05:22,216 INFO L425 ceAbstractionStarter]: For program point L515-1(line 515) no Hoare annotation was computed. [2018-11-10 13:05:22,216 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 509 527) no Hoare annotation was computed. [2018-11-10 13:05:22,217 INFO L421 ceAbstractionStarter]: At program point L287(line 287) the Hoare annotation is: (let ((.cse35 (= 1 |old(~m_pc~0)|)) (.cse18 (= 1 |old(~t2_pc~0)|))) (let ((.cse14 (< |old(~local~0)| |old(~token~0)|)) (.cse28 (< |old(~token~0)| |old(~local~0)|)) (.cse20 (< |old(~E_1~0)| 2)) (.cse12 (= ~T1_E~0 0)) (.cse36 (< |old(~t2_st~0)| 2)) (.cse13 (= ~T2_E~0 1)) (.cse37 (not (= |old(~t1_pc~0)| 1))) (.cse38 (< |old(~m_st~0)| 2)) (.cse15 (= ~T2_E~0 0)) (.cse16 (= 0 ~M_E~0)) (.cse17 (= 1 ~M_E~0)) (.cse29 (= 1 |old(~E_M~0)|)) (.cse39 (not .cse18)) (.cse40 (< |old(~t1_st~0)| 2)) (.cse30 (= ~T1_E~0 1)) (.cse31 (not (= ~m_i~0 1))) (.cse41 (not .cse35)) (.cse19 (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 (not (= ~t2_pc~0 1))) (.cse4 (= 0 ~t2_st~0)) (.cse0 (= 1 ~t1_pc~0)) (.cse25 (and (not .cse12) (not .cse15) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)))) (.cse26 (not (= ~E_M~0 1))) (.cse8 (<= 2 ~t1_st~0)) (.cse21 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse23 (<= 2 ~t2_st~0)) (.cse6 (= ~token~0 |old(~token~0)|)) (.cse7 (<= ~token~0 ~local~0)) (.cse24 (= 1 ~t2_pc~0)) (.cse2 (= |old(~E_1~0)| ~E_1~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse5 (= |old(~E_M~0)| ~E_M~0)) (.cse22 (= 0 ~t1_st~0)) (.cse9 (= eval_~tmp~0 1)) (.cse10 (= ~E_2~0 |old(~E_2~0)|)) (.cse11 (<= ~local~0 ~token~0))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= |old(~t1_st~0)| 0)) .cse18 .cse19 .cse20 (and .cse21 .cse6 .cse7 .cse9 .cse10 .cse11 (and .cse1 .cse2 .cse22 .cse3 .cse4 .cse5)) (let ((.cse27 (+ ~local~0 2))) (and .cse23 .cse0 (<= 2 ~E_2~0) (and .cse24 .cse25 (= 1 ~m_pc~0) (<= 2 ~E_1~0) .cse26) .cse8 (<= .cse27 ~token~0) .cse9 (<= ~token~0 .cse27))) .cse28 (and (and .cse23 .cse0 .cse9 (and .cse24 .cse2 .cse25 .cse3 .cse26)) .cse6 .cse7 .cse8 .cse10 .cse11) .cse29 .cse30 (not (= 0 |old(~m_st~0)|)) .cse31 (not (= 0 |old(~t2_st~0)|)) .cse32 .cse33 .cse34 (and .cse21 .cse23 .cse6 .cse7 (and .cse24 .cse2 .cse3 .cse5) .cse22 .cse9 .cse10 .cse11) (< 0 |old(~t1_pc~0)|) .cse35)) (or .cse20 .cse12 .cse36 .cse13 .cse14 .cse37 .cse28 .cse38 .cse15 .cse16 .cse17 .cse29 .cse39 .cse40 .cse30 .cse31 .cse41 .cse19 .cse32 .cse33 .cse34) (let ((.cse42 (+ |old(~local~0)| 2))) (or .cse20 .cse12 .cse36 .cse13 (< .cse42 |old(~token~0)|) .cse37 .cse38 .cse15 .cse16 .cse17 .cse29 .cse39 .cse40 .cse30 .cse31 .cse41 .cse19 .cse32 .cse33 .cse34 (< |old(~token~0)| .cse42))) (let ((.cse43 (+ |old(~local~0)| 1))) (or .cse20 .cse12 .cse36 .cse13 .cse37 .cse38 .cse15 .cse16 .cse17 .cse29 .cse39 .cse40 .cse30 (< |old(~token~0)| .cse43) .cse31 .cse41 .cse19 .cse32 .cse33 (< .cse43 |old(~token~0)|) .cse34))))) [2018-11-10 13:05:22,218 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2018-11-10 13:05:22,218 INFO L425 ceAbstractionStarter]: For program point L271-1(lines 271 323) no Hoare annotation was computed. [2018-11-10 13:05:22,218 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 265 329) no Hoare annotation was computed. [2018-11-10 13:05:22,219 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 291) no Hoare annotation was computed. [2018-11-10 13:05:22,219 INFO L421 ceAbstractionStarter]: At program point L309(lines 271 323) the Hoare annotation is: (let ((.cse46 (= 1 |old(~m_pc~0)|)) (.cse53 (= ~m_i~0 1)) (.cse28 (= 1 |old(~t2_pc~0)|)) (.cse63 (+ ~local~0 1)) (.cse64 (+ ~local~0 2))) (let ((.cse33 (<= ~token~0 .cse64)) (.cse32 (<= .cse64 ~token~0)) (.cse36 (<= ~token~0 .cse63)) (.cse37 (<= .cse63 ~token~0)) (.cse34 (< |old(~E_1~0)| 2)) (.cse0 (= ~T1_E~0 0)) (.cse54 (< |old(~t2_st~0)| 2)) (.cse9 (= ~T2_E~0 1)) (.cse10 (< |old(~local~0)| |old(~token~0)|)) (.cse57 (not (= |old(~t1_pc~0)| 1))) (.cse38 (< |old(~token~0)| |old(~local~0)|)) (.cse23 (= |old(~E_1~0)| ~E_1~0)) (.cse14 (<= 2 ~m_st~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse7 (= ~E_2~0 |old(~E_2~0)|)) (.cse18 (= |old(~E_M~0)| ~E_M~0)) (.cse13 (= 1 ~t2_pc~0)) (.cse2 (= ~token~0 |old(~token~0)|)) (.cse55 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse11 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse12 (<= 2 ~t2_st~0)) (.cse16 (= 1 ~m_pc~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse58 (< |old(~m_st~0)| 2)) (.cse20 (= ~T2_E~0 0)) (.cse21 (= 0 ~M_E~0)) (.cse22 (= 1 ~M_E~0)) (.cse39 (= 1 |old(~E_M~0)|)) (.cse59 (not .cse28)) (.cse60 (< |old(~t1_st~0)| 2)) (.cse40 (= ~T1_E~0 1)) (.cse41 (not .cse53)) (.cse61 (not .cse46)) (.cse29 (not (= 1 ~t1_i~0))) (.cse42 (< |old(~E_2~0)| 2)) (.cse43 (not (= 1 ~t2_i~0))) (.cse44 (= 0 |old(~E_M~0)|))) (and (let ((.cse1 (= 1 ~t1_pc~0)) (.cse35 (not (= 0 eval_~tmp~0))) (.cse50 (not (= ~E_2~0 1))) (.cse52 (not (= ~t2_pc~0 1))) (.cse47 (not .cse40)) (.cse24 (and (not .cse0) (not .cse20) (not (= ~M_E~0 0)) .cse53 (not (= ~E_M~0 0)))) (.cse25 (= ~m_st~0 0)) (.cse48 (not .cse9)) (.cse49 (= ~t1_i~0 1)) (.cse26 (not (= ~m_pc~0 1))) (.cse45 (= 0 ~t2_st~0)) (.cse51 (not (= ~M_E~0 1))) (.cse17 (<= 2 ~E_1~0)) (.cse27 (not (= ~E_M~0 1)))) (let ((.cse4 (and .cse52 .cse47 .cse23 .cse24 .cse25 .cse48 .cse49 .cse26 .cse45 .cse51 .cse17 .cse18 .cse27)) (.cse15 (= 0 ~t1_st~0)) (.cse19 (and .cse52 .cse47 .cse24 .cse48 .cse14 .cse49 .cse45 .cse50 .cse51 .cse16 .cse17 .cse18 .cse27)) (.cse6 (= eval_~tmp~0 1)) (.cse31 (and .cse12 (and .cse1 (and .cse47 .cse13 .cse24 .cse48 .cse14 .cse49 .cse50 .cse51 .cse16 .cse17 .cse27) .cse35))) (.cse30 (<= 2 ~E_2~0)) (.cse5 (<= 2 ~t1_st~0))) (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 (and .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse3 .cse6 .cse7 .cse8) (and .cse11 .cse3 .cse19 .cse15 .cse6 .cse7 .cse8) .cse20 .cse21 .cse22 (not (= |old(~t1_st~0)| 0)) (and .cse1 .cse3 .cse19 .cse15 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse5 (and .cse12 .cse1 (and .cse13 .cse23 .cse24 .cse25 .cse26 .cse27) .cse6) .cse7 .cse8) .cse28 .cse29 (and .cse30 .cse31 .cse5 .cse32 .cse33) .cse34 (and .cse12 (and .cse1 (and .cse13 .cse24 .cse25 .cse16 .cse17 .cse27) .cse35) .cse30 .cse5 .cse32 .cse33) (and .cse1 .cse36 .cse30 .cse37 .cse5 .cse19 .cse6) .cse38 (and .cse36 .cse30 .cse37 .cse31 .cse5) .cse39 .cse40 (not (= 0 |old(~m_st~0)|)) (and .cse31 .cse30 .cse3 .cse15 .cse8) (and .cse11 .cse4 .cse2 .cse3 .cse15 .cse7 .cse8) (and .cse11 .cse12 .cse2 (and .cse13 .cse23 .cse25 .cse26 .cse18) .cse3 .cse15 .cse6 .cse7 .cse8) .cse41 (not (= 0 |old(~t2_st~0)|)) (and .cse1 .cse3 .cse5 .cse19 .cse6 .cse7 .cse8) (and .cse30 .cse31 .cse3 .cse5 .cse8) .cse42 .cse43 .cse44 (and .cse36 .cse30 .cse37 .cse5 (and .cse1 (and (and .cse13 .cse24 .cse14 .cse45 .cse16 .cse27) .cse17) .cse35)) (< 0 |old(~t1_pc~0)|) .cse46))) (let ((.cse56 (+ |old(~local~0)| 2))) (or .cse34 .cse0 .cse54 (and .cse23 .cse14 .cse7 .cse18 .cse33 .cse13 .cse2 .cse55 .cse11 .cse12 .cse16 .cse32) .cse9 (< .cse56 |old(~token~0)|) .cse57 .cse58 .cse20 .cse21 .cse22 .cse39 .cse59 .cse60 .cse40 .cse41 .cse61 .cse29 .cse42 .cse43 .cse44 (< |old(~token~0)| .cse56))) (let ((.cse62 (+ |old(~local~0)| 1))) (or .cse34 .cse0 .cse54 .cse9 (and .cse36 .cse23 .cse14 .cse7 .cse18 .cse13 .cse2 .cse55 .cse11 .cse12 .cse37 .cse16) .cse57 .cse58 .cse20 .cse21 .cse22 .cse39 .cse59 .cse60 .cse40 (< |old(~token~0)| .cse62) .cse41 .cse61 .cse29 .cse42 .cse43 (< .cse62 |old(~token~0)|) .cse44)) (or .cse34 .cse0 .cse54 .cse9 .cse10 .cse57 .cse38 (and .cse23 .cse14 .cse3 .cse7 .cse18 .cse13 .cse2 .cse55 .cse11 .cse12 .cse16 .cse8) .cse58 .cse20 .cse21 .cse22 .cse39 .cse59 .cse60 .cse40 .cse41 .cse61 .cse29 .cse42 .cse43 .cse44)))) [2018-11-10 13:05:22,219 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-11-10 13:05:22,221 INFO L425 ceAbstractionStarter]: For program point L276-1(lines 271 323) no Hoare annotation was computed. [2018-11-10 13:05:22,222 INFO L421 ceAbstractionStarter]: At program point L272(line 272) the Hoare annotation is: (let ((.cse46 (= 1 |old(~m_pc~0)|)) (.cse53 (= ~m_i~0 1)) (.cse28 (= 1 |old(~t2_pc~0)|)) (.cse63 (+ ~local~0 1)) (.cse64 (+ ~local~0 2))) (let ((.cse33 (<= ~token~0 .cse64)) (.cse32 (<= .cse64 ~token~0)) (.cse36 (<= ~token~0 .cse63)) (.cse37 (<= .cse63 ~token~0)) (.cse34 (< |old(~E_1~0)| 2)) (.cse0 (= ~T1_E~0 0)) (.cse54 (< |old(~t2_st~0)| 2)) (.cse9 (= ~T2_E~0 1)) (.cse10 (< |old(~local~0)| |old(~token~0)|)) (.cse57 (not (= |old(~t1_pc~0)| 1))) (.cse38 (< |old(~token~0)| |old(~local~0)|)) (.cse23 (= |old(~E_1~0)| ~E_1~0)) (.cse14 (<= 2 ~m_st~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse7 (= ~E_2~0 |old(~E_2~0)|)) (.cse18 (= |old(~E_M~0)| ~E_M~0)) (.cse13 (= 1 ~t2_pc~0)) (.cse2 (= ~token~0 |old(~token~0)|)) (.cse55 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse11 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse12 (<= 2 ~t2_st~0)) (.cse16 (= 1 ~m_pc~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse58 (< |old(~m_st~0)| 2)) (.cse20 (= ~T2_E~0 0)) (.cse21 (= 0 ~M_E~0)) (.cse22 (= 1 ~M_E~0)) (.cse39 (= 1 |old(~E_M~0)|)) (.cse59 (not .cse28)) (.cse60 (< |old(~t1_st~0)| 2)) (.cse40 (= ~T1_E~0 1)) (.cse41 (not .cse53)) (.cse61 (not .cse46)) (.cse29 (not (= 1 ~t1_i~0))) (.cse42 (< |old(~E_2~0)| 2)) (.cse43 (not (= 1 ~t2_i~0))) (.cse44 (= 0 |old(~E_M~0)|))) (and (let ((.cse1 (= 1 ~t1_pc~0)) (.cse35 (not (= 0 eval_~tmp~0))) (.cse50 (not (= ~E_2~0 1))) (.cse52 (not (= ~t2_pc~0 1))) (.cse47 (not .cse40)) (.cse24 (and (not .cse0) (not .cse20) (not (= ~M_E~0 0)) .cse53 (not (= ~E_M~0 0)))) (.cse25 (= ~m_st~0 0)) (.cse48 (not .cse9)) (.cse49 (= ~t1_i~0 1)) (.cse26 (not (= ~m_pc~0 1))) (.cse45 (= 0 ~t2_st~0)) (.cse51 (not (= ~M_E~0 1))) (.cse17 (<= 2 ~E_1~0)) (.cse27 (not (= ~E_M~0 1)))) (let ((.cse4 (and .cse52 .cse47 .cse23 .cse24 .cse25 .cse48 .cse49 .cse26 .cse45 .cse51 .cse17 .cse18 .cse27)) (.cse15 (= 0 ~t1_st~0)) (.cse19 (and .cse52 .cse47 .cse24 .cse48 .cse14 .cse49 .cse45 .cse50 .cse51 .cse16 .cse17 .cse18 .cse27)) (.cse6 (= eval_~tmp~0 1)) (.cse31 (and .cse12 (and .cse1 (and .cse47 .cse13 .cse24 .cse48 .cse14 .cse49 .cse50 .cse51 .cse16 .cse17 .cse27) .cse35))) (.cse30 (<= 2 ~E_2~0)) (.cse5 (<= 2 ~t1_st~0))) (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 (and .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse3 .cse6 .cse7 .cse8) (and .cse11 .cse3 .cse19 .cse15 .cse6 .cse7 .cse8) .cse20 .cse21 .cse22 (not (= |old(~t1_st~0)| 0)) (and .cse1 .cse3 .cse19 .cse15 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse5 (and .cse12 .cse1 (and .cse13 .cse23 .cse24 .cse25 .cse26 .cse27) .cse6) .cse7 .cse8) .cse28 .cse29 (and .cse30 .cse31 .cse5 .cse32 .cse33) .cse34 (and .cse12 (and .cse1 (and .cse13 .cse24 .cse25 .cse16 .cse17 .cse27) .cse35) .cse30 .cse5 .cse32 .cse33) (and .cse1 .cse36 .cse30 .cse37 .cse5 .cse19 .cse6) .cse38 (and .cse36 .cse30 .cse37 .cse31 .cse5) .cse39 .cse40 (not (= 0 |old(~m_st~0)|)) (and .cse31 .cse30 .cse3 .cse15 .cse8) (and .cse11 .cse4 .cse2 .cse3 .cse15 .cse7 .cse8) (and .cse11 .cse12 .cse2 (and .cse13 .cse23 .cse25 .cse26 .cse18) .cse3 .cse15 .cse6 .cse7 .cse8) .cse41 (not (= 0 |old(~t2_st~0)|)) (and .cse1 .cse3 .cse5 .cse19 .cse6 .cse7 .cse8) (and .cse30 .cse31 .cse3 .cse5 .cse8) .cse42 .cse43 .cse44 (and .cse36 .cse30 .cse37 .cse5 (and .cse1 (and (and .cse13 .cse24 .cse14 .cse45 .cse16 .cse27) .cse17) .cse35)) (< 0 |old(~t1_pc~0)|) .cse46))) (let ((.cse56 (+ |old(~local~0)| 2))) (or .cse34 .cse0 .cse54 (and .cse23 .cse14 .cse7 .cse18 .cse33 .cse13 .cse2 .cse55 .cse11 .cse12 .cse16 .cse32) .cse9 (< .cse56 |old(~token~0)|) .cse57 .cse58 .cse20 .cse21 .cse22 .cse39 .cse59 .cse60 .cse40 .cse41 .cse61 .cse29 .cse42 .cse43 .cse44 (< |old(~token~0)| .cse56))) (let ((.cse62 (+ |old(~local~0)| 1))) (or .cse34 .cse0 .cse54 .cse9 (and .cse36 .cse23 .cse14 .cse7 .cse18 .cse13 .cse2 .cse55 .cse11 .cse12 .cse37 .cse16) .cse57 .cse58 .cse20 .cse21 .cse22 .cse39 .cse59 .cse60 .cse40 (< |old(~token~0)| .cse62) .cse41 .cse61 .cse29 .cse42 .cse43 (< .cse62 |old(~token~0)|) .cse44)) (or .cse34 .cse0 .cse54 .cse9 .cse10 .cse57 .cse38 (and .cse23 .cse14 .cse3 .cse7 .cse18 .cse13 .cse2 .cse55 .cse11 .cse12 .cse16 .cse8) .cse58 .cse20 .cse21 .cse22 .cse39 .cse59 .cse60 .cse40 .cse41 .cse61 .cse29 .cse42 .cse43 .cse44)))) [2018-11-10 13:05:22,223 INFO L421 ceAbstractionStarter]: At program point L301(line 301) the Hoare annotation is: (let ((.cse45 (= 1 |old(~m_pc~0)|)) (.cse44 (= 1 |old(~t2_pc~0)|))) (let ((.cse4 (< |old(~local~0)| |old(~token~0)|)) (.cse6 (< |old(~token~0)| |old(~local~0)|)) (.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse3 (= ~T2_E~0 1)) (.cse5 (not (= |old(~t1_pc~0)| 1))) (.cse7 (< |old(~m_st~0)| 2)) (.cse8 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse11 (= 1 |old(~E_M~0)|)) (.cse12 (not .cse44)) (.cse13 (< |old(~t1_st~0)| 2)) (.cse14 (= ~T1_E~0 1)) (.cse15 (not (= ~m_i~0 1))) (.cse16 (not .cse45)) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (< |old(~E_2~0)| 2)) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 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) (let ((.cse21 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 .cse3 (< .cse21 |old(~token~0)|) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (< |old(~token~0)| .cse21))) (let ((.cse37 (not (= ~t2_pc~0 1))) (.cse31 (and (not .cse1) (not .cse8) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)))) (.cse32 (<= 2 ~m_st~0)) (.cse41 (= 0 ~t2_st~0)) (.cse33 (= 1 ~m_pc~0)) (.cse34 (<= 2 ~E_1~0)) (.cse42 (= |old(~E_M~0)| ~E_M~0))) (let ((.cse22 (= 1 ~t1_pc~0)) (.cse24 (and .cse37 .cse31 (not .cse3) .cse32 (= ~t1_i~0 1) .cse41 (not (= ~M_E~0 1)) .cse33 .cse34 .cse42)) (.cse35 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse29 (<= 2 ~t2_st~0)) (.cse36 (= ~token~0 |old(~token~0)|)) (.cse30 (= 1 ~t2_pc~0)) (.cse38 (= |old(~E_1~0)| ~E_1~0)) (.cse39 (= ~m_st~0 0)) (.cse40 (not (= ~m_pc~0 1))) (.cse23 (<= ~token~0 ~local~0)) (.cse25 (= eval_~tmp~0 1)) (.cse26 (= ~E_2~0 |old(~E_2~0)|)) (.cse43 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse27 (<= ~local~0 ~token~0)) (.cse28 (not (= ~t1_st~0 0)))) (or .cse1 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse3 .cse4 .cse8 .cse9 .cse10 (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~E_2~0) (and .cse29 (and .cse22 (and .cse30 .cse31 .cse32 .cse33 .cse34 (not (= ~E_M~0 1))) (not (= 0 eval_~tmp~0)))) .cse23 .cse27 .cse28) (and .cse35 .cse36 .cse23 (and .cse37 .cse38 .cse39 .cse40 .cse41 .cse42) .cse25 .cse26 .cse43 .cse27 .cse28) .cse44 (and .cse35 .cse29 .cse23 .cse25 .cse26 .cse43 .cse27 (and .cse30 .cse32 .cse33 .cse34 .cse42) .cse28) .cse17 .cse0 (and .cse35 .cse23 .cse24 .cse25 .cse26 .cse43 .cse27 .cse28) .cse6 .cse11 .cse14 (not (= 0 |old(~m_st~0)|)) .cse15 (not (= 0 |old(~t2_st~0)|)) (and .cse35 .cse29 .cse36 (and .cse30 .cse38 .cse39 .cse40 .cse42) .cse23 .cse25 .cse26 .cse43 .cse27 .cse28) .cse18 .cse19 .cse20 (< 0 |old(~t1_pc~0)|) .cse45))) (let ((.cse46 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< |old(~token~0)| .cse46) .cse15 .cse16 .cse17 .cse18 .cse19 (< .cse46 |old(~token~0)|) .cse20))))) [2018-11-10 13:05:22,225 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 265 329) the Hoare annotation is: (let ((.cse36 (= 1 |old(~m_pc~0)|)) (.cse35 (= 1 |old(~t2_pc~0)|))) (let ((.cse33 (<= ~token~0 ~local~0)) (.cse34 (<= ~local~0 ~token~0)) (.cse31 (< |old(~local~0)| |old(~token~0)|)) (.cse32 (< |old(~token~0)| |old(~local~0)|)) (.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse3 (= ~T2_E~0 1)) (.cse16 (not (= |old(~t1_pc~0)| 1))) (.cse17 (< |old(~m_st~0)| 2)) (.cse18 (= ~T2_E~0 0)) (.cse19 (= 0 ~M_E~0)) (.cse20 (= 1 ~M_E~0)) (.cse21 (= 1 |old(~E_M~0)|)) (.cse22 (not .cse35)) (.cse23 (< |old(~t1_st~0)| 2)) (.cse24 (= ~T1_E~0 1)) (.cse25 (not (= ~m_i~0 1))) (.cse26 (not .cse36)) (.cse4 (= |old(~E_1~0)| ~E_1~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= |old(~E_M~0)| ~E_M~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse9 (= ~token~0 |old(~token~0)|)) (.cse10 (= |old(~E_2~0)| ~E_2~0)) (.cse11 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse12 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse13 (<= 2 ~t2_st~0)) (.cse14 (= 1 ~m_pc~0)) (.cse27 (not (= 1 ~t1_i~0))) (.cse28 (< |old(~E_2~0)| 2)) (.cse29 (not (= 1 ~t2_i~0))) (.cse30 (= 0 |old(~E_M~0)|))) (and (let ((.cse15 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 .cse3 (let ((.cse7 (+ ~local~0 2))) (and .cse4 .cse5 .cse6 (<= ~token~0 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= .cse7 ~token~0))) (< .cse15 |old(~token~0)|) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (< |old(~token~0)| .cse15))) (or .cse0 .cse1 .cse2 .cse3 .cse31 .cse16 .cse32 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (and .cse4 .cse5 .cse33 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse34)) (or .cse0 (and (not (= ~t2_pc~0 1)) .cse4 (= ~m_st~0 0) (not (= ~m_pc~0 1)) .cse33 .cse6 .cse9 .cse10 (= 0 ~t1_st~0) (= 0 ~t2_st~0) .cse12 .cse34) .cse1 .cse3 .cse31 .cse32 .cse18 .cse19 .cse20 (not (= |old(~t1_st~0)| 0)) .cse21 .cse24 (not (= 0 |old(~m_st~0)|)) .cse25 .cse35 (not (= 0 |old(~t2_st~0)|)) .cse27 .cse28 .cse29 .cse30 (< 0 |old(~t1_pc~0)|) .cse36) (let ((.cse37 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (< |old(~token~0)| .cse37) .cse25 .cse26 (let ((.cse38 (+ ~local~0 1))) (and (<= ~token~0 .cse38) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= .cse38 ~token~0) .cse14)) .cse27 .cse28 .cse29 (< .cse37 |old(~token~0)|) .cse30))))) [2018-11-10 13:05:22,228 INFO L425 ceAbstractionStarter]: For program point L281(lines 271 323) no Hoare annotation was computed. [2018-11-10 13:05:22,228 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 305) no Hoare annotation was computed. [2018-11-10 13:05:22,228 INFO L421 ceAbstractionStarter]: At program point L315(line 315) the Hoare annotation is: (let ((.cse34 (= 1 |old(~m_pc~0)|)) (.cse41 (= ~m_i~0 1)) (.cse19 (= 1 |old(~t2_pc~0)|))) (let ((.cse13 (< |old(~local~0)| |old(~token~0)|)) (.cse23 (< |old(~token~0)| |old(~local~0)|)) (.cse22 (< |old(~E_1~0)| 2)) (.cse7 (= ~T1_E~0 0)) (.cse42 (< |old(~t2_st~0)| 2)) (.cse12 (= ~T2_E~0 1)) (.cse43 (not (= |old(~t1_pc~0)| 1))) (.cse44 (< |old(~m_st~0)| 2)) (.cse16 (= ~T2_E~0 0)) (.cse17 (= 0 ~M_E~0)) (.cse18 (= 1 ~M_E~0)) (.cse24 (= 1 |old(~E_M~0)|)) (.cse45 (not .cse19)) (.cse46 (< |old(~t1_st~0)| 2)) (.cse25 (= ~T1_E~0 1)) (.cse26 (not .cse41)) (.cse47 (not .cse34)) (.cse20 (not (= 1 ~t1_i~0))) (.cse31 (< |old(~E_2~0)| 2)) (.cse32 (not (= 1 ~t2_i~0))) (.cse33 (= 0 |old(~E_M~0)|))) (and (let ((.cse35 (+ ~local~0 1)) (.cse29 (<= 2 ~m_st~0)) (.cse30 (= 1 ~m_pc~0)) (.cse27 (<= 2 ~E_1~0)) (.cse36 (not (= ~t2_pc~0 1))) (.cse28 (and (not .cse7) (not .cse16) (not (= ~M_E~0 0)) .cse41 (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse37 (not .cse12)) (.cse38 (= ~t1_i~0 1)) (.cse39 (not (= ~M_E~0 1))) (.cse40 (= |old(~E_M~0)| ~E_M~0))) (let ((.cse14 (= ~token~0 |old(~token~0)|)) (.cse15 (and .cse36 (= |old(~E_1~0)| ~E_1~0) .cse28 (= ~m_st~0 0) .cse37 .cse38 (not (= ~m_pc~0 1)) .cse39 .cse40)) (.cse21 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse0 (and .cse36 .cse28 .cse37 .cse29 .cse38 .cse39 .cse30 .cse27 .cse40)) (.cse2 (<= ~token~0 ~local~0)) (.cse3 (= 0 ~t1_st~0)) (.cse4 (= eval_~tmp~0 1)) (.cse5 (= ~E_2~0 |old(~E_2~0)|)) (.cse6 (<= ~local~0 ~token~0)) (.cse8 (<= ~token~0 .cse35)) (.cse9 (<= 2 ~E_2~0)) (.cse10 (<= .cse35 ~token~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse1 (= 1 ~t1_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse11 .cse4) .cse12 .cse13 (and .cse1 .cse14 .cse2 .cse11 .cse15 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5 .cse6) .cse16 .cse17 .cse18 (not (= |old(~t1_st~0)| 0)) .cse19 .cse20 (and .cse21 .cse14 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6) (and .cse21 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6) .cse22 .cse23 .cse24 .cse25 (not (= 0 |old(~m_st~0)|)) .cse26 (not (= 0 |old(~t2_st~0)|)) (and .cse8 .cse9 .cse10 .cse11 (and .cse1 (not (= 0 eval_~tmp~0)) (and .cse27 (and (= 1 ~t2_pc~0) .cse28 .cse29 .cse30 (not (= ~E_M~0 1)))))) .cse31 .cse32 .cse33 (< 0 |old(~t1_pc~0)|) .cse34))) (or .cse22 .cse7 .cse42 .cse12 .cse13 .cse43 .cse23 .cse44 .cse16 .cse17 .cse18 .cse24 .cse45 .cse46 .cse25 .cse26 .cse47 .cse20 .cse31 .cse32 .cse33) (let ((.cse48 (+ |old(~local~0)| 2))) (or .cse22 .cse7 .cse42 .cse12 (< .cse48 |old(~token~0)|) .cse43 .cse44 .cse16 .cse17 .cse18 .cse24 .cse45 .cse46 .cse25 .cse26 .cse47 .cse20 .cse31 .cse32 .cse33 (< |old(~token~0)| .cse48))) (let ((.cse49 (+ |old(~local~0)| 1))) (or .cse22 .cse7 .cse42 .cse12 .cse43 .cse44 .cse16 .cse17 .cse18 .cse24 .cse45 .cse46 .cse25 (< |old(~token~0)| .cse49) .cse26 .cse47 .cse20 .cse31 .cse32 (< .cse49 |old(~token~0)|) .cse33))))) [2018-11-10 13:05:22,230 INFO L425 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-11-10 13:05:22,230 INFO L425 ceAbstractionStarter]: For program point L295(lines 271 323) no Hoare annotation was computed. [2018-11-10 13:05:22,230 INFO L421 ceAbstractionStarter]: At program point L324(lines 265 329) the Hoare annotation is: (let ((.cse42 (= 1 |old(~m_pc~0)|)) (.cse38 (= 1 |old(~t2_pc~0)|)) (.cse44 (+ ~local~0 1)) (.cse45 (+ ~local~0 2))) (let ((.cse14 (<= .cse45 ~token~0)) (.cse7 (<= ~token~0 .cse45)) (.cse35 (< |old(~local~0)| |old(~token~0)|)) (.cse41 (< |old(~token~0)| |old(~local~0)|)) (.cse39 (<= ~token~0 ~local~0)) (.cse40 (<= ~local~0 ~token~0)) (.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse15 (= ~T2_E~0 1)) (.cse17 (not (= |old(~t1_pc~0)| 1))) (.cse18 (< |old(~m_st~0)| 2)) (.cse19 (= ~T2_E~0 0)) (.cse20 (= 0 ~M_E~0)) (.cse3 (= |old(~E_1~0)| ~E_1~0)) (.cse36 (<= ~token~0 .cse44)) (.cse4 (<= 2 ~m_st~0)) (.cse5 (= ~E_2~0 |old(~E_2~0)|)) (.cse6 (= |old(~E_M~0)| ~E_M~0)) (.cse8 (= 1 ~t2_pc~0)) (.cse9 (= ~token~0 |old(~token~0)|)) (.cse10 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse11 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse12 (<= 2 ~t2_st~0)) (.cse37 (<= .cse44 ~token~0)) (.cse13 (= 1 ~m_pc~0)) (.cse21 (= 1 ~M_E~0)) (.cse22 (= 1 |old(~E_M~0)|)) (.cse23 (not .cse38)) (.cse24 (< |old(~t1_st~0)| 2)) (.cse25 (= ~T1_E~0 1)) (.cse26 (not (= ~m_i~0 1))) (.cse27 (not .cse42)) (.cse28 (not (= 1 ~t1_i~0))) (.cse29 (< |old(~E_2~0)| 2)) (.cse30 (not (= 1 ~t2_i~0))) (.cse31 (= 0 |old(~E_M~0)|))) (and (let ((.cse16 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 (< .cse16 |old(~token~0)|) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (< |old(~token~0)| .cse16))) (let ((.cse32 (and .cse12 (= 1 ~t1_pc~0) (and .cse8 (and (not .cse1) (not .cse19) (not (= ~M_E~0 0)) (not (= ~E_M~0 0))) (not .cse15) .cse4 (not (= ~M_E~0 1)) .cse13 (<= 2 ~E_1~0) (not (= ~E_M~0 1))))) (.cse33 (<= 2 ~E_2~0)) (.cse34 (<= 2 ~t1_st~0))) (or .cse1 .cse15 (and .cse32 .cse33 .cse34 .cse14 .cse7) .cse35 (and .cse32 .cse36 .cse33 .cse37 .cse34) .cse19 .cse20 .cse21 (not (= |old(~t1_st~0)| 0)) .cse38 (and .cse32 .cse33 .cse39 .cse34 .cse40) .cse28 .cse0 .cse41 .cse22 .cse25 (not (= 0 |old(~m_st~0)|)) .cse26 (not (= 0 |old(~t2_st~0)|)) .cse29 .cse30 .cse31 (< 0 |old(~t1_pc~0)|) .cse42)) (or .cse0 .cse1 .cse2 .cse15 .cse35 .cse17 .cse41 (and .cse3 .cse4 .cse39 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse40) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) (let ((.cse43 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse15 .cse17 .cse18 .cse19 .cse20 (and .cse3 .cse36 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse37 .cse13) .cse21 .cse22 .cse23 .cse24 .cse25 (< |old(~token~0)| .cse43) .cse26 .cse27 .cse28 .cse29 .cse30 (< .cse43 |old(~token~0)|) .cse31))))) [2018-11-10 13:05:22,232 INFO L425 ceAbstractionStarter]: For program point L194-2(lines 194 203) no Hoare annotation was computed. [2018-11-10 13:05:22,232 INFO L425 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 190 208) no Hoare annotation was computed. [2018-11-10 13:05:22,233 INFO L421 ceAbstractionStarter]: At program point L205(lines 193 207) the Hoare annotation is: (let ((.cse36 (+ ~local~0 1)) (.cse35 (= ~t1_st~0 0)) (.cse37 (+ ~local~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse2 (= ~T2_E~0 1)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse10 (= 1 ~E_M~0)) (.cse13 (= ~T1_E~0 1)) (.cse15 (not (= ~m_i~0 1))) (.cse27 (= 1 ~t2_pc~0)) (.cse28 (not (= 0 ~t2_st~0))) (.cse30 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse18 (not (= 1 ~t2_i~0))) (.cse19 (= 0 ~E_M~0)) (.cse29 (= 1 ~m_pc~0))) (let ((.cse14 (not (= 1 ~E_1~0))) (.cse24 (or .cse0 .cse2 .cse6 .cse7 .cse8 .cse10 .cse13 .cse15 .cse27 .cse28 .cse30 .cse16 .cse18 .cse19 .cse29)) (.cse25 (< .cse37 ~token~0)) (.cse26 (< ~token~0 .cse37)) (.cse3 (< ~local~0 ~token~0)) (.cse5 (< ~token~0 ~local~0)) (.cse31 (< 0 ~t1_pc~0)) (.cse9 (not .cse35)) (.cse22 (< ~t1_st~0 2)) (.cse17 (< ~E_2~0 2)) (.cse21 (< ~m_st~0 2)) (.cse32 (< ~token~0 .cse36)) (.cse34 (= 0 ~E_2~0)) (.cse20 (< ~E_1~0 2)) (.cse1 (< ~t2_st~0 2)) (.cse4 (not (= ~t1_pc~0 1))) (.cse11 (not .cse27)) (.cse12 (= 0 is_transmit2_triggered_~__retres1~2)) (.cse23 (not .cse29)) (.cse33 (< .cse36 ~token~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse10 .cse11 .cse22 .cse13 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19) (or .cse22 .cse24 .cse12 .cse3 .cse4 .cse5 .cse17) (or .cse20 (not .cse10) .cse0 .cse2 .cse25 .cse4 .cse6 .cse7 .cse8 .cse11 .cse22 .cse13 (not (= 0 ~m_st~0)) .cse15 .cse12 .cse23 .cse16 .cse17 .cse18 .cse26) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10 .cse13 .cse14 .cse15 .cse27 .cse28 .cse16 .cse17 .cse18 .cse19 .cse29) (or .cse20 .cse0 .cse1 .cse2 .cse12 .cse25 .cse4 .cse21 .cse6 .cse7 .cse10 .cse11 .cse22 .cse13 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse26) (or .cse22 .cse1 .cse3 .cse4 .cse5 .cse17 .cse12 (or .cse0 .cse2 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse15 .cse30 .cse16 .cse18 .cse19)) (or .cse3 .cse5 .cse17 .cse12 .cse31 .cse24 .cse9) (or .cse22 .cse25 .cse17 (or .cse20 .cse0 .cse2 .cse4 .cse21 .cse6 .cse7 .cse8 .cse11 .cse13 .cse15 .cse23 .cse16 .cse18 .cse19) .cse26 .cse12) (or .cse20 .cse0 .cse12 .cse2 .cse4 .cse21 .cse6 .cse7 .cse8 .cse10 .cse13 .cse32 .cse15 .cse27 .cse28 .cse23 .cse16 .cse18 .cse33 .cse19 .cse34 .cse35) (or .cse12 .cse1 (or .cse0 .cse2 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse15 .cse30 .cse16 .cse18 .cse19 .cse29) .cse3 .cse5 .cse17 .cse31 .cse9) (or .cse20 .cse0 .cse1 .cse2 .cse4 .cse12 .cse21 .cse6 .cse7 .cse10 .cse11 .cse22 .cse13 .cse32 .cse15 .cse23 .cse16 .cse17 .cse18 .cse33 .cse19) (or .cse0 .cse2 (= 1 ~E_2~0) .cse21 .cse6 .cse7 .cse8 .cse32 .cse16 .cse34 .cse35 .cse20 .cse1 .cse4 .cse10 .cse11 .cse13 .cse12 .cse15 .cse23 .cse18 .cse33 .cse19)))) [2018-11-10 13:05:22,237 INFO L428 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 190 208) the Hoare annotation is: true [2018-11-10 13:05:22,237 INFO L425 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 190 208) no Hoare annotation was computed. [2018-11-10 13:05:22,237 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 200) no Hoare annotation was computed. [2018-11-10 13:05:22,237 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 203) no Hoare annotation was computed. [2018-11-10 13:05:22,237 INFO L421 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 330 367) the Hoare annotation is: (let ((.cse25 (= 1 ~m_pc~0)) (.cse24 (= 1 ~t2_pc~0))) (let ((.cse2 (< ~t2_st~0 2)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (< ~m_st~0 2)) (.cse10 (not .cse24)) (.cse11 (< ~t1_st~0 2)) (.cse15 (not .cse25)) (.cse0 (< |old(~E_1~0)| 2)) (.cse16 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0))) (.cse1 (= |old(~T1_E~0)| 0)) (.cse3 (= |old(~T2_E~0)| 1)) (.cse22 (< ~local~0 ~token~0)) (.cse23 (< ~token~0 ~local~0)) (.cse6 (= |old(~T2_E~0)| 0)) (.cse7 (= 0 |old(~M_E~0)|)) (.cse8 (= 1 |old(~M_E~0)|)) (.cse9 (= 1 |old(~E_M~0)|)) (.cse12 (= |old(~T1_E~0)| 1)) (.cse14 (not (= ~m_i~0 1))) (.cse17 (not (= 1 ~t1_i~0))) (.cse18 (< |old(~E_2~0)| 2)) (.cse19 (not (= 1 ~t2_i~0))) (.cse20 (= 0 |old(~E_M~0)|))) (and (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 .cse13) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< .cse13 ~token~0) .cse20)) (let ((.cse21 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 .cse16 (< .cse21 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 (< ~token~0 .cse21))) (or .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse16) (or .cse0 .cse16 .cse1 .cse3 .cse22 .cse23 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9 .cse12 (not (= 0 ~m_st~0)) .cse14 .cse24 (not (= 0 ~t2_st~0)) .cse17 .cse18 .cse19 .cse20 (< 0 ~t1_pc~0) .cse25)))) [2018-11-10 13:05:22,240 INFO L425 ceAbstractionStarter]: For program point L349-1(lines 333 366) no Hoare annotation was computed. [2018-11-10 13:05:22,240 INFO L425 ceAbstractionStarter]: For program point L339-1(lines 333 366) no Hoare annotation was computed. [2018-11-10 13:05:22,240 INFO L425 ceAbstractionStarter]: For program point L354-1(lines 333 366) no Hoare annotation was computed. [2018-11-10 13:05:22,240 INFO L425 ceAbstractionStarter]: For program point L344-1(lines 333 366) no Hoare annotation was computed. [2018-11-10 13:05:22,240 INFO L425 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 330 367) no Hoare annotation was computed. [2018-11-10 13:05:22,240 INFO L425 ceAbstractionStarter]: For program point L334-1(lines 333 366) no Hoare annotation was computed. [2018-11-10 13:05:22,240 INFO L425 ceAbstractionStarter]: For program point L359-1(lines 330 367) no Hoare annotation was computed. [2018-11-10 13:05:22,240 INFO L425 ceAbstractionStarter]: For program point update_channelsEXIT(lines 209 216) no Hoare annotation was computed. [2018-11-10 13:05:22,241 INFO L428 ceAbstractionStarter]: At program point update_channelsFINAL(lines 209 216) the Hoare annotation is: true [2018-11-10 13:05:22,241 INFO L425 ceAbstractionStarter]: For program point L543(lines 543 580) no Hoare annotation was computed. [2018-11-10 13:05:22,241 INFO L421 ceAbstractionStarter]: At program point L543-2(lines 540 580) the Hoare annotation is: (let ((.cse10 (= ~m_i~0 1))) (let ((.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse5 (= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (not (= ~M_E~0 1))) (.cse7 (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) .cse10)))) (let ((.cse0 (and (<= 2 ~t2_st~0) (= 1 ~t1_pc~0) (and (and .cse4 (not (= ~T1_E~0 1)) .cse5 (not (= ~T2_E~0 1)) (and (= 1 ~t2_pc~0) .cse6 (= 1 ~m_pc~0) (<= 2 ~m_st~0) .cse7 (= ~t1_i~0 1)) (not (= ~E_M~0 1))) (<= 2 ~E_1~0)) (<= 2 ~t1_st~0))) (.cse1 (<= 2 ~E_2~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0))) (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)|) (= |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)|) (not (= 1 ~t1_i~0)) (< |old(~E_1~0)| 2) (let ((.cse3 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse3) .cse1 (<= .cse3 ~token~0))) (< |old(~token~0)| |old(~local~0)|) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and (= ~t1_pc~0 |old(~t1_pc~0)|) (and .cse4 (= |old(~E_1~0)| ~E_1~0) .cse5 (and (not (= ~t2_pc~0 1)) (= ~m_st~0 0) .cse6 .cse7 (not (= ~m_pc~0 1)) (= 0 ~t2_st~0)) (= |old(~E_M~0)| ~E_M~0)) (= ~token~0 |old(~token~0)|) .cse8 (= 0 ~t1_st~0) (= ~E_2~0 |old(~E_2~0)|) .cse9) (not .cse10) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_2~0)| 2) (and .cse0 .cse1 .cse8 .cse9) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|))))) [2018-11-10 13:05:22,242 INFO L421 ceAbstractionStarter]: At program point L539(line 539) the Hoare annotation is: (or (< |old(~E_1~0)| 2) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~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) (= ~t1_pc~0 |old(~t1_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (not (= 0 |old(~t2_st~0)|)) (not (= 1 ~t1_i~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-10 13:05:22,242 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 528 586) no Hoare annotation was computed. [2018-11-10 13:05:22,242 INFO L421 ceAbstractionStarter]: At program point L537(line 537) the Hoare annotation is: (or (< |old(~E_1~0)| 2) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~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) (= ~t1_pc~0 |old(~t1_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (not (= 0 |old(~t2_st~0)|)) (not (= 1 ~t1_i~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-10 13:05:22,242 INFO L421 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_2~0)) (.cse2 (and (<= 2 ~t2_st~0) (= 1 ~t1_pc~0) (<= 2 ~t1_st~0) (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= 1 ~t2_pc~0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~T2_E~0 1)) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_M~0 1))) (<= 2 ~E_1~0))))) (or (= |old(~T1_E~0)| 0) (let ((.cse1 (+ ~local~0 2))) (and .cse0 (<= .cse1 ~token~0) .cse2 (<= ~token~0 .cse1))) (and .cse0 (<= ~token~0 ~local~0) .cse2 (<= ~local~0 ~token~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 ((.cse3 (+ ~local~0 1))) (and (<= ~token~0 .cse3) .cse0 (<= .cse3 ~token~0) .cse2)) (= 1 |old(~t2_pc~0)|) (not (= 1 ~t1_i~0)) (< |old(~E_1~0)| 2) (< |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)|)) (< |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-10 13:05:22,243 INFO L425 ceAbstractionStarter]: For program point L562(lines 562 571) no Hoare annotation was computed. [2018-11-10 13:05:22,244 INFO L421 ceAbstractionStarter]: At program point L562-1(lines 562 571) the Hoare annotation is: (let ((.cse0 (= 1 ~t1_pc~0)) (.cse1 (not (= ~M_E~0 0))) (.cse2 (<= 2 ~m_st~0)) (.cse3 (not (= ~E_M~0 0))) (.cse4 (<= 2 ~t1_st~0)) (.cse5 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (not (= ~M_E~0 1))) (.cse8 (<= 2 ~E_1~0)) (.cse9 (not (= ~E_M~0 1))) (.cse10 (= 1 ~t2_pc~0)) (.cse11 (<= 2 ~t2_st~0)) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse13 (= 1 ~m_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~local~0 ~token~0)) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (let ((.cse14 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~token~0 .cse14) .cse10 .cse11 .cse12 .cse13 (<= .cse14 ~token~0))) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (let ((.cse15 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse15) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse15 ~token~0) .cse13)) (not (= 1 ~t1_i~0)) (< |old(~E_1~0)| 2) (< |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)|)) (< |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-10 13:05:22,244 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-10 13:05:22,244 INFO L421 ceAbstractionStarter]: At program point L556(line 556) the Hoare annotation is: (let ((.cse0 (= 1 ~t1_pc~0)) (.cse1 (not (= ~M_E~0 0))) (.cse2 (<= 2 ~m_st~0)) (.cse3 (not (= ~E_M~0 0))) (.cse4 (<= 2 ~t1_st~0)) (.cse5 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (not (= ~M_E~0 1))) (.cse8 (<= 2 ~E_1~0)) (.cse9 (not (= ~E_M~0 1))) (.cse10 (= 1 ~t2_pc~0)) (.cse11 (<= 2 ~t2_st~0)) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse13 (= 1 ~m_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~local~0 ~token~0)) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (let ((.cse14 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~token~0 .cse14) .cse10 .cse11 .cse12 .cse13 (<= .cse14 ~token~0))) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (let ((.cse15 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse15) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse15 ~token~0) .cse13)) (not (= 1 ~t1_i~0)) (< |old(~E_1~0)| 2) (< |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)|)) (< |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-10 13:05:22,245 INFO L428 ceAbstractionStarter]: At program point L581(lines 528 586) the Hoare annotation is: true [2018-11-10 13:05:22,246 INFO L421 ceAbstractionStarter]: At program point start_simulationENTRY(lines 528 586) the Hoare annotation is: (or (< |old(~E_1~0)| 2) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~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) (= ~t1_pc~0 |old(~t1_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (not (= 0 |old(~t2_st~0)|)) (not (= 1 ~t1_i~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-10 13:05:22,246 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-10 13:05:22,246 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2018-11-10 13:05:22,246 INFO L425 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2018-11-10 13:05:22,246 INFO L421 ceAbstractionStarter]: At program point L538(line 538) the Hoare annotation is: (or (< |old(~E_1~0)| 2) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~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) (= ~t1_pc~0 |old(~t1_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (not (= 0 |old(~t2_st~0)|)) (not (= 1 ~t1_i~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-10 13:05:22,246 INFO L421 ceAbstractionStarter]: At program point L536(line 536) the Hoare annotation is: (or (< |old(~E_1~0)| 2) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~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) (= ~t1_pc~0 |old(~t1_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (not (= 0 |old(~t2_st~0)|)) (not (= 1 ~t1_i~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-10 13:05:22,247 INFO L421 ceAbstractionStarter]: At program point L536-1(line 536) the Hoare annotation is: (or (< |old(~E_1~0)| 2) (and (not (= ~t2_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T2_E~0)| ~T2_E~0) (<= ~token~0 ~local~0) (= |old(~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) (= ~t1_pc~0 |old(~t1_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0)) (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~T2_E~0)| 0) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (= 1 |old(~t2_pc~0)|) (not (= 0 |old(~t2_st~0)|)) (not (= 1 ~t1_i~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-10 13:05:22,248 INFO L421 ceAbstractionStarter]: At program point L565(line 565) the Hoare annotation is: (let ((.cse0 (= 1 ~t1_pc~0)) (.cse1 (not (= ~M_E~0 0))) (.cse2 (<= 2 ~m_st~0)) (.cse3 (not (= ~E_M~0 0))) (.cse4 (<= 2 ~t1_st~0)) (.cse5 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (not (= ~M_E~0 1))) (.cse8 (<= 2 ~E_1~0)) (.cse9 (not (= ~E_M~0 1))) (.cse10 (= 1 ~t2_pc~0)) (.cse11 (<= 2 ~t2_st~0)) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse13 (= 1 ~m_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~local~0 ~token~0)) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (let ((.cse14 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~token~0 .cse14) .cse10 .cse11 .cse12 .cse13 (<= .cse14 ~token~0))) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (let ((.cse15 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse15) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse15 ~token~0) .cse13)) (not (= 1 ~t1_i~0)) (< |old(~E_1~0)| 2) (< |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)|)) (< |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-10 13:05:22,248 INFO L421 ceAbstractionStarter]: At program point L565-1(line 565) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_2~0)) (.cse2 (and (<= 2 ~t2_st~0) (= 1 ~t1_pc~0) (<= 2 ~t1_st~0) (and (not (= ~E_2~0 1)) (and (= |old(~T2_E~0)| ~T2_E~0) (= 1 ~t2_pc~0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~T2_E~0 1)) (= 1 ~m_pc~0) (<= 2 ~m_st~0) (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_M~0 1))) (<= 2 ~E_1~0))))) (or (= |old(~T1_E~0)| 0) (let ((.cse1 (+ ~local~0 2))) (and .cse0 (<= .cse1 ~token~0) .cse2 (<= ~token~0 .cse1))) (and .cse0 (<= ~token~0 ~local~0) .cse2 (<= ~local~0 ~token~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 ((.cse3 (+ ~local~0 1))) (and (<= ~token~0 .cse3) .cse0 (<= .cse3 ~token~0) .cse2)) (= 1 |old(~t2_pc~0)|) (not (= 1 ~t1_i~0)) (< |old(~E_1~0)| 2) (< |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)|)) (< |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-10 13:05:22,251 INFO L421 ceAbstractionStarter]: At program point L557(line 557) the Hoare annotation is: (let ((.cse0 (= 1 ~t1_pc~0)) (.cse1 (not (= ~M_E~0 0))) (.cse2 (<= 2 ~m_st~0)) (.cse3 (not (= ~E_M~0 0))) (.cse4 (<= 2 ~t1_st~0)) (.cse5 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (not (= ~M_E~0 1))) (.cse8 (<= 2 ~E_1~0)) (.cse9 (not (= ~E_M~0 1))) (.cse10 (= 1 ~t2_pc~0)) (.cse11 (<= 2 ~t2_st~0)) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse13 (= 1 ~m_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~local~0 ~token~0)) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (let ((.cse14 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~token~0 .cse14) .cse10 .cse11 .cse12 .cse13 (<= .cse14 ~token~0))) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (let ((.cse15 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse15) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse15 ~token~0) .cse13)) (not (= 1 ~t1_i~0)) (< |old(~E_1~0)| 2) (< |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)|)) (< |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-10 13:05:22,251 INFO L421 ceAbstractionStarter]: At program point L555(line 555) the Hoare annotation is: (let ((.cse0 (= 1 ~t1_pc~0)) (.cse1 (not (= ~M_E~0 0))) (.cse2 (<= 2 ~m_st~0)) (.cse3 (not (= ~E_M~0 0))) (.cse4 (<= 2 ~t1_st~0)) (.cse5 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (not (= ~M_E~0 1))) (.cse8 (<= 2 ~E_1~0)) (.cse9 (not (= ~E_M~0 1))) (.cse10 (= 1 ~t2_pc~0)) (.cse11 (<= 2 ~t2_st~0)) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse13 (= 1 ~m_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~local~0 ~token~0)) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (let ((.cse14 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~token~0 .cse14) .cse10 .cse11 .cse12 .cse13 (<= .cse14 ~token~0))) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (let ((.cse15 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse15) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse15 ~token~0) .cse13)) (not (= 1 ~t1_i~0)) (< |old(~E_1~0)| 2) (< |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)|)) (< |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-10 13:05:22,254 INFO L421 ceAbstractionStarter]: At program point L555-1(line 555) the Hoare annotation is: (let ((.cse0 (= 1 ~t1_pc~0)) (.cse1 (not (= ~M_E~0 0))) (.cse2 (<= 2 ~m_st~0)) (.cse3 (not (= ~E_M~0 0))) (.cse4 (<= 2 ~t1_st~0)) (.cse5 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (not (= ~M_E~0 1))) (.cse8 (<= 2 ~E_1~0)) (.cse9 (not (= ~E_M~0 1))) (.cse10 (= 1 ~t2_pc~0)) (.cse11 (<= 2 ~t2_st~0)) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse13 (= 1 ~m_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~local~0 ~token~0)) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (let ((.cse14 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~token~0 .cse14) .cse10 .cse11 .cse12 .cse13 (<= .cse14 ~token~0))) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (let ((.cse15 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse15) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse15 ~token~0) .cse13)) (not (= 1 ~t1_i~0)) (< |old(~E_1~0)| 2) (< |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)|)) (< |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-10 13:05:22,254 INFO L421 ceAbstractionStarter]: At program point L551(line 551) the Hoare annotation is: (let ((.cse0 (= 1 ~t1_pc~0)) (.cse1 (not (= ~M_E~0 0))) (.cse2 (<= 2 ~m_st~0)) (.cse3 (not (= ~E_M~0 0))) (.cse4 (<= 2 ~t1_st~0)) (.cse5 (= |old(~T2_E~0)| ~T2_E~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (not (= ~M_E~0 1))) (.cse8 (<= 2 ~E_1~0)) (.cse9 (not (= ~E_M~0 1))) (.cse10 (= 1 ~t2_pc~0)) (.cse11 (<= 2 ~t2_st~0)) (.cse12 (= |old(~T1_E~0)| ~T1_E~0)) (.cse13 (= 1 ~m_pc~0))) (or (= |old(~T1_E~0)| 0) (= |old(~T2_E~0)| 1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~local~0 ~token~0)) (< |old(~local~0)| |old(~token~0)|) (= |old(~T2_E~0)| 0) (let ((.cse14 (+ ~local~0 2))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~token~0 .cse14) .cse10 .cse11 .cse12 .cse13 (<= .cse14 ~token~0))) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~t2_pc~0)|) (let ((.cse15 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse15) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse15 ~token~0) .cse13)) (not (= 1 ~t1_i~0)) (< |old(~E_1~0)| 2) (< |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)|)) (< |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-10 13:05:22,256 INFO L425 ceAbstractionStarter]: For program point L551-1(line 551) no Hoare annotation was computed. [2018-11-10 13:05:22,257 INFO L421 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse10 (= ~m_i~0 1))) (let ((.cse4 (= |old(~T2_E~0)| ~T2_E~0)) (.cse5 (= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (not (= ~M_E~0 1))) (.cse7 (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) .cse10)))) (let ((.cse0 (and (<= 2 ~t2_st~0) (= 1 ~t1_pc~0) (and (and .cse4 (not (= ~T1_E~0 1)) .cse5 (not (= ~T2_E~0 1)) (and (= 1 ~t2_pc~0) .cse6 (= 1 ~m_pc~0) (<= 2 ~m_st~0) .cse7 (= ~t1_i~0 1)) (not (= ~E_M~0 1))) (<= 2 ~E_1~0)) (<= 2 ~t1_st~0))) (.cse1 (<= 2 ~E_2~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0))) (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)|) (= |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)|) (not (= 1 ~t1_i~0)) (< |old(~E_1~0)| 2) (let ((.cse3 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse3) .cse1 (<= .cse3 ~token~0))) (< |old(~token~0)| |old(~local~0)|) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and (= ~t1_pc~0 |old(~t1_pc~0)|) (and .cse4 (= |old(~E_1~0)| ~E_1~0) .cse5 (and (not (= ~t2_pc~0 1)) (= ~m_st~0 0) .cse6 .cse7 (not (= ~m_pc~0 1)) (= 0 ~t2_st~0)) (= |old(~E_M~0)| ~E_M~0)) (= ~token~0 |old(~token~0)|) .cse8 (= 0 ~t1_st~0) (= ~E_2~0 |old(~E_2~0)|) .cse9) (not .cse10) (not (= 0 |old(~t2_st~0)|)) (< |old(~E_2~0)| 2) (and .cse0 .cse1 .cse8 .cse9) (not (= 1 ~t2_i~0)) (= 0 |old(~E_M~0)|) (< 0 |old(~t1_pc~0)|) (= 1 |old(~m_pc~0)|))))) [2018-11-10 13:05:22,257 INFO L425 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-11-10 13:05:22,257 INFO L425 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2018-11-10 13:05:22,257 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 165) no Hoare annotation was computed. [2018-11-10 13:05:22,257 INFO L425 ceAbstractionStarter]: For program point L156-2(lines 156 165) no Hoare annotation was computed. [2018-11-10 13:05:22,257 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 152 170) no Hoare annotation was computed. [2018-11-10 13:05:22,257 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 152 170) no Hoare annotation was computed. [2018-11-10 13:05:22,257 INFO L421 ceAbstractionStarter]: At program point L167(lines 155 169) the Hoare annotation is: (let ((.cse20 (= 1 ~t2_pc~0)) (.cse33 (= ~t1_st~0 0)) (.cse22 (= 1 ~m_pc~0)) (.cse34 (+ ~local~0 1)) (.cse35 (+ ~local~0 2))) (let ((.cse26 (< .cse35 ~token~0)) (.cse27 (< ~token~0 .cse35)) (.cse0 (< ~t1_st~0 2)) (.cse21 (not (= 0 ~t2_st~0))) (.cse30 (< ~token~0 .cse34)) (.cse32 (= 0 ~E_2~0)) (.cse31 (< .cse34 ~token~0)) (.cse23 (< ~E_1~0 2)) (.cse7 (not (= ~t1_pc~0 1))) (.cse24 (< ~m_st~0 2)) (.cse25 (not .cse22)) (.cse4 (= ~T1_E~0 0)) (.cse5 (< ~t2_st~0 2)) (.cse6 (= ~T2_E~0 1)) (.cse2 (< ~local~0 ~token~0)) (.cse3 (< ~token~0 ~local~0)) (.cse8 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse28 (not .cse33)) (.cse11 (= 1 ~E_M~0)) (.cse12 (not .cse20)) (.cse13 (= ~T1_E~0 1)) (.cse14 (not (= ~m_i~0 1))) (.cse15 (= 0 ~E_1~0)) (.cse16 (not (= 1 ~t1_i~0))) (.cse19 (< ~E_2~0 2)) (.cse1 (= 0 is_master_triggered_~__retres1~0)) (.cse17 (not (= 1 ~t2_i~0))) (.cse18 (= 0 ~E_M~0)) (.cse29 (< 0 ~t1_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19) (or .cse4 .cse6 .cse2 .cse7 .cse3 .cse8 .cse9 .cse10 .cse11 .cse0 .cse13 .cse14 .cse20 .cse21 .cse15 .cse1 .cse16 .cse19 .cse17 .cse18 .cse22) (or .cse23 .cse4 .cse5 .cse6 .cse2 .cse7 .cse3 .cse1 .cse24 .cse8 .cse9 .cse11 .cse12 .cse0 .cse13 .cse14 .cse25 .cse16 .cse19 .cse17 .cse18) (or .cse23 .cse4 .cse5 .cse6 .cse26 .cse7 .cse24 .cse8 .cse9 .cse11 .cse12 .cse0 .cse13 .cse14 .cse1 .cse25 .cse16 .cse19 .cse17 .cse18 .cse27) (or .cse4 .cse6 .cse1 .cse2 .cse3 .cse8 .cse9 .cse10 .cse28 .cse11 .cse13 .cse14 .cse20 .cse21 .cse15 .cse16 .cse19 .cse17 .cse18 .cse29 .cse22) (or .cse1 .cse11 .cse0 (or .cse23 .cse4 .cse6 .cse7 .cse24 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse25 .cse16 .cse17 .cse18) .cse26 .cse19 .cse27) (or .cse23 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse9 .cse1 .cse11 .cse12 .cse0 .cse13 .cse30 .cse14 .cse25 .cse16 .cse19 .cse17 .cse31 .cse18) (or .cse23 .cse4 .cse6 .cse7 .cse24 .cse8 .cse9 .cse10 .cse11 .cse13 .cse1 .cse30 .cse14 .cse20 .cse21 .cse25 .cse16 .cse17 .cse31 .cse18 .cse32 .cse33) (or .cse30 .cse32 .cse31 .cse33 .cse1 (or .cse23 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse16 .cse17 .cse18)) (or .cse4 .cse5 .cse6 .cse2 .cse3 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse1 .cse17 .cse18 .cse29 .cse22)))) [2018-11-10 13:05:22,258 INFO L428 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 152 170) the Hoare annotation is: true [2018-11-10 13:05:22,258 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:05:22,258 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 (= ~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) (<= 2 ~E_1~0) (<= ~local~0 ~token~0) (not (= ~E_M~0 1))) [2018-11-10 13:05:22,258 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:05:22,258 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:05:22,258 INFO L425 ceAbstractionStarter]: For program point L479-1(lines 463 496) no Hoare annotation was computed. [2018-11-10 13:05:22,258 INFO L425 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 460 497) no Hoare annotation was computed. [2018-11-10 13:05:22,258 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 463 496) no Hoare annotation was computed. [2018-11-10 13:05:22,258 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 463 496) no Hoare annotation was computed. [2018-11-10 13:05:22,259 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 463 496) no Hoare annotation was computed. [2018-11-10 13:05:22,259 INFO L421 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 460 497) the Hoare annotation is: (let ((.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse2 (< ~t2_st~0 2)) (.cse3 (= |old(~T2_E~0)| 1)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (< ~m_st~0 2)) (.cse6 (= |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)) (.cse12 (not (= ~m_i~0 1))) (.cse13 (not (= 1 ~m_pc~0))) (.cse14 (not (= 1 ~t1_i~0))) (.cse15 (< |old(~E_2~0)| 2)) (.cse16 (not (= 1 ~t2_i~0))) (.cse17 (= 0 |old(~E_M~0)|)) (.cse18 (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)))) (and (or .cse0 .cse1 .cse2 .cse3 (< ~local~0 ~token~0) .cse4 (< ~token~0 ~local~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (let ((.cse19 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 .cse3 (< .cse19 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15 .cse16 .cse17 (< ~token~0 .cse19))) (let ((.cse20 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 .cse20) .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse20 ~token~0) .cse17 .cse18)))) [2018-11-10 13:05:22,259 INFO L425 ceAbstractionStarter]: For program point L464-1(lines 463 496) no Hoare annotation was computed. [2018-11-10 13:05:22,259 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 460 497) no Hoare annotation was computed. [2018-11-10 13:05:22,259 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 498 508) no Hoare annotation was computed. [2018-11-10 13:05:22,259 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 498 508) no Hoare annotation was computed. [2018-11-10 13:05:22,259 INFO L421 ceAbstractionStarter]: At program point init_modelENTRY(lines 498 508) the Hoare annotation is: (or (< ~E_1~0 2) (= ~T1_E~0 0) (= 1 |old(~t2_i~0)|) (= ~T2_E~0 1) (< ~local~0 ~token~0) (< ~token~0 ~local~0) (= 1 |old(~t1_i~0)|) (= ~T2_E~0 0) (= 0 ~M_E~0) (and (not (= ~t1_i~0 1)) (not (= ~t2_i~0 1)) (not (= ~m_i~0 1))) (= 1 ~M_E~0) (= |old(~m_i~0)| 1) (not (= ~t1_st~0 0)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 ~m_st~0)) (= 1 ~t2_pc~0) (not (= 0 ~t2_st~0)) (< ~E_2~0 2) (= 0 ~E_M~0) (< 0 ~t1_pc~0) (= 1 ~m_pc~0)) [2018-11-10 13:05:22,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:05:22 BoogieIcfgContainer [2018-11-10 13:05:22,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:05:22,338 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:05:22,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:05:22,338 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:05:22,338 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:04:32" (3/4) ... [2018-11-10 13:05:22,342 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 13:05:22,347 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-11-10 13:05:22,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-10 13:05:22,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-11-10 13:05:22,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit2 [2018-11-10 13:05:22,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-10 13:05:22,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-11-10 13:05:22,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-10 13:05:22,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-10 13:05:22,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 13:05:22,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-10 13:05:22,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-11-10 13:05:22,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 13:05:22,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-11-10 13:05:22,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-10 13:05:22,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-10 13:05:22,349 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit2_triggered [2018-11-10 13:05:22,349 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-10 13:05:22,349 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-10 13:05:22,349 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-10 13:05:22,349 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-11-10 13:05:22,349 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-11-10 13:05:22,349 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-10 13:05:22,358 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2018-11-10 13:05:22,358 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 13:05:22,383 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((2 <= t2_st && 1 == t1_pc) && (((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && ((((1 == t2_pc && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && !(E_M == 0) && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && t1_i == 1) && !(E_M == 1)) && 2 <= E_1) && 2 <= t1_st) && 2 <= E_2) && local + 2 <= token) && token <= local + 2) || \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)) || 1 == \old(t2_pc)) || !(1 == t1_i)) || \old(E_1) < 2) || ((((((2 <= t2_st && 1 == t1_pc) && (((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && ((((1 == t2_pc && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && !(E_M == 0) && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && t1_i == 1) && !(E_M == 1)) && 2 <= E_1) && 2 <= t1_st) && token <= local + 1) && 2 <= E_2) && local + 1 <= token)) || \old(token) < \old(local)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || ((((((t1_pc == \old(t1_pc) && (((\old(T2_E) == T2_E && \old(E_1) == E_1) && \old(T1_E) == T1_E) && ((((!(t2_pc == 1) && m_st == 0) && !(M_E == 1)) && !(E_M == 0) && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(m_pc == 1)) && 0 == t2_st) && \old(E_M) == E_M) && token == \old(token)) && token <= local) && 0 == t1_st) && E_2 == \old(E_2)) && local <= token)) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_2) < 2) || ((((((2 <= t2_st && 1 == t1_pc) && (((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && ((((1 == t2_pc && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && !(E_M == 0) && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && t1_i == 1) && !(E_M == 1)) && 2 <= E_1) && 2 <= t1_st) && 2 <= E_2) && token <= local) && local <= token)) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < \old(t1_pc)) || 1 == \old(m_pc) [2018-11-10 13:05:22,384 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((T1_E == 0 || (((((((1 == t1_pc && token == \old(token)) && token <= local) && (((((((((((!(t2_pc == 1) && !(T1_E == 1)) && \old(E_1) == E_1) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && m_st == 0) && !(T2_E == 1)) && t1_i == 1) && !(m_pc == 1)) && 0 == t2_st) && !(M_E == 1)) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && 2 <= t1_st) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || T2_E == 1) || \old(local) < \old(token)) || ((((((t1_pc == \old(t1_pc) && 2 <= t2_st) && ((((1 == t2_pc && 2 <= m_st) && 0 == t1_st) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && token <= local) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || ((((((t1_pc == \old(t1_pc) && token <= local) && (((((((((((!(t2_pc == 1) && !(T1_E == 1)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && 0 == t2_st) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((1 == t1_pc && token <= local) && (((((((((((!(t2_pc == 1) && !(T1_E == 1)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && 0 == t2_st) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || (((((token == \old(token) && token <= local) && 2 <= t1_st) && ((2 <= t2_st && 1 == t1_pc) && ((((1 == t2_pc && \old(E_1) == E_1) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && m_st == 0) && !(m_pc == 1)) && !(E_M == 1)) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || 1 == \old(t2_pc)) || !(1 == t1_i)) || ((((2 <= E_2 && 2 <= t2_st && (1 == t1_pc && (((((((((!(T1_E == 1) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && !(0 == tmp)) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || \old(E_1) < 2) || (((((2 <= t2_st && (1 == t1_pc && ((((1 == t2_pc && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && m_st == 0) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && !(0 == tmp)) && 2 <= E_2) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || ((((((1 == t1_pc && token <= local + 1) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && (((((((((((!(t2_pc == 1) && !(T1_E == 1)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && 0 == t2_st) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && tmp == 1)) || \old(token) < \old(local)) || ((((token <= local + 1 && 2 <= E_2) && local + 1 <= token) && 2 <= t2_st && (1 == t1_pc && (((((((((!(T1_E == 1) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && !(0 == tmp)) && 2 <= t1_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || (((((2 <= t2_st && (1 == t1_pc && (((((((((!(T1_E == 1) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && !(0 == tmp)) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token)) || ((((((t1_pc == \old(t1_pc) && (((((((((((!(t2_pc == 1) && !(T1_E == 1)) && \old(E_1) == E_1) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && m_st == 0) && !(T2_E == 1)) && t1_i == 1) && !(m_pc == 1)) && 0 == t2_st) && !(M_E == 1)) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && token == \old(token)) && token <= local) && 0 == t1_st) && E_2 == \old(E_2)) && local <= token)) || ((((((((t1_pc == \old(t1_pc) && 2 <= t2_st) && token == \old(token)) && (((1 == t2_pc && \old(E_1) == E_1) && m_st == 0) && !(m_pc == 1)) && \old(E_M) == E_M) && token <= local) && 0 == t1_st) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || !(m_i == 1)) || !(0 == \old(t2_st))) || ((((((1 == t1_pc && token <= local) && 2 <= t1_st) && (((((((((((!(t2_pc == 1) && !(T1_E == 1)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && 0 == t2_st) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || ((((2 <= E_2 && 2 <= t2_st && (1 == t1_pc && (((((((((!(T1_E == 1) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && !(0 == tmp)) && token <= local) && 2 <= t1_st) && local <= token)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((token <= local + 1 && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && (1 == t1_pc && (((((1 == t2_pc && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && 2 <= m_st) && 0 == t2_st) && 1 == m_pc) && !(E_M == 1)) && 2 <= E_1) && !(0 == tmp))) || 0 < \old(t1_pc)) || 1 == \old(m_pc)) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || (((((((((((\old(E_1) == E_1 && 2 <= m_st) && E_2 == \old(E_2)) && \old(E_M) == E_M) && token <= local + 2) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && t1_pc == \old(t1_pc)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || 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(m_pc))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || (((((((((((token <= local + 1 && \old(E_1) == E_1) && 2 <= m_st) && E_2 == \old(E_2)) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && t1_pc == \old(t1_pc)) && 2 <= t2_st) && local + 1 <= token) && 1 == m_pc)) || !(\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(m_pc))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((\old(E_1) == E_1 && 2 <= m_st) && token <= local) && E_2 == \old(E_2)) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && t1_pc == \old(t1_pc)) && 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(m_pc))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) [2018-11-10 13:05:22,384 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || (((((((((((\old(E_1) == E_1 && 2 <= m_st) && E_2 == \old(E_2)) && \old(E_M) == E_M) && token <= local + 2) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && t1_pc == \old(t1_pc)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || 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(m_pc))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((((2 <= t2_st && 1 == t1_pc) && ((((((1 == t2_pc && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && 2 <= E_2) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || \old(local) < \old(token)) || ((((((2 <= t2_st && 1 == t1_pc) && ((((((1 == t2_pc && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && token <= local + 1) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || ((((((2 <= t2_st && 1 == t1_pc) && ((((((1 == t2_pc && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && 2 <= E_2) && token <= local) && 2 <= t1_st) && local <= token)) || !(1 == t1_i)) || \old(E_1) < 2) || \old(token) < \old(local)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < \old(t1_pc)) || 1 == \old(m_pc))) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((\old(E_1) == E_1 && 2 <= m_st) && token <= local) && E_2 == \old(E_2)) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && t1_pc == \old(t1_pc)) && 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(m_pc))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || (((((((((((\old(E_1) == E_1 && token <= local + 1) && 2 <= m_st) && E_2 == \old(E_2)) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && t1_pc == \old(t1_pc)) && 2 <= t2_st) && local + 1 <= token) && 1 == m_pc)) || 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(m_pc))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) [2018-11-10 13:05:22,385 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((\old(E_1) < 2 || ((((((\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 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && ((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || T2_E == 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) || !(0 == \old(t2_st))) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && 0 == t1_st) && 0 == t2_st) && local <= 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) || !(0 == \old(t2_st))) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == \old(m_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) || \old(local) + 2 < \old(token)) || E_2 < 2) || ((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || 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)) || !(1 == \old(m_pc))) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((\old(E_1) < 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 == 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)) [2018-11-10 13:05:22,386 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || \old(token) < \old(local)) || T2_E == 0) || ((((((2 <= m_st && token <= local) && 2 <= E_1) && 0 == t1_st) && 2 <= t2_st) && 1 == m_pc) && local <= token)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == \old(m_pc)) && ((((((\old(t1_st) < 2 || \old(local) + 2 < \old(token)) || E_2 < 2) || (((((((((((((((((((((!(T2_E == 0) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && 2 <= t1_st) && 2 <= E_2) && !(M_E == 1)) && token <= local) && t2_i == 1) && 1 == t1_pc) && 2 <= E_1) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || ((((((((((((((((((((!(T2_E == 0) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && 2 <= E_2) && !(M_E == 1)) && token <= local) && t2_i == 1) && 1 == t1_pc) && 2 <= E_1) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && 0 == t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || ((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || 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)) || !(1 == \old(m_pc))) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((\old(E_1) < 2 || 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)) || ((((((2 <= m_st && token <= local) && 2 <= E_1) && 0 == t1_st) && 0 == t2_st) && 1 == m_pc) && local <= token)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == \old(t2_st))) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == \old(m_pc))) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || ((((((2 <= m_st && token <= local) && 2 <= E_1) && 0 == t1_st) && 0 == t2_st) && 1 == m_pc) && local <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == \old(t2_st))) || ((((((2 <= m_st && token <= local) && 2 <= E_1) && t1_st == \old(t1_st)) && 0 == t2_st) && 1 == m_pc) && local <= token)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || (((((((((((((((((((((!(T2_E == 0) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && 2 <= t1_st) && 2 <= E_2) && !(M_E == 1)) && token <= local) && t2_i == 1) && 1 == t1_pc) && 2 <= E_1) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || 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 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || ((((((((((((((((((((!(T2_E == 0) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && 2 <= E_2) && !(M_E == 1)) && token <= local) && t2_i == 1) && 1 == t1_pc) && 2 <= E_1) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && 0 == t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || 1 == \old(m_pc)) [2018-11-10 13:05:22,386 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((\old(E_1) < 2 || 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 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && (((((((((((((((((((\old(E_1) < 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 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == \old(m_pc))) && (((((((((((((((((((\old(E_1) < 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) || !(0 == \old(t2_st))) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_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) || \old(local) + 2 < \old(token)) || E_2 < 2) || ((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || 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)) || !(1 == \old(m_pc))) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 2)) && (((((((((((((((((((\old(E_1) < 2 || 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) || !(0 == \old(t2_st))) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == \old(m_pc)) [2018-11-10 13:05:22,386 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((E_1 < 2 || 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) || (((((t1_pc == \old(t1_pc) && ((((((((((!(t2_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && m_i == 1) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 2 <= E_1) && !(E_M == 1)) && token <= local) && t1_st == \old(t1_st)) && E_2 == \old(E_2)) && local <= token)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || (((((t1_pc == \old(t1_pc) && ((((((((((!(t2_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && m_i == 1) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 2 <= E_1) && !(E_M == 1)) && token <= \old(token) + 1) && 2 <= E_2) && local + 1 <= token) && t1_st == \old(t1_st))) || 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) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || ((((((t1_pc == \old(t1_pc) && 2 <= t2_st) && token <= \old(token) + 1) && (((((((((((((!(T1_E == 1) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && m_i == 1) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && 2 <= E_1) && !(E_M == 1)) && 2 <= E_2) && local + 1 <= token) && t1_st == \old(t1_st))) || ((((((2 <= m_st && token <= \old(token) + 1) && 2 <= E_2) && t1_st == \old(t1_st)) && 0 == t2_st) && t1_pc == \old(t1_pc)) && local + 1 <= token)) || local < \old(token)) || \old(token) < local) || \old(E_2) < 2) || \old(t1_st) == 0)) && (((((((((((((((((((((E_1 < 2 || 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)) || ((((((t1_pc == \old(t1_pc) && 2 <= t2_st) && m_st == 0) && token <= local) && t1_st == \old(t1_st)) && E_2 == \old(E_2)) && local <= token)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc)) && (((((((((((((((((((((E_1 < 2 || 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))) || (((((t1_pc == \old(t1_pc) && token <= local) && m_st == 0 && 0 == t2_st) && t1_st == \old(t1_st)) && E_2 == \old(E_2)) && local <= token)) || !(m_i == 1)) || 1 == t2_pc) || !(0 == \old(t2_st))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc)) && (((((((((((((((((((((E_1 < 2 || 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 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || ((((((t1_pc == \old(t1_pc) && 2 <= t2_st) && (((((((((((((!(T1_E == 1) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && m_i == 1) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && 2 <= E_1) && !(E_M == 1)) && token <= local) && t1_st == \old(t1_st)) && E_2 == \old(E_2)) && local <= token)) || 0 < \old(t1_pc)) [2018-11-10 13:05:22,386 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((E_1 < 2 || T1_E == 0) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && E_2 == \old(E_2)) && token == \old(token)) && 0 == t2_st)) || 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) || !(0 == \old(t2_st))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc) && (((((((((((((((((((((E_1 < 2 || 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) && E_2 == \old(E_2)) && token == \old(token)) && 2 <= t2_st)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && (((((((((((((((((((((E_1 < 2 || 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) || ((((((2 <= m_st && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && 0 == t2_st) && t1_pc == \old(t1_pc)) && local + 1 <= token)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || local < \old(token)) || \old(token) < local) || \old(E_2) < 2) || \old(t1_st) == 0) || ((((((2 <= m_st && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && 0 == t2_st) && t1_pc == \old(t1_pc)) && local + 1 <= token)) || ((((((2 <= m_st && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && t1_pc == \old(t1_pc)) && 2 <= t2_st) && local + 1 <= token))) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && E_2 == \old(E_2)) && token == \old(token)) && 0 == t2_st)) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && (((((((((((((((((((((E_1 < 2 || 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 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && E_2 == \old(E_2)) && token == \old(token)) && 2 <= t2_st)) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc) [2018-11-10 13:05:22,386 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || local < \old(token)) || (((((2 <= m_st && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && t1_pc == \old(t1_pc)) && 2 <= t2_st)) || \old(token) < local) || \old(E_2) < 2) || \old(t1_st) == 0) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || (((((2 <= m_st && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st) && t1_pc == \old(t1_pc))) || \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) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((E_1 < 2 || 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 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && ((((((((((((((((((((E_1 < 2 || 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 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc)) && ((((((((((((((((((((E_1 < 2 || 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) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && ((((((((((((((((((((E_1 < 2 || 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) || !(0 == \old(t2_st))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc) [2018-11-10 13:05:22,386 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((E_1 < 2 || (((token <= local && m_st == 0 && 0 == t1_st) && local <= token) && \old(E_M) == 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 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc) || 1 == m_pc) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == m_pc)) || ((((2 <= m_st && t1_st == \old(t1_st)) && token <= local) && local <= token) && \old(E_M) == E_M)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((\old(t1_st) < 2 || \old(token) < local + 1) || ((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((t1_st == \old(t1_st) && m_st == 0 && !(E_M == 0)) && local + 2 <= token) && !(E_M == 1)) && token <= local + 2)) || E_2 < 2) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_M == 0)) && local + 2 <= token) && !(E_M == 1)) && token <= local + 2)) || local + 1 < \old(token))) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || ((((t1_st == \old(t1_st) && m_st == 0) && token <= local) && local <= token) && \old(E_M) == E_M)) || 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 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || (((token == \old(token) && 2 <= m_st) && t1_st == \old(t1_st)) && \old(E_M) == E_M))) && ((((((((((((((((((((E_1 < 2 || 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 == m_pc)) || ((((2 <= m_st && token <= local) && (((((!(T2_E == 0) && !(M_E == 0)) && m_i == 1) && 0 == t1_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token) && \old(E_M) == E_M)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || ((((2 <= m_st && token <= local) && (((((!(T2_E == 0) && !(M_E == 0)) && m_i == 1) && 0 == t1_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token) && \old(E_M) == E_M)) || 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 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) [2018-11-10 13:05:22,386 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((E_1 < 2 || 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)) || (((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc) || 1 == m_pc) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(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)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((((((((E_1 < 2 || 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 == m_pc)) || (((((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)) && ((((((\old(t1_st) < 2 || \old(token) < local + 1) || ((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || E_2 < 2) || local + 1 < \old(token)) || (((((((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)) || (((((((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))) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || \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 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \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 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || (((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) [2018-11-10 13:05:22,386 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((((((((E_1 < 2 || 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 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc)) && (((((\old(t1_st) < 2 || \old(token) < local + 1) || (((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || E_2 < 2) || local + 1 < \old(token)) || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)))) && (((((((((((((((((((E_1 < 2 || 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 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc) || 1 == m_pc)) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) [2018-11-10 13:05:22,434 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3e871d53-100f-41d1-a357-70bdeaaeb654/bin-2019/uautomizer/witness.graphml [2018-11-10 13:05:22,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:05:22,434 INFO L168 Benchmark]: Toolchain (without parser) took 50616.85 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 960.3 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 141.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:05:22,435 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:05:22,435 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.46 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 13:05:22,435 INFO L168 Benchmark]: Boogie Preprocessor took 75.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:05:22,435 INFO L168 Benchmark]: RCFGBuilder took 454.35 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: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:05:22,436 INFO L168 Benchmark]: TraceAbstraction took 49788.05 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-11-10 13:05:22,436 INFO L168 Benchmark]: Witness Printer took 95.95 ms. Allocated memory is still 2.8 GB. Free memory is still 2.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:05:22,437 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 200.46 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 454.35 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: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49788.05 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 95.95 ms. Allocated memory is still 2.8 GB. Free memory is still 2.6 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: (((((((((((((((((((((((((((((2 <= t2_st && 1 == t1_pc) && (((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && ((((1 == t2_pc && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && !(E_M == 0) && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && t1_i == 1) && !(E_M == 1)) && 2 <= E_1) && 2 <= t1_st) && 2 <= E_2) && local + 2 <= token) && token <= local + 2) || \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)) || 1 == \old(t2_pc)) || !(1 == t1_i)) || \old(E_1) < 2) || ((((((2 <= t2_st && 1 == t1_pc) && (((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && ((((1 == t2_pc && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && !(E_M == 0) && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && t1_i == 1) && !(E_M == 1)) && 2 <= E_1) && 2 <= t1_st) && token <= local + 1) && 2 <= E_2) && local + 1 <= token)) || \old(token) < \old(local)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || ((((((t1_pc == \old(t1_pc) && (((\old(T2_E) == T2_E && \old(E_1) == E_1) && \old(T1_E) == T1_E) && ((((!(t2_pc == 1) && m_st == 0) && !(M_E == 1)) && !(E_M == 0) && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(m_pc == 1)) && 0 == t2_st) && \old(E_M) == E_M) && token == \old(token)) && token <= local) && 0 == t1_st) && E_2 == \old(E_2)) && local <= token)) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_2) < 2) || ((((((2 <= t2_st && 1 == t1_pc) && (((((\old(T2_E) == T2_E && !(T1_E == 1)) && \old(T1_E) == T1_E) && !(T2_E == 1)) && ((((1 == t2_pc && !(M_E == 1)) && 1 == m_pc) && 2 <= m_st) && !(E_M == 0) && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && t1_i == 1) && !(E_M == 1)) && 2 <= E_1) && 2 <= t1_st) && 2 <= E_2) && token <= local) && local <= token)) || !(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_E == 0 || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || 0 == __retres1) || T1_E == 1) || !(1 == E_1)) || !(m_i == 1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || 0 == __retres1) || 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 == m_pc)) || !(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)) && (((((((((((((((((((E_1 < 2 || !(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)) || 0 == __retres1) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || token < local + 2)) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 0 == __retres1) || 1 == E_M) || 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)) && ((((((((((((((((((((E_1 < 2 || 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 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || token < local + 2)) && (((((((t1_st < 2 || t2_st < 2) || local < token) || !(t1_pc == 1)) || token < local) || E_2 < 2) || 0 == __retres1) || (((((((((((T1_E == 0 || T2_E == 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)) && ((((((local < token || token < local) || E_2 < 2) || 0 == __retres1) || 0 < t1_pc) || (((((((((((((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) || !(t1_st == 0))) && (((((t1_st < 2 || local + 2 < token) || E_2 < 2) || (((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || token < local + 2) || 0 == __retres1)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || 0 == __retres1) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((((0 == __retres1 || t2_st < 2) || ((((((((((((T1_E == 0 || T2_E == 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) || 1 == m_pc) || local < token) || token < local) || E_2 < 2) || 0 < t1_pc) || !(t1_st == 0))) && ((((((((((((((((((((E_1 < 2 || 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 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M)) && ((((((((((((((((((((((T1_E == 0 || T2_E == 1) || 1 == E_2) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || token < local + 1) || !(1 == t1_i)) || 0 == E_2) || t1_st == 0) || E_1 < 2) || t2_st < 2) || !(t1_pc == 1)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || 0 == __retres1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((E_1 < 2 || T1_E == 0) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && E_2 == \old(E_2)) && token == \old(token)) && 0 == t2_st)) || 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) || !(0 == \old(t2_st))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc) && (((((((((((((((((((((E_1 < 2 || 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) && E_2 == \old(E_2)) && token == \old(token)) && 2 <= t2_st)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && (((((((((((((((((((((E_1 < 2 || 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) || ((((((2 <= m_st && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && 0 == t2_st) && t1_pc == \old(t1_pc)) && local + 1 <= token)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || local < \old(token)) || \old(token) < local) || \old(E_2) < 2) || \old(t1_st) == 0) || ((((((2 <= m_st && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && 0 == t2_st) && t1_pc == \old(t1_pc)) && local + 1 <= token)) || ((((((2 <= m_st && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && t1_pc == \old(t1_pc)) && 2 <= t2_st) && local + 1 <= token))) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && E_2 == \old(E_2)) && token == \old(token)) && 0 == t2_st)) || T2_E == 1) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && (((((((((((((((((((((E_1 < 2 || 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 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && E_2 == \old(E_2)) && token == \old(token)) && 2 <= t2_st)) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || local < \old(token)) || (((((2 <= m_st && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && t1_pc == \old(t1_pc)) && 2 <= t2_st)) || \old(token) < local) || \old(E_2) < 2) || \old(t1_st) == 0) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || (((((2 <= m_st && token == \old(token)) && \old(E_2) == E_2) && t1_st == \old(t1_st)) && 0 == t2_st) && t1_pc == \old(t1_pc))) || \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) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((E_1 < 2 || 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 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && ((((((((((((((((((((E_1 < 2 || 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 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc)) && ((((((((((((((((((((E_1 < 2 || 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) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc))) && ((((((((((((((((((((E_1 < 2 || 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) || !(0 == \old(t2_st))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\old(E_1) < 2 || 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 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && (((((((((((((((((((\old(E_1) < 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 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == \old(m_pc))) && (((((((((((((((((((\old(E_1) < 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) || !(0 == \old(t2_st))) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_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) || \old(local) + 2 < \old(token)) || E_2 < 2) || ((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || 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)) || !(1 == \old(m_pc))) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 2)) && (((((((((((((((((((\old(E_1) < 2 || 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) || !(0 == \old(t2_st))) || !(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_st < 2 || 0 == __retres1) || local < token) || token < local) || (((((((((((((T1_E == 0 || t2_st < 2) || 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) || E_2 < 2) && ((((((((((((((((((((T1_E == 0 || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 0 == E_1) || 0 == __retres1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && ((((((((((((((((((((E_1 < 2 || 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 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((E_1 < 2 || 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)) || 0 == __retres1) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || token < local + 2)) && ((((((((((((((((((((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)) && ((((((0 == __retres1 || 1 == E_M) || t1_st < 2) || (((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || local + 2 < token) || E_2 < 2) || token < local + 2)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M)) && (((((((((((((((((((((E_1 < 2 || 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) || 0 == __retres1) || token < local + 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == E_2) || t1_st == 0)) && (((((token < local + 1 || 0 == E_2) || local + 1 < token) || t1_st == 0) || 0 == __retres1) || (((((((((((((((E_1 < 2 || 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) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((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)) || T1_E == 1) || !(m_i == 1)) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || 0 == __retres1) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == m_pc) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\old(E_1) < 2 || ((((((\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 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc)) && ((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && t1_st == \old(t1_st)) && 0 == t2_st) && local <= token)) || T2_E == 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) || !(0 == \old(t2_st))) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || ((((((\old(E_1) == E_1 && !(m_pc == 1)) && token <= local) && token == \old(token)) && 0 == t1_st) && 0 == t2_st) && local <= 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) || !(0 == \old(t2_st))) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == \old(m_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) || \old(local) + 2 < \old(token)) || E_2 < 2) || ((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || 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)) || !(1 == \old(m_pc))) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((\old(E_1) < 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 == 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)) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || (((((((((((\old(E_1) == E_1 && 2 <= m_st) && E_2 == \old(E_2)) && \old(E_M) == E_M) && token <= local + 2) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && t1_pc == \old(t1_pc)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || 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(m_pc))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2) && (((((((((((((((((((((((T1_E == 0 || T2_E == 1) || ((((((2 <= t2_st && 1 == t1_pc) && ((((((1 == t2_pc && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && 2 <= E_2) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || \old(local) < \old(token)) || ((((((2 <= t2_st && 1 == t1_pc) && ((((((1 == t2_pc && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && token <= local + 1) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(t2_pc)) || ((((((2 <= t2_st && 1 == t1_pc) && ((((((1 == t2_pc && ((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && 2 <= E_2) && token <= local) && 2 <= t1_st) && local <= token)) || !(1 == t1_i)) || \old(E_1) < 2) || \old(token) < \old(local)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || !(0 == \old(t2_st))) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < \old(t1_pc)) || 1 == \old(m_pc))) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((\old(E_1) == E_1 && 2 <= m_st) && token <= local) && E_2 == \old(E_2)) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && t1_pc == \old(t1_pc)) && 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(m_pc))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || (((((((((((\old(E_1) == E_1 && token <= local + 1) && 2 <= m_st) && E_2 == \old(E_2)) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && t1_pc == \old(t1_pc)) && 2 <= t2_st) && local + 1 <= token) && 1 == m_pc)) || 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(m_pc))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((E_1 < 2 || (((token <= local && m_st == 0 && 0 == t1_st) && local <= token) && \old(E_M) == 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 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc) || 1 == m_pc) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == m_pc)) || ((((2 <= m_st && t1_st == \old(t1_st)) && token <= local) && local <= token) && \old(E_M) == E_M)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((\old(t1_st) < 2 || \old(token) < local + 1) || ((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((t1_st == \old(t1_st) && m_st == 0 && !(E_M == 0)) && local + 2 <= token) && !(E_M == 1)) && token <= local + 2)) || E_2 < 2) || (((((2 <= m_st && t1_st == \old(t1_st)) && !(E_M == 0)) && local + 2 <= token) && !(E_M == 1)) && token <= local + 2)) || local + 1 < \old(token))) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || ((((t1_st == \old(t1_st) && m_st == 0) && token <= local) && local <= token) && \old(E_M) == E_M)) || 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 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M)) || (((token == \old(token) && 2 <= m_st) && t1_st == \old(t1_st)) && \old(E_M) == E_M))) && ((((((((((((((((((((E_1 < 2 || 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 == m_pc)) || ((((2 <= m_st && token <= local) && (((((!(T2_E == 0) && !(M_E == 0)) && m_i == 1) && 0 == t1_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token) && \old(E_M) == E_M)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc)) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || ((((2 <= m_st && token <= local) && (((((!(T2_E == 0) && !(M_E == 0)) && m_i == 1) && 0 == t1_st) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && local <= token) && \old(E_M) == E_M)) || 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 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || \old(token) < \old(local)) || T2_E == 0) || ((((((2 <= m_st && token <= local) && 2 <= E_1) && 0 == t1_st) && 2 <= t2_st) && 1 == m_pc) && local <= token)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == \old(m_pc)) && ((((((\old(t1_st) < 2 || \old(local) + 2 < \old(token)) || E_2 < 2) || (((((((((((((((((((((!(T2_E == 0) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && 2 <= t1_st) && 2 <= E_2) && !(M_E == 1)) && token <= local) && t2_i == 1) && 1 == t1_pc) && 2 <= E_1) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || ((((((((((((((((((((!(T2_E == 0) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && 2 <= E_2) && !(M_E == 1)) && token <= local) && t2_i == 1) && 1 == t1_pc) && 2 <= E_1) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && 0 == t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || ((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || 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)) || !(1 == \old(m_pc))) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((\old(E_1) < 2 || 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)) || ((((((2 <= m_st && token <= local) && 2 <= E_1) && 0 == t1_st) && 0 == t2_st) && 1 == m_pc) && local <= token)) || 1 == E_M) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == \old(t2_st))) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == \old(m_pc))) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || ((((((2 <= m_st && token <= local) && 2 <= E_1) && 0 == t1_st) && 0 == t2_st) && 1 == m_pc) && local <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == \old(t2_st))) || ((((((2 <= m_st && token <= local) && 2 <= E_1) && t1_st == \old(t1_st)) && 0 == t2_st) && 1 == m_pc) && local <= token)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || (((((((((((((((((((((!(T2_E == 0) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && 2 <= t1_st) && 2 <= E_2) && !(M_E == 1)) && token <= local) && t2_i == 1) && 1 == t1_pc) && 2 <= E_1) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && t1_st == \old(t1_st)) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || 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 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || ((((((((((((((((((((!(T2_E == 0) && !(T2_E == 1)) && !(M_E == 0)) && m_i == 1) && 2 <= m_st) && !(E_M == 0)) && 2 <= E_2) && !(M_E == 1)) && token <= local) && t2_i == 1) && 1 == t1_pc) && 2 <= E_1) && !(E_M == 1)) && !(T1_E == 1)) && 1 == t2_pc) && t1_i == 1) && 0 == t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 1 == m_pc) && local <= token)) || 1 == \old(m_pc)) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((t1_st < 2 || (((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || local + 2 < token) || E_2 < 2) || 0 == __retres1) || token < local + 2) && (((((((((((((((((((((E_1 < 2 || 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) || !(0 == t2_st)) || !(1 == m_pc)) || 0 == __retres1) || !(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) || 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 == __retres1) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == m_pc)) && (((((((((((((((((((E_1 < 2 || !(1 == E_M)) || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || t1_st < 2) || 0 == __retres1) || local + 2 < token) || E_2 < 2) || token < local + 2)) && (((((((((((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || 1 == E_1) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((token < local + 1 || 0 == E_2) || local + 1 < token) || t1_st == 0) || 0 == __retres1) || (((((((((((((((E_1 < 2 || 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) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((0 == __retres1 || 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)) || 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)) && ((((((((((((((((((((E_1 < 2 || 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 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) || 0 == __retres1)) && ((((((((((((((((((((T1_E == 0 || t2_st < 2) || 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) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(m_i == 1)) || 0 == __retres1) || 0 == E_1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((E_1 < 2 || 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 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M)) && ((((((((((((((((((((E_1 < 2 || 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 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || token < local + 2) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || __retres1 == 1) || !(t1_pc == 1)) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || token < local + 1) || !(m_i == 1)) || !(0 == t2_st)) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < token) || 0 == E_M) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < token) || token < local) || __retres1 == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == m_pc)) && (((((((((((((((((((((__retres1 == 1 || E_1 < 2) || 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) || !(0 == t2_st)) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || T2_E == 1) || local < token) || token < local) || __retres1 == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 0 < t1_pc) || 1 == m_pc)) && (((((((((((((((((((((E_1 < 2 || 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) || __retres1 == 1) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((E_1 < 2 || 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) || !(0 == t2_st)) || !(1 == m_pc)) || __retres1 == 1) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || __retres1 == 1) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || __retres1 == 1) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || 1 == t2_pc) || !(0 == t2_st)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || 1 == m_pc)) && (((((((((((((((((((((E_1 < 2 || 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) || !(0 == t2_st)) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || T2_E == 1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || __retres1 == 1) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || token < local + 2)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || T2_E == 1) || local < token) || token < local) || m_st < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == E_M) || __retres1 == 1) || 0 < t1_pc) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((E_1 < 2 || 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) || (((((t1_pc == \old(t1_pc) && ((((((((((!(t2_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && m_i == 1) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 2 <= E_1) && !(E_M == 1)) && token <= local) && t1_st == \old(t1_st)) && E_2 == \old(E_2)) && local <= token)) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) && (((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || (((((t1_pc == \old(t1_pc) && ((((((((((!(t2_pc == 1) && !(T1_E == 1)) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && m_i == 1) && 0 == t2_st) && !(T1_E == 0)) && !(M_E == 1)) && 2 <= E_1) && !(E_M == 1)) && token <= \old(token) + 1) && 2 <= E_2) && local + 1 <= token) && t1_st == \old(t1_st))) || 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) || !(0 == \old(t2_st))) || !(1 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0)) && ((((((((((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == E_M) || !(1 == t2_pc)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == E_M) || ((((((t1_pc == \old(t1_pc) && 2 <= t2_st) && token <= \old(token) + 1) && (((((((((((((!(T1_E == 1) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && m_i == 1) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && 2 <= E_1) && !(E_M == 1)) && 2 <= E_2) && local + 1 <= token) && t1_st == \old(t1_st))) || ((((((2 <= m_st && token <= \old(token) + 1) && 2 <= E_2) && t1_st == \old(t1_st)) && 0 == t2_st) && t1_pc == \old(t1_pc)) && local + 1 <= token)) || local < \old(token)) || \old(token) < local) || \old(E_2) < 2) || \old(t1_st) == 0)) && (((((((((((((((((((((E_1 < 2 || 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)) || ((((((t1_pc == \old(t1_pc) && 2 <= t2_st) && m_st == 0) && token <= local) && t1_st == \old(t1_st)) && E_2 == \old(E_2)) && local <= token)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc)) && (((((((((((((((((((((E_1 < 2 || 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))) || (((((t1_pc == \old(t1_pc) && token <= local) && m_st == 0 && 0 == t2_st) && t1_st == \old(t1_st)) && E_2 == \old(E_2)) && local <= token)) || !(m_i == 1)) || 1 == t2_pc) || !(0 == \old(t2_st))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || 0 < \old(t1_pc)) || 1 == m_pc)) && (((((((((((((((((((((E_1 < 2 || 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 == m_pc)) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == E_M) || \old(t1_st) == 0) || ((((((t1_pc == \old(t1_pc) && 2 <= t2_st) && (((((((((((((!(T1_E == 1) && 1 == t2_pc) && !(T2_E == 0)) && !(T2_E == 1)) && 2 <= m_st) && !(M_E == 0)) && m_i == 1) && t1_i == 1) && !(E_M == 0)) && !(T1_E == 0)) && !(M_E == 1)) && 1 == m_pc) && t2_i == 1) && 2 <= E_1) && !(E_M == 1)) && token <= local) && t1_st == \old(t1_st)) && E_2 == \old(E_2)) && local <= token)) || 0 < \old(t1_pc)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((E_1 < 2 || 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)) || (((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc) || 1 == m_pc) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(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)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M))) && ((((((((((((((((((((E_1 < 2 || 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 == m_pc)) || (((((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)) && ((((((\old(t1_st) < 2 || \old(token) < local + 1) || ((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || E_2 < 2) || local + 1 < \old(token)) || (((((((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)) || (((((((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))) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && 0 == t1_st) && 2 <= t2_st)) || \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 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || (((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \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 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && ((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || (((((m_st == 0 && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && 2 <= t2_st)) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 1 == m_pc) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < local + 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || local + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((((((((E_1 < 2 || 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 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc)) && (((((\old(t1_st) < 2 || \old(token) < local + 1) || (((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || !(t1_pc == 1)) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || !(1 == m_pc)) || !(1 == t1_i)) || !(1 == t2_i)) || 0 == \old(E_M)) || E_2 < 2) || local + 1 < \old(token)) || ((((2 <= m_st && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)))) && (((((((((((((((((((E_1 < 2 || 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 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || 0 < t1_pc) || 1 == m_pc)) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M))) && (((((((((((((((((((E_1 < 2 || T1_E == 0) || T2_E == 1) || local < \old(token)) || !(t1_pc == 1)) || \old(token) < local) || \old(m_st) < 2) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || !(m_i == 1)) || 1 == \old(t2_pc)) || !(1 == m_pc)) || !(1 == t1_i)) || E_2 < 2) || !(1 == t2_i)) || 0 == \old(E_M)) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((T1_E == 0 || (((((((1 == t1_pc && token == \old(token)) && token <= local) && (((((((((((!(t2_pc == 1) && !(T1_E == 1)) && \old(E_1) == E_1) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && m_st == 0) && !(T2_E == 1)) && t1_i == 1) && !(m_pc == 1)) && 0 == t2_st) && !(M_E == 1)) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && 2 <= t1_st) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || T2_E == 1) || \old(local) < \old(token)) || ((((((t1_pc == \old(t1_pc) && 2 <= t2_st) && ((((1 == t2_pc && 2 <= m_st) && 0 == t1_st) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && token <= local) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || ((((((t1_pc == \old(t1_pc) && token <= local) && (((((((((((!(t2_pc == 1) && !(T1_E == 1)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && 0 == t2_st) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || T2_E == 0) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || ((((((1 == t1_pc && token <= local) && (((((((((((!(t2_pc == 1) && !(T1_E == 1)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && 0 == t2_st) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && 0 == t1_st) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || (((((token == \old(token) && token <= local) && 2 <= t1_st) && ((2 <= t2_st && 1 == t1_pc) && ((((1 == t2_pc && \old(E_1) == E_1) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && m_st == 0) && !(m_pc == 1)) && !(E_M == 1)) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || 1 == \old(t2_pc)) || !(1 == t1_i)) || ((((2 <= E_2 && 2 <= t2_st && (1 == t1_pc && (((((((((!(T1_E == 1) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && !(0 == tmp)) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || \old(E_1) < 2) || (((((2 <= t2_st && (1 == t1_pc && ((((1 == t2_pc && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && m_st == 0) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && !(0 == tmp)) && 2 <= E_2) && 2 <= t1_st) && local + 2 <= token) && token <= local + 2)) || ((((((1 == t1_pc && token <= local + 1) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && (((((((((((!(t2_pc == 1) && !(T1_E == 1)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && 0 == t2_st) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && tmp == 1)) || \old(token) < \old(local)) || ((((token <= local + 1 && 2 <= E_2) && local + 1 <= token) && 2 <= t2_st && (1 == t1_pc && (((((((((!(T1_E == 1) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && !(0 == tmp)) && 2 <= t1_st)) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || (((((2 <= t2_st && (1 == t1_pc && (((((((((!(T1_E == 1) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && !(0 == tmp)) && 2 <= E_2) && token <= local) && 0 == t1_st) && local <= token)) || ((((((t1_pc == \old(t1_pc) && (((((((((((!(t2_pc == 1) && !(T1_E == 1)) && \old(E_1) == E_1) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && m_st == 0) && !(T2_E == 1)) && t1_i == 1) && !(m_pc == 1)) && 0 == t2_st) && !(M_E == 1)) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && token == \old(token)) && token <= local) && 0 == t1_st) && E_2 == \old(E_2)) && local <= token)) || ((((((((t1_pc == \old(t1_pc) && 2 <= t2_st) && token == \old(token)) && (((1 == t2_pc && \old(E_1) == E_1) && m_st == 0) && !(m_pc == 1)) && \old(E_M) == E_M) && token <= local) && 0 == t1_st) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || !(m_i == 1)) || !(0 == \old(t2_st))) || ((((((1 == t1_pc && token <= local) && 2 <= t1_st) && (((((((((((!(t2_pc == 1) && !(T1_E == 1)) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && 0 == t2_st) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && \old(E_M) == E_M) && !(E_M == 1)) && tmp == 1) && E_2 == \old(E_2)) && local <= token)) || ((((2 <= E_2 && 2 <= t2_st && (1 == t1_pc && (((((((((!(T1_E == 1) && 1 == t2_pc) && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && !(T2_E == 1)) && 2 <= m_st) && t1_i == 1) && !(E_2 == 1)) && !(M_E == 1)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && !(0 == tmp)) && token <= local) && 2 <= t1_st) && local <= token)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || ((((token <= local + 1 && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && (1 == t1_pc && (((((1 == t2_pc && (((!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && m_i == 1) && !(E_M == 0)) && 2 <= m_st) && 0 == t2_st) && 1 == m_pc) && !(E_M == 1)) && 2 <= E_1) && !(0 == tmp))) || 0 < \old(t1_pc)) || 1 == \old(m_pc)) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || (((((((((((\old(E_1) == E_1 && 2 <= m_st) && E_2 == \old(E_2)) && \old(E_M) == E_M) && token <= local + 2) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && t1_pc == \old(t1_pc)) && 2 <= t2_st) && 1 == m_pc) && local + 2 <= token)) || 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(m_pc))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || (((((((((((token <= local + 1 && \old(E_1) == E_1) && 2 <= m_st) && E_2 == \old(E_2)) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && t1_pc == \old(t1_pc)) && 2 <= t2_st) && local + 1 <= token) && 1 == m_pc)) || !(\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(m_pc))) || !(1 == t1_i)) || \old(E_2) < 2) || !(1 == t2_i)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || T2_E == 1) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((((((\old(E_1) == E_1 && 2 <= m_st) && token <= local) && E_2 == \old(E_2)) && \old(E_M) == E_M) && 1 == t2_pc) && token == \old(token)) && t1_st == \old(t1_st)) && t1_pc == \old(t1_pc)) && 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(m_pc))) || !(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, 49.6s OverallTime, 25 OverallIterations, 6 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 32.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6808 SDtfs, 9102 SDslu, 10211 SDs, 0 SdLazy, 6815 SolverSat, 2426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2607 GetRequests, 2421 SyntacticMatches, 37 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4229occurred 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: 3.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2831 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 15196 PreInvPairs, 15492 NumberOfFragments, 28955 HoareAnnotationTreeSize, 15196 FomulaSimplifications, 331324 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 71 FomulaSimplificationsInter, 119598 FormulaSimplificationTreeSizeReductionInter, 29.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 6916 NumberOfCodeBlocks, 6916 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 6881 ConstructedInterpolants, 0 QuantifiedInterpolants, 2165899 SizeOfPredicates, 9 NumberOfNonLiveVariables, 9883 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 35 InterpolantComputations, 23 PerfectInterpolantSequences, 4242/4471 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...