/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 14:06:25,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 14:06:25,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 14:06:25,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 14:06:25,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 14:06:25,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 14:06:25,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 14:06:25,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 14:06:25,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 14:06:25,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 14:06:25,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 14:06:25,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 14:06:25,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 14:06:25,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 14:06:25,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 14:06:25,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 14:06:25,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 14:06:25,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 14:06:25,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 14:06:25,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 14:06:25,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 14:06:25,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 14:06:25,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 14:06:25,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 14:06:25,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 14:06:25,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 14:06:25,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 14:06:25,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 14:06:25,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 14:06:25,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 14:06:25,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 14:06:25,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 14:06:25,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 14:06:25,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 14:06:25,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 14:06:25,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 14:06:25,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 14:06:25,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 14:06:25,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 14:06:25,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 14:06:25,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 14:06:25,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-07 14:06:25,851 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 14:06:25,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 14:06:25,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 14:06:25,855 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 14:06:25,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 14:06:25,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 14:06:25,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 14:06:25,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 14:06:25,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 14:06:25,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 14:06:25,857 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 14:06:25,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 14:06:25,858 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 14:06:25,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 14:06:25,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 14:06:25,858 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 14:06:25,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 14:06:25,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 14:06:25,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 14:06:25,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 14:06:25,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 14:06:25,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 14:06:25,860 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 14:06:26,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 14:06:26,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 14:06:26,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 14:06:26,184 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 14:06:26,185 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 14:06:26,185 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-07 14:06:26,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e45a1542/466392b6b21349e4b1bc0d1e5cb61509/FLAG5bc7467d1 [2020-07-07 14:06:26,741 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 14:06:26,742 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-07 14:06:26,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e45a1542/466392b6b21349e4b1bc0d1e5cb61509/FLAG5bc7467d1 [2020-07-07 14:06:27,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e45a1542/466392b6b21349e4b1bc0d1e5cb61509 [2020-07-07 14:06:27,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 14:06:27,110 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 14:06:27,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 14:06:27,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 14:06:27,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 14:06:27,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 02:06:27" (1/1) ... [2020-07-07 14:06:27,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1359070d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:06:27, skipping insertion in model container [2020-07-07 14:06:27,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 02:06:27" (1/1) ... [2020-07-07 14:06:27,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 14:06:27,181 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 14:06:27,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 14:06:27,382 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 14:06:27,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 14:06:27,446 INFO L208 MainTranslator]: Completed translation [2020-07-07 14:06:27,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:06:27 WrapperNode [2020-07-07 14:06:27,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 14:06:27,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 14:06:27,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 14:06:27,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 14:06:27,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:06:27" (1/1) ... [2020-07-07 14:06:27,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:06:27" (1/1) ... [2020-07-07 14:06:27,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:06:27" (1/1) ... [2020-07-07 14:06:27,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:06:27" (1/1) ... [2020-07-07 14:06:27,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:06:27" (1/1) ... [2020-07-07 14:06:27,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:06:27" (1/1) ... [2020-07-07 14:06:27,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:06:27" (1/1) ... [2020-07-07 14:06:27,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 14:06:27,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 14:06:27,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 14:06:27,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 14:06:27,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:06:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-07 14:06:27,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 14:06:27,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 14:06:27,637 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-07 14:06:27,637 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-07 14:06:27,637 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-07 14:06:27,637 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-07 14:06:27,638 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-07 14:06:27,638 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-07 14:06:27,638 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-07 14:06:27,639 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-07 14:06:27,639 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-07 14:06:27,640 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-07 14:06:27,640 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-07 14:06:27,641 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-07 14:06:27,641 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-07 14:06:27,641 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-07 14:06:27,641 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-07 14:06:27,641 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-07 14:06:27,642 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-07 14:06:27,642 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-07 14:06:27,643 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 14:06:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 14:06:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-07 14:06:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-07 14:06:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-07 14:06:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-07 14:06:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 14:06:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-07 14:06:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-07 14:06:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-07 14:06:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-07 14:06:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-07 14:06:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-07 14:06:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-07 14:06:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-07 14:06:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-07 14:06:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-07 14:06:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-07 14:06:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-07 14:06:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-07 14:06:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-07 14:06:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 14:06:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 14:06:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 14:06:28,206 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 14:06:28,207 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-07 14:06:28,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 02:06:28 BoogieIcfgContainer [2020-07-07 14:06:28,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 14:06:28,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 14:06:28,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 14:06:28,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 14:06:28,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 02:06:27" (1/3) ... [2020-07-07 14:06:28,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5c46ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 02:06:28, skipping insertion in model container [2020-07-07 14:06:28,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:06:27" (2/3) ... [2020-07-07 14:06:28,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5c46ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 02:06:28, skipping insertion in model container [2020-07-07 14:06:28,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 02:06:28" (3/3) ... [2020-07-07 14:06:28,223 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-07-07 14:06:28,235 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 14:06:28,243 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 14:06:28,258 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 14:06:28,281 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 14:06:28,282 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 14:06:28,282 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 14:06:28,282 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 14:06:28,282 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 14:06:28,283 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 14:06:28,283 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 14:06:28,283 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 14:06:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states. [2020-07-07 14:06:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-07-07 14:06:28,321 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:06:28,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:06:28,323 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:06:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:06:28,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1066956110, now seen corresponding path program 1 times [2020-07-07 14:06:28,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:06:28,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1198047706] [2020-07-07 14:06:28,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:06:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 14:06:28,900 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:06:28,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1198047706] [2020-07-07 14:06:28,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:06:28,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 14:06:28,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397512936] [2020-07-07 14:06:28,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 14:06:28,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:06:28,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 14:06:28,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-07 14:06:28,929 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 7 states. [2020-07-07 14:06:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:06:31,279 INFO L93 Difference]: Finished difference Result 774 states and 1050 transitions. [2020-07-07 14:06:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 14:06:31,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2020-07-07 14:06:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:06:31,320 INFO L225 Difference]: With dead ends: 774 [2020-07-07 14:06:31,321 INFO L226 Difference]: Without dead ends: 573 [2020-07-07 14:06:31,333 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-07-07 14:06:31,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-07-07 14:06:31,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 419. [2020-07-07 14:06:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-07-07 14:06:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 521 transitions. [2020-07-07 14:06:31,515 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 521 transitions. Word has length 107 [2020-07-07 14:06:31,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:06:31,516 INFO L479 AbstractCegarLoop]: Abstraction has 419 states and 521 transitions. [2020-07-07 14:06:31,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 14:06:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 521 transitions. [2020-07-07 14:06:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-07-07 14:06:31,545 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:06:31,549 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:06:31,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 14:06:31,549 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:06:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:06:31,550 INFO L82 PathProgramCache]: Analyzing trace with hash -517401199, now seen corresponding path program 1 times [2020-07-07 14:06:31,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:06:31,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [414342349] [2020-07-07 14:06:31,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:06:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:31,977 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-07 14:06:31,977 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:06:31,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [414342349] [2020-07-07 14:06:31,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:06:31,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 14:06:31,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871628261] [2020-07-07 14:06:31,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 14:06:31,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:06:31,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 14:06:31,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-07 14:06:31,981 INFO L87 Difference]: Start difference. First operand 419 states and 521 transitions. Second operand 9 states. [2020-07-07 14:06:35,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:06:35,124 INFO L93 Difference]: Finished difference Result 1504 states and 2005 transitions. [2020-07-07 14:06:35,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-07 14:06:35,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2020-07-07 14:06:35,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:06:35,136 INFO L225 Difference]: With dead ends: 1504 [2020-07-07 14:06:35,136 INFO L226 Difference]: Without dead ends: 1125 [2020-07-07 14:06:35,141 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2020-07-07 14:06:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2020-07-07 14:06:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 835. [2020-07-07 14:06:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2020-07-07 14:06:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1076 transitions. [2020-07-07 14:06:35,279 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1076 transitions. Word has length 170 [2020-07-07 14:06:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:06:35,280 INFO L479 AbstractCegarLoop]: Abstraction has 835 states and 1076 transitions. [2020-07-07 14:06:35,281 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 14:06:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1076 transitions. [2020-07-07 14:06:35,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-07-07 14:06:35,291 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:06:35,292 INFO L422 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:06:35,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 14:06:35,292 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:06:35,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:06:35,293 INFO L82 PathProgramCache]: Analyzing trace with hash 878280969, now seen corresponding path program 1 times [2020-07-07 14:06:35,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:06:35,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [887096057] [2020-07-07 14:06:35,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:06:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-07-07 14:06:35,650 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:06:35,651 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [887096057] [2020-07-07 14:06:35,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:06:35,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 14:06:35,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406437367] [2020-07-07 14:06:35,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 14:06:35,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:06:35,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 14:06:35,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 14:06:35,654 INFO L87 Difference]: Start difference. First operand 835 states and 1076 transitions. Second operand 10 states. [2020-07-07 14:06:37,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:06:37,450 INFO L93 Difference]: Finished difference Result 1955 states and 2544 transitions. [2020-07-07 14:06:37,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 14:06:37,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 283 [2020-07-07 14:06:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:06:37,462 INFO L225 Difference]: With dead ends: 1955 [2020-07-07 14:06:37,462 INFO L226 Difference]: Without dead ends: 1158 [2020-07-07 14:06:37,467 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2020-07-07 14:06:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2020-07-07 14:06:37,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 826. [2020-07-07 14:06:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2020-07-07 14:06:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1061 transitions. [2020-07-07 14:06:37,596 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1061 transitions. Word has length 283 [2020-07-07 14:06:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:06:37,597 INFO L479 AbstractCegarLoop]: Abstraction has 826 states and 1061 transitions. [2020-07-07 14:06:37,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 14:06:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1061 transitions. [2020-07-07 14:06:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-07-07 14:06:37,604 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:06:37,605 INFO L422 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:06:37,605 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 14:06:37,605 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:06:37,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:06:37,606 INFO L82 PathProgramCache]: Analyzing trace with hash 214480794, now seen corresponding path program 1 times [2020-07-07 14:06:37,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:06:37,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1379542028] [2020-07-07 14:06:37,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:06:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-07 14:06:37,967 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:06:37,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1379542028] [2020-07-07 14:06:37,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:06:37,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 14:06:37,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591495789] [2020-07-07 14:06:37,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 14:06:37,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:06:37,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 14:06:37,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-07-07 14:06:37,970 INFO L87 Difference]: Start difference. First operand 826 states and 1061 transitions. Second operand 12 states. [2020-07-07 14:06:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:06:40,340 INFO L93 Difference]: Finished difference Result 1962 states and 2598 transitions. [2020-07-07 14:06:40,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-07 14:06:40,340 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 220 [2020-07-07 14:06:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:06:40,351 INFO L225 Difference]: With dead ends: 1962 [2020-07-07 14:06:40,351 INFO L226 Difference]: Without dead ends: 941 [2020-07-07 14:06:40,359 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2020-07-07 14:06:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2020-07-07 14:06:40,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 679. [2020-07-07 14:06:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2020-07-07 14:06:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 841 transitions. [2020-07-07 14:06:40,459 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 841 transitions. Word has length 220 [2020-07-07 14:06:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:06:40,461 INFO L479 AbstractCegarLoop]: Abstraction has 679 states and 841 transitions. [2020-07-07 14:06:40,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 14:06:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 841 transitions. [2020-07-07 14:06:40,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-07-07 14:06:40,467 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:06:40,468 INFO L422 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:06:40,468 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 14:06:40,468 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:06:40,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:06:40,469 INFO L82 PathProgramCache]: Analyzing trace with hash 144736441, now seen corresponding path program 2 times [2020-07-07 14:06:40,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:06:40,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1303438546] [2020-07-07 14:06:40,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:06:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 14:06:40,798 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:06:40,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1303438546] [2020-07-07 14:06:40,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:06:40,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 14:06:40,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691187131] [2020-07-07 14:06:40,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 14:06:40,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:06:40,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 14:06:40,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 14:06:40,802 INFO L87 Difference]: Start difference. First operand 679 states and 841 transitions. Second operand 10 states. [2020-07-07 14:06:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:06:43,839 INFO L93 Difference]: Finished difference Result 2297 states and 3039 transitions. [2020-07-07 14:06:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-07 14:06:43,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 219 [2020-07-07 14:06:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:06:43,857 INFO L225 Difference]: With dead ends: 2297 [2020-07-07 14:06:43,857 INFO L226 Difference]: Without dead ends: 1656 [2020-07-07 14:06:43,865 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2020-07-07 14:06:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2020-07-07 14:06:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1256. [2020-07-07 14:06:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2020-07-07 14:06:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1532 transitions. [2020-07-07 14:06:44,141 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1532 transitions. Word has length 219 [2020-07-07 14:06:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:06:44,142 INFO L479 AbstractCegarLoop]: Abstraction has 1256 states and 1532 transitions. [2020-07-07 14:06:44,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 14:06:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1532 transitions. [2020-07-07 14:06:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-07-07 14:06:44,154 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:06:44,154 INFO L422 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, 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] [2020-07-07 14:06:44,155 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 14:06:44,155 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:06:44,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:06:44,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2140706519, now seen corresponding path program 1 times [2020-07-07 14:06:44,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:06:44,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1896629747] [2020-07-07 14:06:44,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:06:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 14:06:44,541 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:06:44,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1896629747] [2020-07-07 14:06:44,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:06:44,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 14:06:44,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216661195] [2020-07-07 14:06:44,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 14:06:44,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:06:44,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 14:06:44,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-07 14:06:44,546 INFO L87 Difference]: Start difference. First operand 1256 states and 1532 transitions. Second operand 9 states. [2020-07-07 14:06:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:06:46,814 INFO L93 Difference]: Finished difference Result 2884 states and 3650 transitions. [2020-07-07 14:06:46,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-07 14:06:46,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 248 [2020-07-07 14:06:46,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:06:46,828 INFO L225 Difference]: With dead ends: 2884 [2020-07-07 14:06:46,828 INFO L226 Difference]: Without dead ends: 1667 [2020-07-07 14:06:46,835 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2020-07-07 14:06:46,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2020-07-07 14:06:47,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1256. [2020-07-07 14:06:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2020-07-07 14:06:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1520 transitions. [2020-07-07 14:06:47,027 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1520 transitions. Word has length 248 [2020-07-07 14:06:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:06:47,028 INFO L479 AbstractCegarLoop]: Abstraction has 1256 states and 1520 transitions. [2020-07-07 14:06:47,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 14:06:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1520 transitions. [2020-07-07 14:06:47,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-07-07 14:06:47,034 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:06:47,034 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-07 14:06:47,035 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 14:06:47,035 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:06:47,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:06:47,035 INFO L82 PathProgramCache]: Analyzing trace with hash -469744976, now seen corresponding path program 1 times [2020-07-07 14:06:47,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:06:47,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [175852106] [2020-07-07 14:06:47,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:06:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 14:06:47,391 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:06:47,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [175852106] [2020-07-07 14:06:47,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:06:47,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 14:06:47,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077781147] [2020-07-07 14:06:47,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 14:06:47,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:06:47,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 14:06:47,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 14:06:47,394 INFO L87 Difference]: Start difference. First operand 1256 states and 1520 transitions. Second operand 10 states. [2020-07-07 14:06:50,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:06:50,528 INFO L93 Difference]: Finished difference Result 4318 states and 5461 transitions. [2020-07-07 14:06:50,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-07 14:06:50,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 248 [2020-07-07 14:06:50,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:06:50,557 INFO L225 Difference]: With dead ends: 4318 [2020-07-07 14:06:50,557 INFO L226 Difference]: Without dead ends: 3101 [2020-07-07 14:06:50,566 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=816, Unknown=0, NotChecked=0, Total=1056 [2020-07-07 14:06:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2020-07-07 14:06:50,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 2364. [2020-07-07 14:06:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2020-07-07 14:06:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 2885 transitions. [2020-07-07 14:06:50,975 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 2885 transitions. Word has length 248 [2020-07-07 14:06:50,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:06:50,976 INFO L479 AbstractCegarLoop]: Abstraction has 2364 states and 2885 transitions. [2020-07-07 14:06:50,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 14:06:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 2885 transitions. [2020-07-07 14:06:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-07-07 14:06:50,985 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:06:50,985 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2020-07-07 14:06:50,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 14:06:50,985 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:06:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:06:50,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1876608160, now seen corresponding path program 1 times [2020-07-07 14:06:50,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:06:50,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [532456525] [2020-07-07 14:06:50,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:06:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 14:06:51,288 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:06:51,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [532456525] [2020-07-07 14:06:51,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:06:51,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-07 14:06:51,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480063751] [2020-07-07 14:06:51,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 14:06:51,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:06:51,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 14:06:51,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-07 14:06:51,291 INFO L87 Difference]: Start difference. First operand 2364 states and 2885 transitions. Second operand 14 states. [2020-07-07 14:06:55,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:06:55,280 INFO L93 Difference]: Finished difference Result 5265 states and 6747 transitions. [2020-07-07 14:06:55,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-07 14:06:55,281 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 254 [2020-07-07 14:06:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:06:55,301 INFO L225 Difference]: With dead ends: 5265 [2020-07-07 14:06:55,301 INFO L226 Difference]: Without dead ends: 2941 [2020-07-07 14:06:55,312 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=442, Invalid=1628, Unknown=0, NotChecked=0, Total=2070 [2020-07-07 14:06:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-07-07 14:06:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2370. [2020-07-07 14:06:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2020-07-07 14:06:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 2841 transitions. [2020-07-07 14:06:55,722 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 2841 transitions. Word has length 254 [2020-07-07 14:06:55,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:06:55,723 INFO L479 AbstractCegarLoop]: Abstraction has 2370 states and 2841 transitions. [2020-07-07 14:06:55,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 14:06:55,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 2841 transitions. [2020-07-07 14:06:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-07-07 14:06:55,732 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:06:55,733 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2020-07-07 14:06:55,733 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 14:06:55,733 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:06:55,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:06:55,734 INFO L82 PathProgramCache]: Analyzing trace with hash 405313859, now seen corresponding path program 1 times [2020-07-07 14:06:55,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:06:55,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2047892987] [2020-07-07 14:06:55,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:06:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:06:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 14:06:56,151 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:06:56,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2047892987] [2020-07-07 14:06:56,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:06:56,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 14:06:56,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664157483] [2020-07-07 14:06:56,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 14:06:56,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:06:56,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 14:06:56,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-07-07 14:06:56,158 INFO L87 Difference]: Start difference. First operand 2370 states and 2841 transitions. Second operand 12 states. [2020-07-07 14:07:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:07:01,308 INFO L93 Difference]: Finished difference Result 7778 states and 9559 transitions. [2020-07-07 14:07:01,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-07-07 14:07:01,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 254 [2020-07-07 14:07:01,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:07:01,356 INFO L225 Difference]: With dead ends: 7778 [2020-07-07 14:07:01,357 INFO L226 Difference]: Without dead ends: 5452 [2020-07-07 14:07:01,371 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=332, Invalid=1308, Unknown=0, NotChecked=0, Total=1640 [2020-07-07 14:07:01,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2020-07-07 14:07:02,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4339. [2020-07-07 14:07:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4339 states. [2020-07-07 14:07:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 5251 transitions. [2020-07-07 14:07:02,799 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 5251 transitions. Word has length 254 [2020-07-07 14:07:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:07:02,804 INFO L479 AbstractCegarLoop]: Abstraction has 4339 states and 5251 transitions. [2020-07-07 14:07:02,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 14:07:02,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 5251 transitions. [2020-07-07 14:07:02,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2020-07-07 14:07:02,821 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:07:02,822 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:07:02,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 14:07:02,822 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:07:02,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:07:02,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1642237702, now seen corresponding path program 1 times [2020-07-07 14:07:02,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:07:02,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [634871828] [2020-07-07 14:07:02,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:07:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-07 14:07:03,230 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:07:03,232 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [634871828] [2020-07-07 14:07:03,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:07:03,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 14:07:03,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055632058] [2020-07-07 14:07:03,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 14:07:03,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:07:03,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 14:07:03,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-07 14:07:03,235 INFO L87 Difference]: Start difference. First operand 4339 states and 5251 transitions. Second operand 10 states. [2020-07-07 14:07:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:07:07,321 INFO L93 Difference]: Finished difference Result 9119 states and 11220 transitions. [2020-07-07 14:07:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-07 14:07:07,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 270 [2020-07-07 14:07:07,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:07:07,351 INFO L225 Difference]: With dead ends: 9119 [2020-07-07 14:07:07,352 INFO L226 Difference]: Without dead ends: 5371 [2020-07-07 14:07:07,367 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2020-07-07 14:07:07,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5371 states. [2020-07-07 14:07:08,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5371 to 4359. [2020-07-07 14:07:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4359 states. [2020-07-07 14:07:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 5213 transitions. [2020-07-07 14:07:08,109 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 5213 transitions. Word has length 270 [2020-07-07 14:07:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:07:08,110 INFO L479 AbstractCegarLoop]: Abstraction has 4359 states and 5213 transitions. [2020-07-07 14:07:08,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 14:07:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 5213 transitions. [2020-07-07 14:07:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2020-07-07 14:07:08,120 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:07:08,120 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:07:08,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 14:07:08,121 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:07:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:07:08,121 INFO L82 PathProgramCache]: Analyzing trace with hash -957347782, now seen corresponding path program 1 times [2020-07-07 14:07:08,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:07:08,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1846174607] [2020-07-07 14:07:08,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:07:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:08,545 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-07 14:07:08,545 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:07:08,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1846174607] [2020-07-07 14:07:08,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:07:08,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 14:07:08,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397900117] [2020-07-07 14:07:08,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 14:07:08,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:07:08,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 14:07:08,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-07 14:07:08,547 INFO L87 Difference]: Start difference. First operand 4359 states and 5213 transitions. Second operand 10 states. [2020-07-07 14:07:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:07:10,613 INFO L93 Difference]: Finished difference Result 8953 states and 10781 transitions. [2020-07-07 14:07:10,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 14:07:10,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 270 [2020-07-07 14:07:10,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:07:10,640 INFO L225 Difference]: With dead ends: 8953 [2020-07-07 14:07:10,640 INFO L226 Difference]: Without dead ends: 4631 [2020-07-07 14:07:10,654 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2020-07-07 14:07:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2020-07-07 14:07:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 3789. [2020-07-07 14:07:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3789 states. [2020-07-07 14:07:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3789 states to 3789 states and 4529 transitions. [2020-07-07 14:07:11,163 INFO L78 Accepts]: Start accepts. Automaton has 3789 states and 4529 transitions. Word has length 270 [2020-07-07 14:07:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:07:11,164 INFO L479 AbstractCegarLoop]: Abstraction has 3789 states and 4529 transitions. [2020-07-07 14:07:11,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 14:07:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3789 states and 4529 transitions. [2020-07-07 14:07:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2020-07-07 14:07:11,173 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:07:11,174 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:07:11,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 14:07:11,174 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:07:11,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:07:11,175 INFO L82 PathProgramCache]: Analyzing trace with hash 353572077, now seen corresponding path program 1 times [2020-07-07 14:07:11,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:07:11,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1226973547] [2020-07-07 14:07:11,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:07:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-07 14:07:11,621 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:07:11,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1226973547] [2020-07-07 14:07:11,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:07:11,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 14:07:11,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706880131] [2020-07-07 14:07:11,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 14:07:11,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:07:11,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 14:07:11,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-07 14:07:11,625 INFO L87 Difference]: Start difference. First operand 3789 states and 4529 transitions. Second operand 12 states. [2020-07-07 14:07:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:07:13,816 INFO L93 Difference]: Finished difference Result 7142 states and 8522 transitions. [2020-07-07 14:07:13,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-07 14:07:13,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 275 [2020-07-07 14:07:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:07:13,832 INFO L225 Difference]: With dead ends: 7142 [2020-07-07 14:07:13,833 INFO L226 Difference]: Without dead ends: 3391 [2020-07-07 14:07:13,846 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2020-07-07 14:07:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2020-07-07 14:07:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 2619. [2020-07-07 14:07:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2619 states. [2020-07-07 14:07:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 3026 transitions. [2020-07-07 14:07:14,297 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 3026 transitions. Word has length 275 [2020-07-07 14:07:14,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:07:14,297 INFO L479 AbstractCegarLoop]: Abstraction has 2619 states and 3026 transitions. [2020-07-07 14:07:14,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 14:07:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3026 transitions. [2020-07-07 14:07:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2020-07-07 14:07:14,301 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:07:14,302 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:07:14,302 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 14:07:14,302 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:07:14,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:07:14,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1238866457, now seen corresponding path program 1 times [2020-07-07 14:07:14,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:07:14,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1816611245] [2020-07-07 14:07:14,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:07:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-07 14:07:14,714 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:07:14,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1816611245] [2020-07-07 14:07:14,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:07:14,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-07 14:07:14,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750479094] [2020-07-07 14:07:14,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 14:07:14,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:07:14,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 14:07:14,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-07-07 14:07:14,717 INFO L87 Difference]: Start difference. First operand 2619 states and 3026 transitions. Second operand 14 states. [2020-07-07 14:07:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:07:17,510 INFO L93 Difference]: Finished difference Result 5701 states and 6843 transitions. [2020-07-07 14:07:17,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-07-07 14:07:17,511 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 284 [2020-07-07 14:07:17,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:07:17,526 INFO L225 Difference]: With dead ends: 5701 [2020-07-07 14:07:17,526 INFO L226 Difference]: Without dead ends: 3163 [2020-07-07 14:07:17,538 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=352, Invalid=1130, Unknown=0, NotChecked=0, Total=1482 [2020-07-07 14:07:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2020-07-07 14:07:17,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2562. [2020-07-07 14:07:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2562 states. [2020-07-07 14:07:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 2887 transitions. [2020-07-07 14:07:17,926 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 2887 transitions. Word has length 284 [2020-07-07 14:07:17,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:07:17,927 INFO L479 AbstractCegarLoop]: Abstraction has 2562 states and 2887 transitions. [2020-07-07 14:07:17,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 14:07:17,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 2887 transitions. [2020-07-07 14:07:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-07 14:07:17,931 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:07:17,931 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:07:17,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 14:07:17,932 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:07:17,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:07:17,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1211508846, now seen corresponding path program 1 times [2020-07-07 14:07:17,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:07:17,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1115394406] [2020-07-07 14:07:17,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:07:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-07 14:07:18,313 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:07:18,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1115394406] [2020-07-07 14:07:18,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:07:18,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 14:07:18,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415891028] [2020-07-07 14:07:18,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 14:07:18,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:07:18,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 14:07:18,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-07-07 14:07:18,316 INFO L87 Difference]: Start difference. First operand 2562 states and 2887 transitions. Second operand 13 states. [2020-07-07 14:07:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:07:20,002 INFO L93 Difference]: Finished difference Result 3787 states and 4293 transitions. [2020-07-07 14:07:20,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 14:07:20,003 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 286 [2020-07-07 14:07:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:07:20,008 INFO L225 Difference]: With dead ends: 3787 [2020-07-07 14:07:20,009 INFO L226 Difference]: Without dead ends: 1308 [2020-07-07 14:07:20,015 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2020-07-07 14:07:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2020-07-07 14:07:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1120. [2020-07-07 14:07:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2020-07-07 14:07:20,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1240 transitions. [2020-07-07 14:07:20,242 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1240 transitions. Word has length 286 [2020-07-07 14:07:20,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:07:20,243 INFO L479 AbstractCegarLoop]: Abstraction has 1120 states and 1240 transitions. [2020-07-07 14:07:20,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 14:07:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1240 transitions. [2020-07-07 14:07:20,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2020-07-07 14:07:20,248 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:07:20,249 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:07:20,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-07 14:07:20,250 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:07:20,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:07:20,250 INFO L82 PathProgramCache]: Analyzing trace with hash -537431486, now seen corresponding path program 1 times [2020-07-07 14:07:20,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:07:20,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [546658745] [2020-07-07 14:07:20,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:07:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:07:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-07 14:07:20,788 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:07:20,789 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [546658745] [2020-07-07 14:07:20,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:07:20,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-07 14:07:20,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398376658] [2020-07-07 14:07:20,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 14:07:20,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:07:20,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 14:07:20,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-07-07 14:07:20,791 INFO L87 Difference]: Start difference. First operand 1120 states and 1240 transitions. Second operand 14 states. [2020-07-07 14:07:23,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:07:23,726 INFO L93 Difference]: Finished difference Result 1600 states and 1784 transitions. [2020-07-07 14:07:23,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-07 14:07:23,727 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 421 [2020-07-07 14:07:23,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:07:23,729 INFO L225 Difference]: With dead ends: 1600 [2020-07-07 14:07:23,729 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 14:07:23,732 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=295, Invalid=761, Unknown=0, NotChecked=0, Total=1056 [2020-07-07 14:07:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 14:07:23,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 14:07:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 14:07:23,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 14:07:23,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 421 [2020-07-07 14:07:23,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:07:23,734 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 14:07:23,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 14:07:23,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 14:07:23,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 14:07:23,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-07 14:07:23,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 14:07:24,034 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2020-07-07 14:07:24,181 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2020-07-07 14:07:24,396 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2020-07-07 14:07:24,521 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2020-07-07 14:07:25,132 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 83 [2020-07-07 14:07:26,498 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2020-07-07 14:07:27,768 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2020-07-07 14:07:27,905 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2020-07-07 14:07:28,090 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2020-07-07 14:07:28,225 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2020-07-07 14:07:30,291 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 140 [2020-07-07 14:07:30,456 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 140 [2020-07-07 14:07:31,565 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2020-07-07 14:07:31,733 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2020-07-07 14:07:31,976 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2020-07-07 14:07:32,145 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2020-07-07 14:07:34,652 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2020-07-07 14:07:34,822 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2020-07-07 14:07:38,333 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2020-07-07 14:07:40,400 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2020-07-07 14:07:40,549 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2020-07-07 14:07:41,990 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2020-07-07 14:07:42,129 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2020-07-07 14:07:42,313 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2020-07-07 14:07:42,449 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2020-07-07 14:07:45,280 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2020-07-07 14:07:45,432 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2020-07-07 14:07:46,895 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 46 [2020-07-07 14:07:47,201 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2020-07-07 14:07:47,926 WARN L193 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2020-07-07 14:07:48,352 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 61 [2020-07-07 14:07:48,554 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2020-07-07 14:07:49,010 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 59 [2020-07-07 14:07:50,140 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-07-07 14:07:51,195 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-07-07 14:07:51,414 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2020-07-07 14:07:51,813 WARN L193 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2020-07-07 14:07:52,274 WARN L193 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2020-07-07 14:07:52,676 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2020-07-07 14:07:53,470 WARN L193 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 46 [2020-07-07 14:07:54,030 WARN L193 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 65 [2020-07-07 14:07:54,392 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2020-07-07 14:07:54,685 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2020-07-07 14:07:55,015 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2020-07-07 14:07:55,277 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-07 14:07:55,440 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-07 14:07:55,938 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2020-07-07 14:07:56,349 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 59 [2020-07-07 14:07:57,258 WARN L193 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 46 [2020-07-07 14:07:58,413 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 146 DAG size of output: 73 [2020-07-07 14:07:58,754 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2020-07-07 14:07:59,432 WARN L193 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 67 [2020-07-07 14:08:00,554 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 146 DAG size of output: 73 [2020-07-07 14:08:01,667 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-07-07 14:08:02,229 WARN L193 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2020-07-07 14:08:03,366 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 148 DAG size of output: 73 [2020-07-07 14:08:03,871 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2020-07-07 14:08:04,297 WARN L193 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2020-07-07 14:08:05,217 WARN L193 SmtUtils]: Spent 916.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 92 [2020-07-07 14:08:05,682 WARN L193 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2020-07-07 14:08:06,008 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-07 14:08:06,339 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2020-07-07 14:08:06,554 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2020-07-07 14:08:06,719 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-07 14:08:06,947 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-07 14:08:07,113 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-07 14:08:07,531 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-07 14:08:08,107 WARN L193 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 67 [2020-07-07 14:08:08,396 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 [2020-07-07 14:08:08,913 WARN L193 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 45 [2020-07-07 14:08:09,922 WARN L193 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 73 [2020-07-07 14:08:10,062 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2020-07-07 14:08:10,903 WARN L193 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2020-07-07 14:08:11,125 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-07 14:08:11,398 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 [2020-07-07 14:08:11,772 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2020-07-07 14:08:12,322 WARN L193 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 63 [2020-07-07 14:08:13,633 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2020-07-07 14:08:14,050 WARN L193 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2020-07-07 14:08:14,657 WARN L193 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2020-07-07 14:08:14,972 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 [2020-07-07 14:08:15,205 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2020-07-07 14:08:15,566 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2020-07-07 14:08:16,677 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 116 DAG size of output: 95 [2020-07-07 14:08:16,977 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2020-07-07 14:08:18,225 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2020-07-07 14:08:18,771 WARN L193 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 45 [2020-07-07 14:08:19,207 WARN L193 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 54 [2020-07-07 14:08:19,944 WARN L193 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 71 [2020-07-07 14:08:20,169 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2020-07-07 14:08:20,338 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-07 14:08:20,939 WARN L193 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 61 [2020-07-07 14:08:21,136 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2020-07-07 14:08:21,411 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2020-07-07 14:08:22,098 WARN L193 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 63 [2020-07-07 14:08:22,645 WARN L193 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2020-07-07 14:08:22,980 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2020-07-07 14:08:23,278 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2020-07-07 14:08:23,657 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2020-07-07 14:08:24,840 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2020-07-07 14:08:25,193 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2020-07-07 14:08:26,414 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 141 DAG size of output: 80 [2020-07-07 14:08:27,154 WARN L193 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 73 [2020-07-07 14:08:27,724 WARN L193 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 45 [2020-07-07 14:08:28,312 WARN L193 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2020-07-07 14:08:28,587 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2020-07-07 14:08:28,956 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2020-07-07 14:08:29,365 WARN L193 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2020-07-07 14:08:29,847 WARN L193 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 59 [2020-07-07 14:08:30,328 WARN L193 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 59 [2020-07-07 14:08:31,032 WARN L193 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2020-07-07 14:08:31,384 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 59 [2020-07-07 14:08:31,692 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2020-07-07 14:08:31,991 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2020-07-07 14:08:32,163 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-07 14:08:32,760 WARN L193 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2020-07-07 14:08:33,820 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 139 DAG size of output: 75 [2020-07-07 14:08:33,964 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2020-07-07 14:08:34,679 WARN L193 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 79 [2020-07-07 14:08:35,290 WARN L193 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 63 [2020-07-07 14:08:35,568 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2020-07-07 14:08:35,892 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2020-07-07 14:08:35,998 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-07-07 14:08:36,240 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2020-07-07 14:08:37,044 WARN L193 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 41 [2020-07-07 14:08:37,578 WARN L193 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 59 [2020-07-07 14:08:37,927 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2020-07-07 14:08:38,329 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2020-07-07 14:08:38,492 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 34 [2020-07-07 14:08:38,782 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2020-07-07 14:08:39,306 WARN L193 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 43 [2020-07-07 14:08:39,472 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 36 [2020-07-07 14:08:39,789 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2020-07-07 14:08:40,003 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-07 14:08:40,692 WARN L193 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 71 [2020-07-07 14:08:41,550 WARN L193 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 46 [2020-07-07 14:08:41,726 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-07 14:08:41,837 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-07-07 14:08:42,099 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2020-07-07 14:08:42,371 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2020-07-07 14:08:43,654 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 141 DAG size of output: 80 [2020-07-07 14:08:44,372 WARN L193 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2020-07-07 14:08:45,097 WARN L193 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2020-07-07 14:08:45,477 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 46 [2020-07-07 14:08:46,688 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2020-07-07 14:08:47,411 WARN L193 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2020-07-07 14:08:48,694 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 146 DAG size of output: 73 [2020-07-07 14:08:49,071 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2020-07-07 14:08:49,278 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-07 14:08:49,441 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 38 [2020-07-07 14:08:49,842 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2020-07-07 14:08:50,101 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-07 14:08:50,457 WARN L193 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2020-07-07 14:08:50,926 WARN L193 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2020-07-07 14:08:51,103 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-07-07 14:08:51,792 WARN L193 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 41 [2020-07-07 14:08:52,009 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2020-07-07 14:08:52,229 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2020-07-07 14:08:52,680 WARN L193 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 46 [2020-07-07 14:08:53,281 WARN L193 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 65 [2020-07-07 14:08:53,759 WARN L193 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2020-07-07 14:08:54,376 WARN L193 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2020-07-07 14:08:54,726 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2020-07-07 14:08:55,048 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 50 [2020-07-07 14:08:55,054 INFO L264 CegarLoopResult]: At program point immediate_notifyEXIT(lines 326 336) the Hoare annotation is: (let ((.cse12 (= 1 ~m_pc~0)) (.cse14 (= 1 ~m_i~0)) (.cse13 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse13)) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (and (not .cse12) .cse14 (<= 2 ~m_st~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (= 1 ~E_M~0)) (.cse4 (= 0 ~t1_st~0)) (.cse8 (= 0 |old(~t1_st~0)|)) (.cse5 (= 0 ~E_M~0)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (not .cse14))) (and (or (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0)) .cse0 .cse1 .cse2 .cse3 (not (<= 2 |old(~t1_st~0)|)) .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ ~local~0 1))) (or (not (<= 2 ~E_1~0)) (= 0 ~m_st~0) .cse0 .cse1 .cse8 (not .cse3) (not (<= .cse9 ~token~0)) .cse10 (not (<= ~token~0 .cse9)) .cse7 .cse11)) (or .cse12 .cse10 .cse7 .cse11) (or .cse0 .cse2 .cse3 (and (= 1 ~m_st~0) .cse4) (not (= 1 |old(~m_st~0)|)) (not .cse8) .cse13 .cse12 .cse5 .cse6 .cse7)))) [2020-07-07 14:08:55,054 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse12 (= 1 ~t1_pc~0))) (let ((.cse0 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse5 (not .cse12)) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (= 1 ~t1_i~0))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (= 1 ~E_M~0)) (.cse10 (= 0 |old(~t1_st~0)|)) (.cse1 (= 1 ~m_pc~0)) (.cse8 (= 0 ~E_M~0)) (.cse9 (not (<= ~local~0 ~token~0))) (.cse3 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 (not (<= 2 |old(~t1_st~0)|)) .cse8 .cse9 .cse3) (let ((.cse11 (+ ~local~0 1))) (or .cse0 (not (<= 2 ~E_1~0)) .cse4 .cse5 .cse10 (not .cse7) (not (<= .cse11 ~token~0)) .cse2 (not (<= ~token~0 .cse11)) .cse3)) (or .cse4 .cse6 .cse7 (and (= 1 ~m_st~0) (= 0 ~t1_st~0)) (not (= 1 |old(~m_st~0)|)) (not .cse10) .cse12 .cse1 .cse8 .cse9 .cse3)))) [2020-07-07 14:08:55,054 INFO L264 CegarLoopResult]: At program point immediate_notifyFINAL(lines 326 336) the Hoare annotation is: (let ((.cse12 (= 1 ~m_pc~0)) (.cse14 (= 1 ~m_i~0)) (.cse13 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse13)) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (and (not .cse12) .cse14 (<= 2 ~m_st~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (= 1 ~E_M~0)) (.cse4 (= 0 ~t1_st~0)) (.cse8 (= 0 |old(~t1_st~0)|)) (.cse5 (= 0 ~E_M~0)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (not .cse14))) (and (or (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0)) .cse0 .cse1 .cse2 .cse3 (not (<= 2 |old(~t1_st~0)|)) .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ ~local~0 1))) (or (not (<= 2 ~E_1~0)) (= 0 ~m_st~0) .cse0 .cse1 .cse8 (not .cse3) (not (<= .cse9 ~token~0)) .cse10 (not (<= ~token~0 .cse9)) .cse7 .cse11)) (or .cse12 .cse10 .cse7 .cse11) (or .cse0 .cse2 .cse3 (and (= 1 ~m_st~0) .cse4) (not (= 1 |old(~m_st~0)|)) (not .cse8) .cse13 .cse12 .cse5 .cse6 .cse7)))) [2020-07-07 14:08:55,055 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse9 (= 1 ~m_pc~0)) (.cse17 (= 1 ~m_i~0))) (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (= 0 |old(~t1_st~0)|)) (.cse13 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (= 0 |old(~E_M~0)|)) (.cse8 (= 1 |old(~t1_pc~0)|)) (.cse15 (not (<= |old(~token~0)| ~local~0))) (.cse11 (= 1 |old(~E_M~0)|)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not .cse17)) (.cse16 (and (not .cse9) .cse17 (<= 2 ~m_st~0)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= |old(~token~0)| ~token~0)) (not (= 0 |old(~m_st~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 (let ((.cse12 (+ ~local~0 1))) (and (= 0 ~m_st~0) (not (= 0 ~E_M~0)) (not (= 1 ~E_M~0)) (<= ~token~0 .cse12) (<= .cse12 ~token~0) (= 1 ~t1_pc~0))) .cse6 .cse13 .cse7 .cse14 (not .cse8) .cse10 .cse15 .cse11 .cse16) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 (<= ~local~0 ~token~0)) .cse6 .cse13 .cse7 .cse8 .cse14 .cse10 .cse15 .cse16 .cse11) (or .cse9 .cse14 .cse10 .cse16)))) [2020-07-07 14:08:55,055 INFO L264 CegarLoopResult]: At program point L81(lines 81 85) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse7 (not (= 0 ~t1_pc~0))) (.cse2 (= 0 |old(~t1_st~0)|)) (.cse8 (= 0 |old(~E_M~0)|)) (.cse11 (= 1 |old(~E_M~0)|)) (.cse3 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse4 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (= |old(~token~0)| ~token~0)) (.cse13 (= 1 ~m_pc~0)) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 (not (<= ~local~0 |old(~token~0)|)) (and .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0) .cse7) .cse8 .cse9 .cse10 (not (<= |old(~token~0)| ~local~0)) .cse11) (or .cse0 .cse1 (not (= 0 |old(~m_st~0)|)) (and .cse3 .cse4 .cse5 .cse6 .cse12 .cse7) .cse2 .cse8 (= 1 |old(~t1_pc~0)|) .cse13 .cse10 .cse11) (or (and .cse3 .cse4 .cse5 .cse6 .cse12) .cse13 .cse9 .cse10))) [2020-07-07 14:08:55,056 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse3 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse4 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (= 0 |old(~t1_st~0)|)) (.cse7 (= 0 |old(~E_M~0)|)) (.cse10 (= 1 |old(~E_M~0)|)) (.cse11 (and .cse3 .cse4 .cse5 .cse6 (= |old(~token~0)| ~token~0))) (.cse12 (= 1 ~m_pc~0)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0)) (not (<= ~local~0 |old(~token~0)|)) .cse7 .cse8 .cse9 (not (<= |old(~token~0)| ~local~0)) .cse10) (or .cse0 .cse1 (not (= 0 |old(~m_st~0)|)) .cse11 .cse2 .cse7 (= 1 |old(~t1_pc~0)|) .cse12 .cse9 .cse10) (or .cse11 .cse12 .cse8 .cse9)))) [2020-07-07 14:08:55,056 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (let ((.cse3 (not (<= ~local~0 |old(~token~0)|))) (.cse11 (not (<= |old(~token~0)| ~local~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (= 0 |old(~t1_st~0)|)) (.cse4 (= 0 |old(~E_M~0)|)) (.cse13 (= 1 |old(~t1_pc~0)|)) (.cse12 (= 1 |old(~E_M~0)|)) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= 1 ~m_pc~0)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (let ((.cse8 (+ ~local~0 1))) (and .cse6 .cse7 (<= ~token~0 .cse8) (<= .cse8 ~token~0) (= 1 ~t1_pc~0) .cse9)) .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse10 .cse11 .cse12) (or .cse0 .cse1 (not (= 0 |old(~m_st~0)|)) .cse2 .cse4 .cse13 .cse14 .cse10 .cse12) (or (and .cse6 .cse7 .cse9) .cse14 .cse5 .cse10))) [2020-07-07 14:08:55,057 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse16 (= 1 ~m_pc~0)) (.cse17 (= 1 ~m_i~0))) (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse4 (= 0 |old(~t1_st~0)|)) (.cse5 (not (<= ~local~0 |old(~token~0)|))) (.cse6 (= 0 |old(~E_M~0)|)) (.cse8 (= 1 |old(~t1_pc~0)|)) (.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= 1 ~t1_pc~0)) (.cse15 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (not (<= |old(~token~0)| ~local~0))) (.cse11 (= 1 |old(~E_M~0)|)) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not .cse17)) (.cse12 (and (not .cse16) .cse17 (<= 2 ~m_st~0)))) (and (or .cse0 .cse1 (let ((.cse2 (+ ~local~0 1))) (and (= 0 ~m_st~0) (not (= 0 ~E_M~0)) (not (= 1 ~E_M~0)) (<= ~token~0 .cse2) (<= .cse2 ~token~0) .cse3)) .cse4 .cse5 .cse6 .cse7 (not .cse8) .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 (not (= 0 |old(~m_st~0)|)) .cse4 .cse6 (and .cse13 .cse14 .cse3 .cse15 (= |old(~token~0)| ~token~0)) .cse8 .cse16 .cse9 .cse11) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse8 (and .cse13 .cse14 (<= ~token~0 ~local~0) .cse3 .cse15 (<= ~local~0 ~token~0)) .cse7 .cse9 .cse10 .cse12 .cse11) (or .cse16 .cse7 .cse9 .cse12)))) [2020-07-07 14:08:55,057 INFO L264 CegarLoopResult]: At program point L90(line 90) the Hoare annotation is: (let ((.cse9 (= 1 ~m_pc~0)) (.cse17 (= 1 ~m_i~0))) (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (= 0 |old(~t1_st~0)|)) (.cse13 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (= 0 |old(~E_M~0)|)) (.cse8 (= 1 |old(~t1_pc~0)|)) (.cse15 (not (<= |old(~token~0)| ~local~0))) (.cse11 (= 1 |old(~E_M~0)|)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not .cse17)) (.cse16 (and (not .cse9) .cse17 (<= 2 ~m_st~0)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= |old(~token~0)| ~token~0)) (not (= 0 |old(~m_st~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 (let ((.cse12 (+ ~local~0 1))) (and (= 0 ~m_st~0) (not (= 0 ~E_M~0)) (not (= 1 ~E_M~0)) (<= ~token~0 .cse12) (<= .cse12 ~token~0) (= 1 ~t1_pc~0))) .cse6 .cse13 .cse7 .cse14 (not .cse8) .cse10 .cse15 .cse11 .cse16) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 (<= ~local~0 ~token~0)) .cse6 .cse13 .cse7 .cse8 .cse14 .cse10 .cse15 .cse16 .cse11) (or .cse9 .cse14 .cse10 .cse16)))) [2020-07-07 14:08:55,057 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse5 (= 1 |old(~t1_pc~0)|)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (= 0 |old(~t1_st~0)|)) (.cse3 (not (<= ~local~0 |old(~token~0)|))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse8 (not (<= |old(~token~0)| ~local~0))) (.cse9 (= 1 |old(~E_M~0)|)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (= 1 ~m_pc~0)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 (not (= 0 |old(~m_st~0)|)) .cse2 .cse4 .cse5 .cse10 .cse7 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse11 .cse12 (<= ~token~0 ~local~0) (= 1 ~t1_pc~0) .cse13 (<= ~local~0 ~token~0)) .cse6 .cse7 .cse8 .cse9) (or (and (= |old(~t1_pc~0)| ~t1_pc~0) .cse11 .cse12 .cse13 (= |old(~token~0)| ~token~0)) .cse10 .cse6 .cse7))) [2020-07-07 14:08:55,059 INFO L264 CegarLoopResult]: At program point transmit1EXIT(lines 74 109) the Hoare annotation is: (let ((.cse15 (= 1 ~m_pc~0)) (.cse18 (= 1 ~m_i~0)) (.cse17 (<= 2 ~m_st~0))) (let ((.cse7 (not (<= ~local~0 |old(~token~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= |old(~token~0)| ~local~0))) (.cse13 (and (not .cse15) .cse18 .cse17)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (= 0 ~m_st~0)) (.cse4 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~t1_st~0)) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (= 0 |old(~t1_st~0)|)) (.cse8 (= 0 |old(~E_M~0)|)) (.cse10 (= 1 |old(~t1_pc~0)|)) (.cse11 (not .cse18)) (.cse14 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 (let ((.cse3 (+ ~local~0 1))) (and .cse2 (not (= 0 ~E_M~0)) (<= ~token~0 .cse3) (not (= 1 ~E_M~0)) (<= .cse3 ~token~0) .cse4 .cse5)) .cse6 .cse7 .cse8 .cse9 (not .cse10) .cse11 .cse12 .cse13 .cse14) (or .cse15 .cse9 .cse11 .cse13) (or .cse0 .cse1 .cse6 .cse7 .cse8 .cse10 .cse9 (and (<= ~token~0 ~local~0) .cse4 .cse5 .cse16 (<= ~local~0 ~token~0) .cse17) .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 (and .cse2 .cse4 .cse5 .cse16 (= |old(~token~0)| ~token~0)) (not (= 0 |old(~m_st~0)|)) .cse6 .cse8 .cse10 .cse15 .cse11 .cse14)))) [2020-07-07 14:08:55,060 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse15 (= 1 ~m_pc~0)) (.cse18 (= 1 ~m_i~0)) (.cse17 (<= 2 ~m_st~0))) (let ((.cse7 (not (<= ~local~0 |old(~token~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= |old(~token~0)| ~local~0))) (.cse13 (and (not .cse15) .cse18 .cse17)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (= 0 ~m_st~0)) (.cse4 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~t1_st~0)) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (= 0 |old(~t1_st~0)|)) (.cse8 (= 0 |old(~E_M~0)|)) (.cse10 (= 1 |old(~t1_pc~0)|)) (.cse11 (not .cse18)) (.cse14 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 (let ((.cse3 (+ ~local~0 1))) (and .cse2 (not (= 0 ~E_M~0)) (<= ~token~0 .cse3) (not (= 1 ~E_M~0)) (<= .cse3 ~token~0) .cse4 .cse5)) .cse6 .cse7 .cse8 .cse9 (not .cse10) .cse11 .cse12 .cse13 .cse14) (or .cse15 .cse9 .cse11 .cse13) (or .cse0 .cse1 .cse6 .cse7 .cse8 .cse10 .cse9 (and (<= ~token~0 ~local~0) .cse4 .cse5 .cse16 (<= ~local~0 ~token~0) .cse17) .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 (and .cse2 .cse4 .cse5 .cse16 (= |old(~token~0)| ~token~0)) (not (= 0 |old(~m_st~0)|)) .cse6 .cse8 .cse10 .cse15 .cse11 .cse14)))) [2020-07-07 14:08:55,060 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (not (<= ~local~0 |old(~token~0)|))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (<= |old(~token~0)| ~local~0))) (.cse5 (not (<= 2 ~E_1~0))) (.cse6 (not (= 1 ~t1_i~0))) (.cse7 (= 0 |old(~t1_st~0)|)) (.cse9 (= 0 |old(~E_M~0)|)) (.cse13 (= 1 |old(~t1_pc~0)|)) (.cse2 (= 1 ~m_pc~0)) (.cse4 (not (= 1 ~m_i~0))) (.cse12 (= 1 |old(~E_M~0)|))) (and (or (and .cse0 .cse1) .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse3 (let ((.cse10 (+ ~local~0 1))) (and .cse0 .cse1 (= 1 ~E_M~0) (<= ~token~0 .cse10) (<= .cse10 ~token~0) (= 1 ~t1_pc~0))) .cse4 .cse11 .cse12) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse3 .cse4 .cse11 .cse12) (or .cse5 .cse6 (not (= 0 |old(~m_st~0)|)) .cse7 .cse9 .cse13 .cse2 .cse4 .cse12))) [2020-07-07 14:08:55,060 INFO L264 CegarLoopResult]: At program point L99-1(line 99) the Hoare annotation is: (let ((.cse12 (= 1 ~m_pc~0)) (.cse13 (= 1 ~m_i~0))) (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse3 (= 0 |old(~t1_st~0)|)) (.cse4 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse11 (= 1 |old(~t1_pc~0)|)) (.cse8 (not (<= |old(~token~0)| ~local~0))) (.cse9 (= 1 |old(~E_M~0)|)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not .cse13)) (.cse10 (and (not .cse12) .cse13 (<= 2 ~m_st~0)))) (and (or .cse0 .cse1 (let ((.cse2 (+ ~local~0 1))) (and (= 0 ~m_st~0) (= 1 ~E_M~0) (<= ~token~0 .cse2) (<= .cse2 ~token~0) (= 1 ~t1_pc~0))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 (not (= 0 |old(~m_st~0)|)) .cse3 .cse5 .cse11 .cse12 .cse7 .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 .cse10 .cse9) (or .cse12 .cse6 .cse7 .cse10)))) [2020-07-07 14:08:55,060 INFO L264 CegarLoopResult]: At program point L318(line 318) the Hoare annotation is: (let ((.cse7 (= 0 |old(~t1_st~0)|)) (.cse20 (= 1 ~t1_pc~0)) (.cse1 (= 1 ~m_pc~0)) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (<= 0 activate_threads_~tmp~1)) (.cse22 (<= activate_threads_~tmp~1 0))) (let ((.cse0 (and (not .cse1) .cse16 .cse17 .cse21 .cse22)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse11 (and .cse21 .cse22)) (.cse9 (= 0 ~m_st~0)) (.cse4 (not (<= 2 ~E_1~0))) (.cse5 (not (= 1 ~t1_i~0))) (.cse6 (not .cse20)) (.cse12 (not (<= ~token~0 ~local~0))) (.cse18 (and .cse16 (= 0 ~t1_st~0) .cse21 .cse22)) (.cse8 (= 1 ~E_M~0)) (.cse19 (not .cse7)) (.cse14 (= 0 ~E_M~0)) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= ~local~0 ~token~0))) (.cse3 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (let ((.cse10 (+ ~local~0 1))) (or .cse4 .cse5 .cse6 .cse7 (not .cse8) .cse0 (and .cse9 (<= 1 activate_threads_~tmp~1)) (not (<= .cse10 ~token~0)) .cse2 (not (<= ~token~0 .cse10)) .cse3)) (or .cse11 .cse5 .cse6 .cse12 .cse8 .cse13 .cse1 .cse14 .cse15 .cse3) (or .cse5 .cse6 .cse12 .cse8 .cse13 .cse14 (and .cse16 .cse17 (or .cse11 .cse9)) .cse15 .cse3) (or .cse5 .cse12 .cse18 .cse8 (not (= 1 |old(~m_st~0)|)) .cse19 .cse20 .cse1 .cse14 .cse15 .cse3) (or .cse4 .cse5 .cse18 (not (= 0 |old(~m_st~0)|)) .cse8 .cse19 .cse20 .cse1 .cse14 .cse3) (or .cse4 .cse5 .cse6 .cse12 .cse18 .cse8 .cse19 .cse14 .cse2 .cse15 .cse3)))) [2020-07-07 14:08:55,062 INFO L264 CegarLoopResult]: At program point L317(lines 317 321) the Hoare annotation is: (let ((.cse17 (= 0 |old(~t1_st~0)|)) (.cse16 (= 0 ~t1_st~0)) (.cse21 (= 1 ~t1_pc~0)) (.cse13 (= 1 ~m_pc~0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (<= 0 activate_threads_~tmp~1)) (.cse23 (<= activate_threads_~tmp~1 0))) (let ((.cse8 (and .cse22 .cse23)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (= 0 ~m_st~0)) (.cse12 (and (not .cse13) .cse9 .cse10 .cse22 .cse23)) (.cse1 (not .cse21)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse15 (not (<= 2 ~E_1~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse19 (and .cse9 .cse16 .cse22 .cse23)) (.cse3 (= 1 ~E_M~0)) (.cse20 (not .cse17)) (.cse5 (= 0 ~E_M~0)) (.cse11 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (or .cse7 .cse8) .cse9 .cse10) .cse11) (or .cse12 .cse13 .cse14 .cse11) (or .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse11) (let ((.cse18 (+ ~local~0 1))) (or .cse15 (and .cse7 (<= 1 activate_threads_~tmp~1) (not .cse16)) .cse0 .cse1 .cse17 (not .cse3) .cse12 (not (<= .cse18 ~token~0)) .cse14 (not (<= ~token~0 .cse18)) .cse11)) (or .cse0 .cse2 .cse19 .cse3 (not (= 1 |old(~m_st~0)|)) .cse20 .cse21 .cse13 .cse5 .cse6 .cse11) (or .cse15 .cse0 .cse1 .cse2 .cse19 .cse3 .cse20 .cse5 .cse14 .cse6 .cse11) (or .cse15 .cse0 .cse19 (not (= 0 |old(~m_st~0)|)) .cse3 .cse20 .cse21 .cse13 .cse5 .cse11)))) [2020-07-07 14:08:55,062 INFO L264 CegarLoopResult]: At program point L315(line 315) the Hoare annotation is: (let ((.cse17 (= 0 |old(~t1_st~0)|)) (.cse16 (= 0 ~t1_st~0)) (.cse21 (= 1 ~t1_pc~0)) (.cse13 (= 1 ~m_pc~0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (<= 0 activate_threads_~tmp~1)) (.cse23 (<= activate_threads_~tmp~1 0))) (let ((.cse8 (and .cse22 .cse23)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (= 0 ~m_st~0)) (.cse12 (and (not .cse13) .cse9 .cse10 .cse22 .cse23)) (.cse1 (not .cse21)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse15 (not (<= 2 ~E_1~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse19 (and .cse9 .cse16 .cse22 .cse23)) (.cse3 (= 1 ~E_M~0)) (.cse20 (not .cse17)) (.cse5 (= 0 ~E_M~0)) (.cse11 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (or .cse7 .cse8) .cse9 .cse10) .cse11) (or .cse12 .cse13 .cse14 .cse11) (or .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse11) (let ((.cse18 (+ ~local~0 1))) (or .cse15 (and .cse7 (<= 1 activate_threads_~tmp~1) (not .cse16)) .cse0 .cse1 .cse17 (not .cse3) .cse12 (not (<= .cse18 ~token~0)) .cse14 (not (<= ~token~0 .cse18)) .cse11)) (or .cse0 .cse2 .cse19 .cse3 (not (= 1 |old(~m_st~0)|)) .cse20 .cse21 .cse13 .cse5 .cse6 .cse11) (or .cse15 .cse0 .cse1 .cse2 .cse19 .cse3 .cse20 .cse5 .cse14 .cse6 .cse11) (or .cse15 .cse0 .cse19 (not (= 0 |old(~m_st~0)|)) .cse3 .cse20 .cse21 .cse13 .cse5 .cse11)))) [2020-07-07 14:08:55,062 INFO L264 CegarLoopResult]: At program point L317-2(lines 301 325) the Hoare annotation is: (let ((.cse22 (= 0 |old(~t1_st~0)|)) (.cse12 (= ~m_st~0 |old(~m_st~0)|)) (.cse13 (= 0 ~t1_st~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse7 (= 1 ~m_pc~0)) (.cse14 (<= 0 activate_threads_~tmp~1)) (.cse15 (= 1 ~m_i~0)) (.cse16 (<= activate_threads_~tmp~1 0)) (.cse17 (<= 2 ~m_st~0))) (let ((.cse19 (and (not .cse7) .cse14 .cse15 .cse16 .cse17)) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not .cse5)) (.cse1 (not (<= ~token~0 ~local~0))) (.cse21 (not (<= 2 |old(~t1_st~0)|))) (.cse23 (= 0 ~m_st~0)) (.cse20 (and .cse14 .cse16)) (.cse8 (not (<= ~local~0 ~token~0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse2 (and .cse12 .cse13 .cse14 .cse16)) (.cse3 (= 1 ~E_M~0)) (.cse4 (not .cse22)) (.cse6 (= 0 ~E_M~0)) (.cse9 (not .cse15))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= 1 |old(~m_st~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse1 .cse3 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse4 .cse6 .cse18 .cse8 .cse19 .cse9) (or .cse7 .cse18 .cse19 .cse9) (or .cse20 .cse0 .cse11 .cse1 .cse3 .cse21 .cse7 .cse6 .cse8 .cse9) (let ((.cse24 (+ ~local~0 1))) (or .cse10 .cse0 .cse11 .cse22 (not .cse3) (and .cse23 (<= 1 activate_threads_~tmp~1)) (not (<= .cse24 ~token~0)) .cse18 .cse19 (not (<= ~token~0 .cse24)) .cse9)) (or .cse10 .cse0 .cse11 .cse1 .cse3 .cse21 .cse6 .cse18 .cse8 .cse9 (and .cse14 .cse15 .cse16 .cse17)) (or .cse0 .cse11 .cse1 .cse3 .cse21 (and .cse12 (= |old(~t1_st~0)| ~t1_st~0) (or .cse20 .cse23)) .cse6 (and (or .cse23 .cse20) .cse13) .cse8 .cse9) (or .cse10 .cse0 .cse2 (not (= 0 |old(~m_st~0)|)) .cse3 .cse4 .cse5 .cse7 .cse6 .cse9)))) [2020-07-07 14:08:55,063 INFO L264 CegarLoopResult]: At program point L315-1(line 315) the Hoare annotation is: (let ((.cse17 (= 0 |old(~t1_st~0)|)) (.cse16 (= 0 ~t1_st~0)) (.cse21 (= 1 ~t1_pc~0)) (.cse13 (= 1 ~m_pc~0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (<= 0 activate_threads_~tmp~1)) (.cse23 (<= activate_threads_~tmp~1 0))) (let ((.cse8 (and .cse22 .cse23)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (= 0 ~m_st~0)) (.cse12 (and (not .cse13) .cse9 .cse10 .cse22 .cse23)) (.cse1 (not .cse21)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse15 (not (<= 2 ~E_1~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse19 (and .cse9 .cse16 .cse22 .cse23)) (.cse3 (= 1 ~E_M~0)) (.cse20 (not .cse17)) (.cse5 (= 0 ~E_M~0)) (.cse11 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (or .cse7 .cse8) .cse9 .cse10) .cse11) (or .cse12 .cse13 .cse14 .cse11) (or .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse11) (let ((.cse18 (+ ~local~0 1))) (or .cse15 (and .cse7 (<= 1 activate_threads_~tmp~1) (not .cse16)) .cse0 .cse1 .cse17 (not .cse3) .cse12 (not (<= .cse18 ~token~0)) .cse14 (not (<= ~token~0 .cse18)) .cse11)) (or .cse0 .cse2 .cse19 .cse3 (not (= 1 |old(~m_st~0)|)) .cse20 .cse21 .cse13 .cse5 .cse6 .cse11) (or .cse15 .cse0 .cse1 .cse2 .cse19 .cse3 .cse20 .cse5 .cse14 .cse6 .cse11) (or .cse15 .cse0 .cse19 (not (= 0 |old(~m_st~0)|)) .cse3 .cse20 .cse21 .cse13 .cse5 .cse11)))) [2020-07-07 14:08:55,064 INFO L264 CegarLoopResult]: At program point L315-2(line 315) the Hoare annotation is: (let ((.cse17 (= 0 |old(~t1_st~0)|)) (.cse16 (= 0 ~t1_st~0)) (.cse21 (= 1 ~t1_pc~0)) (.cse13 (= 1 ~m_pc~0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (<= 0 activate_threads_~tmp~1)) (.cse23 (<= activate_threads_~tmp~1 0))) (let ((.cse8 (and .cse22 .cse23)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (= 0 ~m_st~0)) (.cse12 (and (not .cse13) .cse9 .cse10 .cse22 .cse23)) (.cse1 (not .cse21)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse15 (not (<= 2 ~E_1~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse19 (and .cse9 .cse16 .cse22 .cse23)) (.cse3 (= 1 ~E_M~0)) (.cse20 (not .cse17)) (.cse5 (= 0 ~E_M~0)) (.cse11 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (or .cse7 .cse8) .cse9 .cse10) .cse11) (or .cse12 .cse13 .cse14 .cse11) (or .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse11) (let ((.cse18 (+ ~local~0 1))) (or .cse15 (and .cse7 (<= 1 activate_threads_~tmp~1) (not .cse16)) .cse0 .cse1 .cse17 (not .cse3) .cse12 (not (<= .cse18 ~token~0)) .cse14 (not (<= ~token~0 .cse18)) .cse11)) (or .cse0 .cse2 .cse19 .cse3 (not (= 1 |old(~m_st~0)|)) .cse20 .cse21 .cse13 .cse5 .cse6 .cse11) (or .cse15 .cse0 .cse1 .cse2 .cse19 .cse3 .cse20 .cse5 .cse14 .cse6 .cse11) (or .cse15 .cse0 .cse19 (not (= 0 |old(~m_st~0)|)) .cse3 .cse20 .cse21 .cse13 .cse5 .cse11)))) [2020-07-07 14:08:55,064 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (let ((.cse4 (= 1 ~t1_pc~0)) (.cse9 (= 0 |old(~t1_st~0)|))) (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse3 (not .cse9)) (.cse5 (= 1 ~m_pc~0)) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (= 1 ~t1_i~0))) (.cse8 (not .cse4)) (.cse12 (not (<= ~token~0 ~local~0))) (.cse2 (= 1 ~E_M~0)) (.cse6 (= 0 ~E_M~0)) (.cse13 (not (<= ~local~0 ~token~0))) (.cse7 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (not (= 0 |old(~m_st~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 .cse8 .cse9 (not .cse2) (not (<= .cse10 ~token~0)) .cse11 (and (<= 1 activate_threads_~tmp~1) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0)) (not (<= ~token~0 .cse10)) .cse7)) (or .cse0 .cse1 .cse8 .cse12 .cse2 .cse3 .cse6 .cse11 .cse13 .cse7) (or .cse1 .cse12 .cse2 (not (= 1 |old(~m_st~0)|)) .cse3 .cse4 .cse5 .cse6 .cse13 .cse7) (or .cse5 .cse11 .cse7) (or .cse1 .cse8 .cse12 .cse2 (not (<= 2 |old(~t1_st~0)|)) .cse6 .cse13 .cse7)))) [2020-07-07 14:08:55,065 INFO L264 CegarLoopResult]: At program point L309(lines 309 313) the Hoare annotation is: (let ((.cse18 (= 0 |old(~t1_st~0)|)) (.cse1 (= 1 ~m_pc~0)) (.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (<= 0 activate_threads_~tmp~1)) (.cse16 (<= activate_threads_~tmp~1 0)) (.cse9 (= 1 ~t1_pc~0))) (let ((.cse6 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse12 (not .cse9)) (.cse0 (and (not .cse1) .cse13 .cse14 .cse15 .cse16)) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 ~E_1~0))) (.cse4 (not (= 1 ~t1_i~0))) (.cse5 (and .cse13 (= 0 ~t1_st~0) .cse15 .cse16)) (.cse7 (= 1 ~E_M~0)) (.cse8 (not .cse18)) (.cse10 (= 0 ~E_M~0)) (.cse3 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 (not (= 1 |old(~m_st~0)|)) .cse8 .cse9 .cse1 .cse10 .cse11 .cse3) (or .cse4 .cse12 .cse6 (and .cse13 .cse14 .cse15 .cse16) .cse7 (not (<= 2 |old(~t1_st~0)|)) .cse10 .cse11 .cse3) (or .cse17 .cse4 .cse12 .cse6 .cse5 .cse7 .cse8 .cse10 .cse2 .cse11 .cse3) (let ((.cse19 (+ ~local~0 1))) (or .cse17 .cse4 .cse12 .cse18 (not .cse7) .cse0 (not (<= .cse19 ~token~0)) .cse2 (and (<= 1 activate_threads_~tmp~1) .cse13 .cse14) (not (<= ~token~0 .cse19)) .cse3)) (or .cse17 .cse4 .cse5 (not (= 0 |old(~m_st~0)|)) .cse7 .cse8 .cse9 .cse1 .cse10 .cse3)))) [2020-07-07 14:08:55,065 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse14 (= 0 |old(~t1_st~0)|)) (.cse13 (= 1 ~t1_pc~0)) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse16 (= 0 ~t1_st~0))) (let ((.cse9 (and .cse17 .cse16)) (.cse0 (and .cse17 (= |old(~t1_st~0)| ~t1_st~0))) (.cse4 (not (<= 2 ~E_1~0))) (.cse6 (not .cse13)) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (= 1 ~t1_i~0))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (= 1 ~E_M~0)) (.cse10 (not .cse14)) (.cse1 (= 1 ~m_pc~0)) (.cse11 (= 0 ~E_M~0)) (.cse12 (not (<= ~local~0 ~token~0))) (.cse3 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse2 .cse12 .cse3) (or .cse0 .cse5 .cse6 .cse7 .cse8 (not (<= 2 |old(~t1_st~0)|)) .cse11 .cse12 .cse3) (or .cse4 .cse5 (not (= 0 |old(~m_st~0)|)) .cse9 .cse8 .cse10 .cse13 .cse1 .cse11 .cse3) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse4 .cse5 .cse6 .cse14 (not .cse8) (not (<= .cse15 ~token~0)) .cse2 (not (<= ~token~0 .cse15)) .cse3)) (or .cse5 .cse7 .cse8 (and (= 1 ~m_st~0) .cse16) (not (= 1 |old(~m_st~0)|)) .cse10 .cse13 .cse1 .cse11 .cse12 .cse3)))) [2020-07-07 14:08:55,068 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse17 (= 0 |old(~t1_st~0)|)) (.cse16 (= 0 ~t1_st~0)) (.cse21 (= 1 ~t1_pc~0)) (.cse13 (= 1 ~m_pc~0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (<= 0 activate_threads_~tmp~1)) (.cse23 (<= activate_threads_~tmp~1 0))) (let ((.cse8 (and .cse22 .cse23)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (= 0 ~m_st~0)) (.cse12 (and (not .cse13) .cse9 .cse10 .cse22 .cse23)) (.cse1 (not .cse21)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse15 (not (<= 2 ~E_1~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse19 (and .cse9 .cse16 .cse22 .cse23)) (.cse3 (= 1 ~E_M~0)) (.cse20 (not .cse17)) (.cse5 (= 0 ~E_M~0)) (.cse11 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (or .cse7 .cse8) .cse9 .cse10) .cse11) (or .cse12 .cse13 .cse14 .cse11) (or .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse11) (let ((.cse18 (+ ~local~0 1))) (or .cse15 (and .cse7 (<= 1 activate_threads_~tmp~1) (not .cse16)) .cse0 .cse1 .cse17 (not .cse3) .cse12 (not (<= .cse18 ~token~0)) .cse14 (not (<= ~token~0 .cse18)) .cse11)) (or .cse0 .cse2 .cse19 .cse3 (not (= 1 |old(~m_st~0)|)) .cse20 .cse21 .cse13 .cse5 .cse6 .cse11) (or .cse15 .cse0 .cse1 .cse2 .cse19 .cse3 .cse20 .cse5 .cse14 .cse6 .cse11) (or .cse15 .cse0 .cse19 (not (= 0 |old(~m_st~0)|)) .cse3 .cse20 .cse21 .cse13 .cse5 .cse11)))) [2020-07-07 14:08:55,068 INFO L264 CegarLoopResult]: At program point L307-1(line 307) the Hoare annotation is: (let ((.cse6 (= 1 ~m_pc~0)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= 1 ~m_i~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (<= |activate_threads_#t~ret4| 0)) (.cse19 (<= 0 |activate_threads_#t~ret4|)) (.cse13 (= 0 |old(~t1_st~0)|))) (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse4 (not .cse13)) (.cse3 (and .cse14 (= 0 ~t1_st~0) .cse18 .cse19)) (.cse1 (not (= 1 ~t1_i~0))) (.cse9 (not .cse5)) (.cse10 (not (<= ~token~0 ~local~0))) (.cse2 (= 1 ~E_M~0)) (.cse7 (= 0 ~E_M~0)) (.cse12 (not (<= ~local~0 ~token~0))) (.cse17 (and (not .cse6) .cse14 .cse15 .cse20 .cse18 .cse19)) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse8 (not .cse20))) (and (or .cse0 .cse1 (not (= 0 |old(~m_st~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse10 .cse2 .cse3 .cse4 .cse7 .cse11 .cse12 .cse8) (let ((.cse16 (+ ~local~0 1))) (or .cse0 .cse1 .cse9 .cse13 (not .cse2) (and .cse14 .cse15 (<= 1 |activate_threads_#t~ret4|)) (not (<= .cse16 ~token~0)) .cse17 .cse11 (not (<= ~token~0 .cse16)) .cse8)) (or .cse1 .cse10 .cse2 (not (= 1 |old(~m_st~0)|)) .cse4 .cse5 .cse3 .cse6 .cse7 .cse12 .cse8) (or (and .cse14 .cse15 .cse18 .cse19) .cse1 .cse9 .cse10 .cse2 (not (<= 2 |old(~t1_st~0)|)) .cse7 .cse12 .cse8) (or .cse17 .cse6 .cse11 .cse8)))) [2020-07-07 14:08:55,069 INFO L264 CegarLoopResult]: At program point L307-2(line 307) the Hoare annotation is: (let ((.cse6 (= 1 ~m_pc~0)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (= 1 ~m_i~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (<= |activate_threads_#t~ret4| 0)) (.cse19 (<= 0 |activate_threads_#t~ret4|)) (.cse13 (= 0 |old(~t1_st~0)|))) (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse4 (not .cse13)) (.cse3 (and .cse14 (= 0 ~t1_st~0) .cse18 .cse19)) (.cse1 (not (= 1 ~t1_i~0))) (.cse9 (not .cse5)) (.cse10 (not (<= ~token~0 ~local~0))) (.cse2 (= 1 ~E_M~0)) (.cse7 (= 0 ~E_M~0)) (.cse12 (not (<= ~local~0 ~token~0))) (.cse17 (and (not .cse6) .cse14 .cse15 .cse20 .cse18 .cse19)) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse8 (not .cse20))) (and (or .cse0 .cse1 (not (= 0 |old(~m_st~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse10 .cse2 .cse3 .cse4 .cse7 .cse11 .cse12 .cse8) (let ((.cse16 (+ ~local~0 1))) (or .cse0 .cse1 .cse9 .cse13 (not .cse2) (and .cse14 .cse15 (<= 1 |activate_threads_#t~ret4|)) (not (<= .cse16 ~token~0)) .cse17 .cse11 (not (<= ~token~0 .cse16)) .cse8)) (or .cse1 .cse10 .cse2 (not (= 1 |old(~m_st~0)|)) .cse4 .cse5 .cse3 .cse6 .cse7 .cse12 .cse8) (or (and .cse14 .cse15 .cse18 .cse19) .cse1 .cse9 .cse10 .cse2 (not (<= 2 |old(~t1_st~0)|)) .cse7 .cse12 .cse8) (or .cse17 .cse6 .cse11 .cse8)))) [2020-07-07 14:08:55,069 INFO L264 CegarLoopResult]: At program point L307-3(line 307) the Hoare annotation is: (let ((.cse6 (= 1 ~m_pc~0)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (= 1 ~m_i~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse20 (= 0 |old(~t1_st~0)|)) (.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse16 (<= 0 activate_threads_~tmp~1)) (.cse17 (<= activate_threads_~tmp~1 0)) (.cse18 (<= |activate_threads_#t~ret4| 0)) (.cse19 (<= 0 |activate_threads_#t~ret4|))) (let ((.cse1 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse2 (and .cse14 (= 0 ~t1_st~0) .cse16 .cse17 .cse18 .cse19)) (.cse4 (not .cse20)) (.cse7 (= 0 ~E_M~0)) (.cse10 (not (<= 2 ~E_1~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse11 (not .cse5)) (.cse3 (= 1 ~E_M~0)) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not .cse22)) (.cse13 (and (not .cse6) .cse14 .cse15 .cse16 .cse17 .cse22 .cse18 .cse19 (<= 2 ~m_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= 1 |old(~m_st~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse7 .cse12 .cse8 .cse9) (or .cse6 .cse12 .cse9 .cse13) (or .cse0 .cse11 .cse1 .cse3 (not (<= 2 |old(~t1_st~0)|)) .cse7 .cse8 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse9) (or .cse10 .cse0 (not (= 0 |old(~m_st~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9) (let ((.cse21 (+ ~local~0 1))) (or .cse10 .cse0 .cse11 .cse20 (not .cse3) (not (<= .cse21 ~token~0)) (and (<= 1 activate_threads_~tmp~1) .cse14 .cse15 (<= 1 |activate_threads_#t~ret4|)) .cse12 (not (<= ~token~0 .cse21)) .cse9 .cse13))))) [2020-07-07 14:08:55,069 INFO L264 CegarLoopResult]: At program point L303(line 303) the Hoare annotation is: (let ((.cse14 (= 0 |old(~t1_st~0)|)) (.cse13 (= 1 ~t1_pc~0)) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse16 (= 0 ~t1_st~0))) (let ((.cse9 (and .cse17 .cse16)) (.cse0 (and .cse17 (= |old(~t1_st~0)| ~t1_st~0))) (.cse4 (not (<= 2 ~E_1~0))) (.cse6 (not .cse13)) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (= 1 ~t1_i~0))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (= 1 ~E_M~0)) (.cse10 (not .cse14)) (.cse1 (= 1 ~m_pc~0)) (.cse11 (= 0 ~E_M~0)) (.cse12 (not (<= ~local~0 ~token~0))) (.cse3 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse2 .cse12 .cse3) (or .cse0 .cse5 .cse6 .cse7 .cse8 (not (<= 2 |old(~t1_st~0)|)) .cse11 .cse12 .cse3) (or .cse4 .cse5 (not (= 0 |old(~m_st~0)|)) .cse9 .cse8 .cse10 .cse13 .cse1 .cse11 .cse3) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse4 .cse5 .cse6 .cse14 (not .cse8) (not (<= .cse15 ~token~0)) .cse2 (not (<= ~token~0 .cse15)) .cse3)) (or .cse5 .cse7 .cse8 (and (= 1 ~m_st~0) .cse16) (not (= 1 |old(~m_st~0)|)) .cse10 .cse13 .cse1 .cse11 .cse12 .cse3)))) [2020-07-07 14:08:55,070 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse14 (= 0 |old(~t1_st~0)|)) (.cse13 (= 1 ~t1_pc~0)) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse16 (= 0 ~t1_st~0))) (let ((.cse9 (and .cse17 .cse16)) (.cse0 (and .cse17 (= |old(~t1_st~0)| ~t1_st~0))) (.cse4 (not (<= 2 ~E_1~0))) (.cse6 (not .cse13)) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (= 1 ~t1_i~0))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (= 1 ~E_M~0)) (.cse10 (not .cse14)) (.cse1 (= 1 ~m_pc~0)) (.cse11 (= 0 ~E_M~0)) (.cse12 (not (<= ~local~0 ~token~0))) (.cse3 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse2 .cse12 .cse3) (or .cse0 .cse5 .cse6 .cse7 .cse8 (not (<= 2 |old(~t1_st~0)|)) .cse11 .cse12 .cse3) (or .cse4 .cse5 (not (= 0 |old(~m_st~0)|)) .cse9 .cse8 .cse10 .cse13 .cse1 .cse11 .cse3) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse4 .cse5 .cse6 .cse14 (not .cse8) (not (<= .cse15 ~token~0)) .cse2 (not (<= ~token~0 .cse15)) .cse3)) (or .cse5 .cse7 .cse8 (and (= 1 ~m_st~0) .cse16) (not (= 1 |old(~m_st~0)|)) .cse10 .cse13 .cse1 .cse11 .cse12 .cse3)))) [2020-07-07 14:08:55,070 INFO L264 CegarLoopResult]: At program point activate_threadsEXIT(lines 301 325) the Hoare annotation is: (let ((.cse22 (= 0 |old(~t1_st~0)|)) (.cse12 (= ~m_st~0 |old(~m_st~0)|)) (.cse13 (= 0 ~t1_st~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse7 (= 1 ~m_pc~0)) (.cse14 (<= 0 activate_threads_~tmp~1)) (.cse15 (= 1 ~m_i~0)) (.cse16 (<= activate_threads_~tmp~1 0)) (.cse17 (<= 2 ~m_st~0))) (let ((.cse19 (and (not .cse7) .cse14 .cse15 .cse16 .cse17)) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not .cse5)) (.cse1 (not (<= ~token~0 ~local~0))) (.cse21 (not (<= 2 |old(~t1_st~0)|))) (.cse23 (= 0 ~m_st~0)) (.cse20 (and .cse14 .cse16)) (.cse8 (not (<= ~local~0 ~token~0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse2 (and .cse12 .cse13 .cse14 .cse16)) (.cse3 (= 1 ~E_M~0)) (.cse4 (not .cse22)) (.cse6 (= 0 ~E_M~0)) (.cse9 (not .cse15))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= 1 |old(~m_st~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse1 .cse3 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse4 .cse6 .cse18 .cse8 .cse19 .cse9) (or .cse7 .cse18 .cse19 .cse9) (or .cse20 .cse0 .cse11 .cse1 .cse3 .cse21 .cse7 .cse6 .cse8 .cse9) (let ((.cse24 (+ ~local~0 1))) (or .cse10 .cse0 .cse11 .cse22 (not .cse3) (and .cse23 (<= 1 activate_threads_~tmp~1)) (not (<= .cse24 ~token~0)) .cse18 .cse19 (not (<= ~token~0 .cse24)) .cse9)) (or .cse10 .cse0 .cse11 .cse1 .cse3 .cse21 .cse6 .cse18 .cse8 .cse9 (and .cse14 .cse15 .cse16 .cse17)) (or .cse0 .cse11 .cse1 .cse3 .cse21 (and .cse12 (= |old(~t1_st~0)| ~t1_st~0) (or .cse20 .cse23)) .cse6 (and (or .cse23 .cse20) .cse13) .cse8 .cse9) (or .cse10 .cse0 .cse2 (not (= 0 |old(~m_st~0)|)) .cse3 .cse4 .cse5 .cse7 .cse6 .cse9)))) [2020-07-07 14:08:55,070 INFO L264 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: (let ((.cse12 (= 1 ~t1_pc~0))) (let ((.cse2 (not .cse12)) (.cse5 (not (<= 2 ~t1_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse3 (not (= 0 ~m_st~0))) (.cse4 (= 1 ~E_M~0)) (.cse6 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse7 (= 1 ~m_pc~0)) (.cse8 (= 0 ~E_M~0)) (.cse10 (not (= 0 ~t1_st~0))) (.cse9 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 (not (<= ~token~0 ~local~0)) .cse4 .cse6 (not (<= 2 ~m_st~0)) .cse8 (not (<= ~local~0 ~token~0)) .cse10 .cse9) (let ((.cse11 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= .cse11 ~token~0)) .cse8 (not (<= ~token~0 .cse11)) .cse9)) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse12 .cse7 .cse8 .cse10 .cse9)))) [2020-07-07 14:08:55,071 INFO L264 CegarLoopResult]: At program point exists_runnable_threadEXIT(lines 174 193) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0))) (let ((.cse8 (not (= 0 ~t1_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse10 (not .cse5)) (.cse2 (not (= 0 ~m_st~0))) (.cse3 (= 1 ~E_M~0)) (.cse11 (not (<= 2 ~t1_st~0))) (.cse4 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse6 (= 1 ~m_pc~0)) (.cse7 (= 0 ~E_M~0)) (.cse9 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 (not (<= ~token~0 ~local~0)) .cse3 .cse4 (not (<= 2 ~m_st~0)) .cse7 (not (<= ~local~0 ~token~0)) .cse8 .cse9) (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse4 (not (<= .cse12 ~token~0)) .cse7 (not (<= ~token~0 .cse12)) .cse9)) (or .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse4 .cse6 .cse7 .cse9)))) [2020-07-07 14:08:55,071 INFO L264 CegarLoopResult]: At program point L189(line 189) the Hoare annotation is: (let ((.cse11 (= 1 ~t1_pc~0))) (let ((.cse2 (not .cse11)) (.cse5 (not (<= 2 ~t1_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse3 (not (= 0 ~m_st~0))) (.cse4 (= 1 ~E_M~0)) (.cse6 (= 1 ~m_pc~0)) (.cse7 (= 0 ~E_M~0)) (.cse10 (not (= 0 ~t1_st~0))) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= .cse9 ~token~0)) .cse7 (not (<= ~token~0 .cse9)) .cse8)) (or .cse0 .cse1 (not (<= ~token~0 ~local~0)) .cse4 (not (<= 2 ~m_st~0)) .cse7 (not (<= ~local~0 ~token~0)) .cse10 .cse8) (or .cse0 .cse1 .cse3 .cse4 .cse11 .cse6 .cse7 .cse10 .cse8)))) [2020-07-07 14:08:55,071 INFO L264 CegarLoopResult]: At program point L183(line 183) the Hoare annotation is: (let ((.cse10 (= 1 ~t1_pc~0))) (let ((.cse2 (not .cse10)) (.cse5 (not (<= 2 ~t1_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse3 (not (= 0 ~m_st~0))) (.cse4 (= 1 ~E_M~0)) (.cse6 (= 1 ~m_pc~0)) (.cse7 (= 0 ~E_M~0)) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 (not (<= ~token~0 ~local~0)) .cse4 .cse5 (not (<= 2 ~m_st~0)) .cse7 (not (<= ~local~0 ~token~0)) .cse8) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= .cse9 ~token~0)) .cse7 (not (<= ~token~0 .cse9)) .cse8)) (or .cse0 .cse1 .cse3 .cse4 .cse10 .cse6 .cse7 (not (= 0 ~t1_st~0)) .cse8)))) [2020-07-07 14:08:55,071 INFO L264 CegarLoopResult]: At program point L182(lines 182 187) the Hoare annotation is: (let ((.cse10 (= 1 ~t1_pc~0))) (let ((.cse2 (not .cse10)) (.cse5 (not (<= 2 ~t1_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse3 (not (= 0 ~m_st~0))) (.cse4 (= 1 ~E_M~0)) (.cse6 (= 1 ~m_pc~0)) (.cse7 (= 0 ~E_M~0)) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= .cse9 ~token~0)) .cse7 (not (<= ~token~0 .cse9)) .cse8)) (or .cse0 .cse1 .cse3 .cse4 .cse10 .cse6 .cse7 (not (= 0 ~t1_st~0)) .cse8)))) [2020-07-07 14:08:55,071 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-07-07 14:08:55,072 INFO L264 CegarLoopResult]: At program point L179(line 179) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (= 1 ~E_M~0)) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 ~E_M~0)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (not (= 1 ~t1_pc~0)) .cse2 .cse3 (not (<= 2 ~t1_st~0)) .cse4 .cse5 .cse6 .cse7) (or .cse4 (= 1 ~m_pc~0) .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~t1_st~0)) .cse7))) [2020-07-07 14:08:55,073 INFO L271 CegarLoopResult]: At program point L178(lines 178 188) the Hoare annotation is: true [2020-07-07 14:08:55,073 INFO L264 CegarLoopResult]: At program point exists_runnable_threadFINAL(lines 174 193) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0))) (let ((.cse8 (not (= 0 ~t1_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse10 (not .cse5)) (.cse2 (not (= 0 ~m_st~0))) (.cse3 (= 1 ~E_M~0)) (.cse11 (not (<= 2 ~t1_st~0))) (.cse4 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse6 (= 1 ~m_pc~0)) (.cse7 (= 0 ~E_M~0)) (.cse9 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 (not (<= ~token~0 ~local~0)) .cse3 .cse4 (not (<= 2 ~m_st~0)) .cse7 (not (<= ~local~0 ~token~0)) .cse8 .cse9) (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse4 (not (<= .cse12 ~token~0)) .cse7 (not (<= ~token~0 .cse12)) .cse9)) (or .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse4 .cse6 .cse7 .cse9)))) [2020-07-07 14:08:55,073 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredFINAL(lines 129 147) the Hoare annotation is: true [2020-07-07 14:08:55,073 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-07-07 14:08:55,074 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredEXIT(lines 129 147) the Hoare annotation is: true [2020-07-07 14:08:55,074 INFO L271 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: true [2020-07-07 14:08:55,074 INFO L264 CegarLoopResult]: At program point L135(line 135) the Hoare annotation is: (let ((.cse13 (= 0 ~t1_st~0)) (.cse3 (= 1 ~t1_pc~0))) (let ((.cse1 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= 2 ~m_st~0))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse10 (not .cse3)) (.cse9 (not (<= 2 ~E_1~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse12 (not (= 0 ~m_st~0))) (.cse2 (= 1 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (= 0 ~E_M~0)) (.cse7 (not .cse13)) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 (not (= 1 ~m_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse10 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse11 .cse5 .cse6 .cse8) (or .cse9 .cse0 .cse10 .cse1 .cse2 .cse11 .cse5 .cse6 .cse7 .cse8) (let ((.cse14 (+ ~local~0 1))) (or .cse9 .cse0 .cse10 .cse12 (not .cse2) .cse13 (not (<= .cse14 ~token~0)) (not (<= ~token~0 .cse14)) .cse8)) (or .cse9 .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8)))) [2020-07-07 14:08:55,074 INFO L264 CegarLoopResult]: At program point L134(lines 134 139) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse1 (= 1 ~E_M~0)) (.cse2 (= 1 ~t1_pc~0)) (.cse3 (= 1 ~m_pc~0)) (.cse4 (= 0 ~E_M~0)) (.cse5 (not (= 0 ~t1_st~0))) (.cse6 (not (= 1 ~m_i~0)))) (and (or .cse0 (not (<= ~token~0 ~local~0)) .cse1 (not (= 1 ~m_st~0)) .cse2 .cse3 .cse4 (not (<= ~local~0 ~token~0)) .cse5 .cse6) (or (not (<= 2 ~E_1~0)) .cse0 (not (= 0 ~m_st~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-07-07 14:08:55,074 INFO L271 CegarLoopResult]: At program point L133(lines 133 142) the Hoare annotation is: true [2020-07-07 14:08:55,074 INFO L271 CegarLoopResult]: At program point L133-2(lines 133 142) the Hoare annotation is: true [2020-07-07 14:08:55,075 INFO L264 CegarLoopResult]: At program point L287-1(lines 276 299) the Hoare annotation is: (let ((.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= 1 ~t1_pc~0))) (let ((.cse12 (= 1 ~m_pc~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not .cse13)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse8 (and .cse11 (= ~E_M~0 |old(~E_M~0)|))) (.cse9 (not (= 1 ~m_i~0))) (.cse10 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse4 .cse12 .cse9) (or .cse0 (not (= 0 ~m_st~0)) .cse3 .cse5 .cse13 .cse12 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10)))) [2020-07-07 14:08:55,075 INFO L264 CegarLoopResult]: At program point L283(line 283) the Hoare annotation is: (let ((.cse12 (= 1 ~t1_pc~0))) (let ((.cse11 (= 1 ~m_pc~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not .cse12)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse8 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse9 (not (= 1 ~m_i~0))) (.cse10 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse4 .cse11 .cse8 .cse9) (or .cse0 (not (= 0 ~m_st~0)) .cse3 .cse5 .cse12 .cse11 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10)))) [2020-07-07 14:08:55,075 INFO L264 CegarLoopResult]: At program point L277-1(lines 276 299) the Hoare annotation is: (let ((.cse12 (= 1 ~t1_pc~0))) (let ((.cse11 (= 1 ~m_pc~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not .cse12)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse8 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse9 (not (= 1 ~m_i~0))) (.cse10 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse4 .cse11 .cse8 .cse9) (or .cse0 (not (= 0 ~m_st~0)) .cse3 .cse5 .cse12 .cse11 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10)))) [2020-07-07 14:08:55,075 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse4 (= 1 ~t1_pc~0))) (let ((.cse6 (not (= 0 ~t1_st~0))) (.cse5 (= 1 ~m_pc~0)) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (and (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse9 (not .cse4)) (.cse10 (not (<= ~token~0 ~local~0))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= 2 ~m_st~0))) (.cse3 (= 0 |old(~E_M~0)|)) (.cse12 (not (<= ~local~0 ~token~0))) (.cse7 (not (= 1 ~m_i~0))) (.cse8 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 (not (= 0 ~m_st~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse10 .cse2 .cse11 .cse3 .cse12 .cse6 .cse7 .cse8) (or .cse1 .cse11 .cse5 .cse7) (or .cse0 .cse1 .cse9 .cse10 (not (<= 2 ~t1_st~0)) .cse2 .cse11 .cse3 .cse12 .cse7 .cse8)))) [2020-07-07 14:08:55,076 INFO L264 CegarLoopResult]: At program point L292-1(lines 273 300) the Hoare annotation is: (let ((.cse11 (= 1 ~t1_pc~0))) (let ((.cse7 (not (= 0 ~t1_st~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not .cse11)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse8 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse9 (not (= 1 ~m_i~0))) (.cse10 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 (not (= 0 ~m_st~0)) .cse3 .cse5 .cse11 (= 1 ~m_pc~0) .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10)))) [2020-07-07 14:08:55,076 INFO L264 CegarLoopResult]: At program point L288(line 288) the Hoare annotation is: (let ((.cse10 (= 1 ~t1_pc~0))) (let ((.cse9 (= 1 ~m_pc~0)) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not .cse10)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse11 (not (= 0 ~t1_st~0))) (.cse7 (not (= 1 ~m_i~0))) (.cse8 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse4 .cse9 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse7) (or .cse0 (not (= 0 ~m_st~0)) .cse3 .cse5 .cse10 .cse9 .cse11 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8)))) [2020-07-07 14:08:55,076 INFO L264 CegarLoopResult]: At program point L282-1(lines 276 299) the Hoare annotation is: (let ((.cse12 (= 1 ~t1_pc~0))) (let ((.cse11 (= 1 ~m_pc~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not .cse12)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse8 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse9 (not (= 1 ~m_i~0))) (.cse10 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse4 .cse11 .cse8 .cse9) (or .cse0 (not (= 0 ~m_st~0)) .cse3 .cse5 .cse12 .cse11 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10)))) [2020-07-07 14:08:55,076 INFO L264 CegarLoopResult]: At program point L278(line 278) the Hoare annotation is: (let ((.cse4 (= 1 ~t1_pc~0))) (let ((.cse6 (not (= 0 ~t1_st~0))) (.cse5 (= 1 ~m_pc~0)) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (and (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse9 (not .cse4)) (.cse10 (not (<= ~token~0 ~local~0))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= 2 ~m_st~0))) (.cse3 (= 0 |old(~E_M~0)|)) (.cse12 (not (<= ~local~0 ~token~0))) (.cse7 (not (= 1 ~m_i~0))) (.cse8 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 (not (= 0 ~m_st~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse9 .cse10 .cse2 .cse11 .cse3 .cse12 .cse6 .cse7 .cse8) (or .cse1 .cse11 .cse5 .cse7) (or .cse0 .cse1 .cse9 .cse10 (not (<= 2 ~t1_st~0)) .cse2 .cse11 .cse3 .cse12 .cse7 .cse8)))) [2020-07-07 14:08:55,077 INFO L264 CegarLoopResult]: At program point reset_delta_eventsEXIT(lines 273 300) the Hoare annotation is: (let ((.cse11 (= 1 ~t1_pc~0))) (let ((.cse7 (not (= 0 ~t1_st~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not .cse11)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse8 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse9 (not (= 1 ~m_i~0))) (.cse10 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 (not (= 0 ~m_st~0)) .cse3 .cse5 .cse11 (= 1 ~m_pc~0) .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10)))) [2020-07-07 14:08:55,077 INFO L264 CegarLoopResult]: At program point L293(line 293) the Hoare annotation is: (let ((.cse10 (= 1 ~t1_pc~0))) (let ((.cse9 (= 1 ~m_pc~0)) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not .cse10)) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse11 (not (= 0 ~t1_st~0))) (.cse7 (not (= 1 ~m_i~0))) (.cse8 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (= ~E_1~0 |old(~E_1~0)|) .cse4 .cse9 .cse7) (or .cse0 (not (= 0 ~m_st~0)) .cse3 .cse5 .cse10 .cse9 .cse11 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8)))) [2020-07-07 14:08:55,077 INFO L264 CegarLoopResult]: At program point L161(line 161) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (= ~m_st~0 |old(~m_st~0)|) (= 0 ~t1_st~0)) (= 1 ~E_M~0) (not (= 0 |old(~t1_st~0)|)) (= 1 ~t1_pc~0) (= 1 ~m_pc~0) (= 0 ~E_M~0) (not (= 1 ~m_i~0))) [2020-07-07 14:08:55,077 INFO L264 CegarLoopResult]: At program point L160-1(lines 159 172) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (= ~m_st~0 |old(~m_st~0)|) (= 0 ~t1_st~0)) (= 1 ~E_M~0) (not (= 0 |old(~t1_st~0)|)) (= 1 ~t1_pc~0) (= 1 ~m_pc~0) (= 0 ~E_M~0) (not (= 1 ~m_i~0))) [2020-07-07 14:08:55,077 INFO L264 CegarLoopResult]: At program point init_threadsEXIT(lines 156 173) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0)) (= 1 ~E_M~0) (not (= 0 |old(~t1_st~0)|)) (= 1 ~t1_pc~0) (= 1 ~m_pc~0) (= 0 ~E_M~0) (not (= 1 ~m_i~0))) [2020-07-07 14:08:55,077 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (= ~m_st~0 |old(~m_st~0)|) (= 0 ~t1_st~0)) (= 1 ~E_M~0) (not (= 0 |old(~t1_st~0)|)) (= 1 ~t1_pc~0) (= 1 ~m_pc~0) (= 0 ~E_M~0) (not (= 1 ~m_i~0))) [2020-07-07 14:08:55,077 INFO L264 CegarLoopResult]: At program point L168(line 168) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (= 1 ~E_M~0) (not (= 0 |old(~t1_st~0)|)) (= 1 ~t1_pc~0) (= 1 ~m_pc~0) (= 0 ~E_M~0) (not (= 1 ~m_i~0))) [2020-07-07 14:08:55,078 INFO L264 CegarLoopResult]: At program point L166(line 166) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (= ~m_st~0 |old(~m_st~0)|) (= 0 ~t1_st~0)) (= 1 ~E_M~0) (not (= 0 |old(~t1_st~0)|)) (= 1 ~t1_pc~0) (= 1 ~m_pc~0) (= 0 ~E_M~0) (not (= 1 ~m_i~0))) [2020-07-07 14:08:55,078 INFO L264 CegarLoopResult]: At program point L165-1(lines 156 173) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0)) (= 1 ~E_M~0) (not (= 0 |old(~t1_st~0)|)) (= 1 ~t1_pc~0) (= 1 ~m_pc~0) (= 0 ~E_M~0) (not (= 1 ~m_i~0))) [2020-07-07 14:08:55,078 INFO L264 CegarLoopResult]: At program point L163(line 163) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (= 1 ~E_M~0) (not (= 0 |old(~t1_st~0)|)) (= 1 ~t1_pc~0) (= 1 ~m_pc~0) (= 0 ~E_M~0) (not (= 1 ~m_i~0))) [2020-07-07 14:08:55,078 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (= 1 |old(~t1_i~0)|) (not (= 0 |old(~m_st~0)|)) (= |old(~m_i~0)| 1) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (= 0 |old(~E_M~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= 0 ~t1_st~0) (= |old(~m_i~0)| ~m_i~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (= 1 |old(~E_M~0)|)) [2020-07-07 14:08:55,078 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 462 473) the Hoare annotation is: true [2020-07-07 14:08:55,078 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 462 473) the Hoare annotation is: true [2020-07-07 14:08:55,079 INFO L271 CegarLoopResult]: At program point L471(line 471) the Hoare annotation is: true [2020-07-07 14:08:55,079 INFO L271 CegarLoopResult]: At program point L468(line 468) the Hoare annotation is: true [2020-07-07 14:08:55,079 INFO L264 CegarLoopResult]: At program point L467(line 467) the Hoare annotation is: (or (= 1 |old(~t1_i~0)|) (not (= 0 |old(~m_st~0)|)) (= |old(~m_i~0)| 1) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (= 0 |old(~E_M~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= 0 ~t1_st~0) (= |old(~m_i~0)| ~m_i~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (= 1 |old(~E_M~0)|)) [2020-07-07 14:08:55,079 INFO L264 CegarLoopResult]: At program point L467-1(line 467) the Hoare annotation is: (or (= 1 |old(~t1_i~0)|) (not (= 0 |old(~m_st~0)|)) (= |old(~m_i~0)| 1) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (= 0 |old(~E_M~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= 1 ~t1_i~0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= 0 ~t1_st~0) (= 1 ~m_i~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (= 1 |old(~E_M~0)|)) [2020-07-07 14:08:55,079 INFO L271 CegarLoopResult]: At program point errorEXIT(lines 6 13) the Hoare annotation is: true [2020-07-07 14:08:55,079 INFO L271 CegarLoopResult]: At program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: true [2020-07-07 14:08:55,080 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-07-07 14:08:55,081 INFO L271 CegarLoopResult]: At program point errorFINAL(lines 6 13) the Hoare annotation is: true [2020-07-07 14:08:55,081 INFO L264 CegarLoopResult]: At program point masterEXIT(lines 30 73) the Hoare annotation is: (let ((.cse1 (= 1 ~E_M~0))) (let ((.cse4 (<= 2 ~E_1~0)) (.cse19 (not .cse1)) (.cse5 (= 0 ~t1_st~0)) (.cse6 (<= ~token~0 ~local~0)) (.cse17 (= 1 ~m_i~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (= 1 ~t1_pc~0)) (.cse18 (= 1 ~t1_i~0))) (let ((.cse3 (= 1 |old(~m_pc~0)|)) (.cse0 (not .cse18)) (.cse12 (not .cse9)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse14 (and .cse4 .cse18 .cse19 .cse5 .cse6 .cse9 .cse17 .cse7 .cse8)) (.cse10 (= 0 ~E_M~0)) (.cse15 (and .cse4 .cse18 .cse19 .cse6 .cse9 (<= 2 ~t1_st~0) .cse17 .cse7 .cse8)) (.cse11 (not .cse17))) (and (or .cse0 .cse1 (not (= 1 |old(~m_st~0)|)) .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) (not (= 0 |old(~t1_st~0)|)) .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse1 .cse13 .cse2 .cse3 .cse14 .cse10 .cse15 .cse11) (let ((.cse16 (+ |old(~local~0)| 1))) (or .cse0 .cse12 .cse1 (not (<= |old(~token~0)| .cse16)) .cse13 .cse2 (not (<= .cse16 |old(~token~0)|)) .cse14 .cse10 .cse15 .cse11)))))) [2020-07-07 14:08:55,081 INFO L264 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: (let ((.cse5 (= 1 ~E_M~0))) (let ((.cse9 (= 0 ~E_M~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~token~0 ~local~0)) (.cse3 (= 0 ~t1_st~0)) (.cse18 (not .cse5)) (.cse16 (= 1 ~m_i~0)) (.cse4 (<= ~local~0 ~token~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse17 (= 1 ~t1_i~0))) (let ((.cse0 (not .cse17)) (.cse11 (not .cse8)) (.cse12 (and .cse1 .cse17 .cse2 .cse3 .cse18 .cse8 .cse16 .cse4)) (.cse14 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (= 1 |old(~m_pc~0)|)) (.cse15 (and .cse1 (= |old(~t1_st~0)| ~t1_st~0) .cse17 (= ~m_st~0 |old(~m_st~0)|) (not .cse9) .cse2 .cse18 .cse8 (<= 2 ~t1_st~0) .cse16 .cse4)) (.cse10 (not .cse16))) (and (or .cse0 (and .cse1 (= 1 ~m_st~0) .cse2 .cse3 .cse4) .cse5 (not (= 1 |old(~m_st~0)|)) .cse6 .cse7 (not (= 0 |old(~t1_st~0)|)) .cse8 .cse9 .cse10) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse0 .cse11 .cse5 .cse12 (not (<= |old(~token~0)| .cse13)) .cse14 .cse6 .cse15 (not (<= .cse13 |old(~token~0)|)) .cse9 .cse10)) (or .cse0 .cse11 .cse5 .cse12 .cse14 .cse6 .cse7 .cse15 .cse9 .cse10))))) [2020-07-07 14:08:55,081 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (let ((.cse14 (= 1 ~t1_pc~0))) (let ((.cse8 (not (= 1 ~m_pc~0))) (.cse5 (= 1 |old(~m_pc~0)|)) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not .cse14)) (.cse2 (= 1 ~E_M~0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= 0 ~E_M~0)) (.cse7 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (or .cse0 (and .cse8 (= 1 ~m_st~0) .cse11 (= 0 ~t1_st~0) .cse12 .cse13) .cse2 (not (= 1 |old(~m_st~0)|)) .cse4 .cse5 (not (= 0 |old(~t1_st~0)|)) .cse14 .cse6 .cse7) (let ((.cse15 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 (and .cse9 .cse10 .cse11 .cse12 .cse13) (not (<= |old(~token~0)| .cse15)) .cse3 .cse4 (not (<= .cse15 |old(~token~0)|)) .cse6 .cse7))))) [2020-07-07 14:08:55,082 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse4 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~local~0 |old(~local~0)|)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse8 (= 1 ~t1_pc~0))) (let ((.cse3 (= 1 |old(~m_pc~0)|)) (.cse0 (not (= 1 ~t1_i~0))) (.cse11 (not .cse8)) (.cse1 (= 1 ~E_M~0)) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse13 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) .cse4 .cse5 .cse6 .cse7)) (.cse9 (= 0 ~E_M~0)) (.cse10 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (not (= 1 |old(~m_st~0)|)) .cse2 .cse3 (and (= 1 ~m_st~0) .cse4 .cse5 .cse6 (= 0 ~t1_st~0) .cse7) (not (= 0 |old(~t1_st~0)|)) .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse1 .cse12 .cse13 .cse2 .cse3 .cse9 .cse10) (let ((.cse14 (+ |old(~local~0)| 1))) (or .cse0 .cse11 .cse1 (not (<= |old(~token~0)| .cse14)) .cse12 .cse2 .cse13 (not (<= .cse14 |old(~token~0)|)) .cse9 .cse10))))) [2020-07-07 14:08:55,082 INFO L264 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse13 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse13)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse0 (not (= 1 ~t1_i~0))) (.cse6 (not (= 1 ~m_pc~0))) (.cse9 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= 1 ~E_M~0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (= 1 |old(~m_pc~0)|)) (.cse10 (= 0 ~E_M~0)) (.cse11 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) (let ((.cse12 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse12)) .cse3 .cse4 (not (<= .cse12 |old(~token~0)|)) .cse10 (and .cse7 .cse8 .cse9) .cse11)) (or .cse0 (and .cse6 (= 1 ~m_st~0) .cse9 (= 0 ~t1_st~0)) .cse2 (not (= 1 |old(~m_st~0)|)) .cse4 .cse5 (not (= 0 |old(~t1_st~0)|)) .cse13 .cse10 .cse11)))) [2020-07-07 14:08:55,082 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse4 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~local~0 |old(~local~0)|)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse8 (= 1 ~t1_pc~0))) (let ((.cse3 (= 1 |old(~m_pc~0)|)) (.cse0 (not (= 1 ~t1_i~0))) (.cse11 (not .cse8)) (.cse1 (= 1 ~E_M~0)) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse13 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) .cse4 .cse5 .cse6 .cse7)) (.cse9 (= 0 ~E_M~0)) (.cse10 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (not (= 1 |old(~m_st~0)|)) .cse2 .cse3 (and (= 1 ~m_st~0) .cse4 .cse5 .cse6 (= 0 ~t1_st~0) .cse7) (not (= 0 |old(~t1_st~0)|)) .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse1 .cse12 .cse13 .cse2 .cse3 .cse9 .cse10) (let ((.cse14 (+ |old(~local~0)| 1))) (or .cse0 .cse11 .cse1 (not (<= |old(~token~0)| .cse14)) .cse12 .cse2 .cse13 (not (<= .cse14 |old(~token~0)|)) .cse9 .cse10))))) [2020-07-07 14:08:55,082 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse8 (= 1 ~t1_pc~0))) (let ((.cse5 (= 1 |old(~m_pc~0)|)) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not .cse8)) (.cse2 (= 1 ~E_M~0)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= 0 ~E_M~0)) (.cse7 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse2 (not (= 1 |old(~m_st~0)|)) .cse4 .cse5 (not (= 0 |old(~t1_st~0)|)) .cse8 .cse6 .cse7) (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse9)) .cse3 .cse4 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 |old(~m_pc~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= |old(~token~0)| ~token~0)) (not (<= .cse9 |old(~token~0)|)) .cse6 .cse7))))) [2020-07-07 14:08:55,083 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse1 (= 1 ~E_M~0))) (let ((.cse4 (<= 2 ~E_1~0)) (.cse19 (not .cse1)) (.cse5 (= 0 ~t1_st~0)) (.cse6 (<= ~token~0 ~local~0)) (.cse17 (= 1 ~m_i~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~m_st~0)) (.cse9 (= 1 ~t1_pc~0)) (.cse18 (= 1 ~t1_i~0))) (let ((.cse3 (= 1 |old(~m_pc~0)|)) (.cse0 (not .cse18)) (.cse12 (not .cse9)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse14 (and .cse4 .cse18 .cse19 .cse5 .cse6 .cse9 .cse17 .cse7 .cse8)) (.cse10 (= 0 ~E_M~0)) (.cse15 (and .cse4 .cse18 .cse19 .cse6 .cse9 (<= 2 ~t1_st~0) .cse17 .cse7 .cse8)) (.cse11 (not .cse17))) (and (or .cse0 .cse1 (not (= 1 |old(~m_st~0)|)) .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) (not (= 0 |old(~t1_st~0)|)) .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse1 .cse13 .cse2 .cse3 .cse14 .cse10 .cse15 .cse11) (let ((.cse16 (+ |old(~local~0)| 1))) (or .cse0 .cse12 .cse1 (not (<= |old(~token~0)| .cse16)) .cse13 .cse2 (not (<= .cse16 |old(~token~0)|)) .cse14 .cse10 .cse15 .cse11)))))) [2020-07-07 14:08:55,083 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse8 (= 1 ~t1_pc~0))) (let ((.cse5 (= 1 |old(~m_pc~0)|)) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not .cse8)) (.cse2 (= 1 ~E_M~0)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= 0 ~E_M~0)) (.cse7 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse2 (not (= 1 |old(~m_st~0)|)) .cse4 .cse5 (not (= 0 |old(~t1_st~0)|)) .cse8 .cse6 .cse7) (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse9)) .cse3 .cse4 (not (<= .cse9 |old(~token~0)|)) .cse6 .cse7))))) [2020-07-07 14:08:55,083 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse4 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~local~0 |old(~local~0)|)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse8 (= 1 ~t1_pc~0))) (let ((.cse3 (= 1 |old(~m_pc~0)|)) (.cse0 (not (= 1 ~t1_i~0))) (.cse11 (not .cse8)) (.cse1 (= 1 ~E_M~0)) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse13 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) .cse4 .cse5 .cse6 .cse7)) (.cse9 (= 0 ~E_M~0)) (.cse10 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (not (= 1 |old(~m_st~0)|)) .cse2 .cse3 (and (= 1 ~m_st~0) .cse4 .cse5 .cse6 (= 0 ~t1_st~0) .cse7) (not (= 0 |old(~t1_st~0)|)) .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse1 .cse12 .cse13 .cse2 .cse3 .cse9 .cse10) (let ((.cse14 (+ |old(~local~0)| 1))) (or .cse0 .cse11 .cse1 (not (<= |old(~token~0)| .cse14)) .cse12 .cse2 .cse13 (not (<= .cse14 |old(~token~0)|)) .cse9 .cse10))))) [2020-07-07 14:08:55,084 INFO L264 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (let ((.cse1 (= 1 ~E_M~0))) (let ((.cse6 (<= 2 ~E_1~0)) (.cse5 (= 0 ~E_M~0)) (.cse7 (= 0 ~t1_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse18 (not .cse1)) (.cse16 (= 1 ~m_i~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse4 (= 1 ~t1_pc~0)) (.cse17 (= 1 ~t1_i~0))) (let ((.cse0 (not .cse17)) (.cse11 (not .cse4)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (and .cse6 .cse17 (not .cse5) .cse7 .cse8 .cse18 .cse4 .cse16 .cse9)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse15 (and .cse6 .cse17 (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) .cse8 .cse18 .cse4 (<= 2 ~t1_st~0) .cse16 .cse9)) (.cse3 (= 1 |old(~m_pc~0)|)) (.cse10 (not .cse16))) (and (or .cse0 .cse1 (not (= 1 |old(~m_st~0)|)) .cse2 .cse3 (not (= 0 |old(~t1_st~0)|)) .cse4 .cse5 (and .cse6 (= 1 ~m_st~0) .cse7 .cse8 .cse9) .cse10) (let ((.cse12 (+ |old(~local~0)| 1))) (or .cse0 .cse11 .cse1 (not (<= |old(~token~0)| .cse12)) .cse13 .cse14 .cse2 .cse15 (not (<= .cse12 |old(~token~0)|)) .cse5 .cse10)) (or .cse0 .cse11 .cse1 .cse13 .cse14 .cse2 .cse15 .cse3 .cse5 .cse10))))) [2020-07-07 14:08:55,084 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse7 (= 1 ~t1_pc~0))) (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse10 (not .cse7)) (.cse1 (= 1 ~E_M~0)) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= 1 |old(~m_pc~0)|)) (.cse2 (not (= 1 ~m_pc~0))) (.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (<= ~local~0 ~token~0)) (.cse8 (= 0 ~E_M~0)) (.cse9 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (and .cse2 (= 1 ~m_st~0) (= 0 ~t1_st~0) .cse3 .cse4) (not (= 1 |old(~m_st~0)|)) .cse5 .cse6 (not (= 0 |old(~t1_st~0)|)) .cse7 .cse8 .cse9) (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse0 .cse10 .cse1 (not (<= |old(~token~0)| .cse11)) .cse12 .cse5 (not (<= .cse11 |old(~token~0)|)) .cse8 (and .cse13 .cse14 .cse3 .cse4) .cse9)) (or .cse0 .cse10 .cse1 .cse12 .cse5 .cse6 (and .cse2 .cse13 .cse14 .cse3 .cse4) .cse8 .cse9)))) [2020-07-07 14:08:55,085 INFO L264 CegarLoopResult]: At program point L51-1(line 51) the Hoare annotation is: (let ((.cse3 (= 1 ~E_M~0)) (.cse8 (= 0 ~E_M~0))) (let ((.cse13 (= 0 ~t1_st~0)) (.cse16 (= 1 ~t1_i~0)) (.cse17 (not .cse8)) (.cse18 (not .cse3)) (.cse12 (<= ~token~0 ~local~0)) (.cse15 (= 1 ~m_i~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse11 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse11)) (.cse2 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) .cse16 .cse17 .cse18 .cse12 .cse11 (<= 2 ~t1_st~0) .cse15 .cse14)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (and .cse16 .cse17 .cse13 .cse12 .cse18 .cse11 .cse15 .cse14)) (.cse0 (not .cse16)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse10 (= 1 |old(~m_pc~0)|)) (.cse9 (not .cse15))) (and (let ((.cse4 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~token~0)| .cse4)) .cse5 .cse6 .cse7 (not (<= .cse4 |old(~token~0)|)) .cse8 .cse9)) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse10 .cse8 .cse9) (or .cse0 .cse3 (not (= 1 |old(~m_st~0)|)) .cse7 .cse10 (not (= 0 |old(~t1_st~0)|)) .cse11 .cse8 (and (= 1 ~m_st~0) .cse12 .cse13 .cse14) .cse9))))) [2020-07-07 14:08:55,085 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (let ((.cse13 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse13)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse0 (not (= 1 ~t1_i~0))) (.cse6 (not (= 1 ~m_pc~0))) (.cse9 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= 1 ~E_M~0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (= 1 |old(~m_pc~0)|)) (.cse10 (= 0 ~E_M~0)) (.cse11 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) (let ((.cse12 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse12)) .cse3 .cse4 (not (<= .cse12 |old(~token~0)|)) .cse10 (and .cse7 .cse8 .cse9) .cse11)) (or .cse0 (and .cse6 (= 1 ~m_st~0) .cse9 (= 0 ~t1_st~0)) .cse2 (not (= 1 |old(~m_st~0)|)) .cse4 .cse5 (not (= 0 |old(~t1_st~0)|)) .cse13 .cse10 .cse11)))) [2020-07-07 14:08:55,085 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse4 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~local~0 |old(~local~0)|)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse8 (= 1 ~t1_pc~0))) (let ((.cse3 (= 1 |old(~m_pc~0)|)) (.cse0 (not (= 1 ~t1_i~0))) (.cse11 (not .cse8)) (.cse1 (= 1 ~E_M~0)) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse13 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) .cse4 .cse5 .cse6 .cse7)) (.cse9 (= 0 ~E_M~0)) (.cse10 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (not (= 1 |old(~m_st~0)|)) .cse2 .cse3 (and (= 1 ~m_st~0) .cse4 .cse5 .cse6 (= 0 ~t1_st~0) .cse7) (not (= 0 |old(~t1_st~0)|)) .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse1 .cse12 .cse13 .cse2 .cse3 .cse9 .cse10) (let ((.cse14 (+ |old(~local~0)| 1))) (or .cse0 .cse11 .cse1 (not (<= |old(~token~0)| .cse14)) .cse12 .cse2 .cse13 (not (<= .cse14 |old(~token~0)|)) .cse9 .cse10))))) [2020-07-07 14:08:55,085 INFO L264 CegarLoopResult]: At program point L37(lines 37 41) the Hoare annotation is: (let ((.cse4 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse6 (= ~local~0 |old(~local~0)|)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse8 (= 1 ~t1_pc~0))) (let ((.cse3 (= 1 |old(~m_pc~0)|)) (.cse0 (not (= 1 ~t1_i~0))) (.cse11 (not .cse8)) (.cse1 (= 1 ~E_M~0)) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse13 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) .cse4 .cse5 .cse6 .cse7)) (.cse9 (= 0 ~E_M~0)) (.cse10 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (not (= 1 |old(~m_st~0)|)) .cse2 .cse3 (and (= 1 ~m_st~0) .cse4 .cse5 .cse6 (= 0 ~t1_st~0) .cse7) (not (= 0 |old(~t1_st~0)|)) .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse1 .cse12 .cse13 .cse2 .cse3 .cse9 .cse10) (let ((.cse14 (+ |old(~local~0)| 1))) (or .cse0 .cse11 .cse1 (not (<= |old(~token~0)| .cse14)) .cse12 .cse2 .cse13 (not (<= .cse14 |old(~token~0)|)) .cse9 .cse10))))) [2020-07-07 14:08:55,085 INFO L271 CegarLoopResult]: At program point fire_time_eventsEXIT(lines 337 345) the Hoare annotation is: true [2020-07-07 14:08:55,086 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (= 1 ~E_M~0)) (.cse7 (= 0 ~E_M~0)) (.cse8 (not (<= ~local~0 ~token~0))) (.cse5 (= ~M_E~0 |old(~M_E~0)|)) (.cse6 (not (<= 2 ~m_st~0))) (.cse9 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 ~t1_st~0)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ~t1_st~0)) .cse9) (or .cse5 .cse6 (= 1 ~m_pc~0) .cse9))) [2020-07-07 14:08:55,086 INFO L271 CegarLoopResult]: At program point fire_time_eventsFINAL(lines 337 345) the Hoare annotation is: true [2020-07-07 14:08:55,086 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 2 ~E_1~0) (= 0 ~m_st~0) (not (= 1 ~t1_i~0)) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (not (= 0 ~E_M~0)) (= 0 ~t1_st~0) (not (= 1 ~E_M~0)) (not (= 1 ~m_i~0))) [2020-07-07 14:08:55,086 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (<= 2 ~E_1~0) (= 0 ~m_st~0) (not (= 1 ~t1_i~0)) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (not (= 0 ~E_M~0)) (= 0 ~t1_st~0) (not (= 1 ~E_M~0)) (not (= 1 ~m_i~0))) [2020-07-07 14:08:55,086 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= 2 ~E_1~0) (= 0 ~m_st~0) (not (= 1 ~t1_i~0)) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (not (= 0 ~E_M~0)) (= 0 ~t1_st~0) (not (= 1 ~E_M~0)) (not (= 1 ~m_i~0)) (= |old(~token~0)| ~token~0)) [2020-07-07 14:08:55,086 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= 0 ~m_st~0) (not (= 1 ~t1_i~0)) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (not (= 0 ~E_M~0)) (= 0 ~t1_st~0) (not (= 1 ~E_M~0)) (not (= 1 ~m_i~0)) (= |old(~token~0)| ~token~0)) [2020-07-07 14:08:55,086 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (= 0 ~m_st~0) (not (= 1 ~t1_i~0)) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (= 0 ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (not (= 1 ~m_i~0)) (= |old(~token~0)| ~token~0)) [2020-07-07 14:08:55,087 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= 0 ~m_st~0) (not (= 1 ~t1_i~0)) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (= 0 ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (not (= 1 ~m_i~0)) (= |old(~token~0)| ~token~0)) [2020-07-07 14:08:55,087 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (= 0 ~m_st~0) (not (= 1 ~t1_i~0)) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= 0 ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (not (= 1 ~m_i~0)) (= |old(~token~0)| ~token~0)) [2020-07-07 14:08:55,087 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= 0 ~m_st~0) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (= 0 ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (not (= 1 ~m_i~0)) (= |old(~token~0)| ~token~0)) [2020-07-07 14:08:55,087 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (= ~t1_i~0 |old(~t1_i~0)|) (= 0 ~m_st~0) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= 0 ~t1_st~0) (= |old(~m_i~0)| ~m_i~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-07-07 14:08:55,087 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= ~t1_i~0 |old(~t1_i~0)|) (= 0 ~m_st~0) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_1~0 |old(~E_1~0)|) (= |old(~m_i~0)| ~m_i~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-07-07 14:08:55,087 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (= ~t1_i~0 |old(~t1_i~0)|) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (= ~m_st~0 |old(~m_st~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-07-07 14:08:55,087 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (not (= 1 ~m_pc~0)) (= ~m_st~0 |old(~m_st~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~token~0 |old(~token~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-07-07 14:08:55,088 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~token~0 |old(~token~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-07-07 14:08:55,088 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 2 ~E_1~0) (= 0 ~m_st~0) (not (= 1 ~t1_i~0)) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (not (= 0 ~E_M~0)) (= 0 ~t1_st~0) (not (= 1 ~E_M~0)) (not (= 1 ~m_i~0))) [2020-07-07 14:08:55,088 INFO L264 CegarLoopResult]: At program point L225(line 225) the Hoare annotation is: (let ((.cse21 (= 1 ~m_i~0)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (not (= 0 eval_~tmp~0))) (.cse14 (= 0 ~t1_st~0)) (.cse15 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (<= 2 ~m_st~0)) (.cse19 (= 1 |old(~t1_pc~0)|))) (let ((.cse1 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not .cse19)) (.cse0 (not (= 1 ~t1_i~0))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse11 (not (= 0 |old(~t1_st~0)|))) (.cse9 (= 1 |old(~E_M~0)|)) (.cse10 (and .cse12 (not (= 0 ~E_M~0)) .cse13 (not (= 1 ~E_M~0)) .cse14 .cse15 (= 1 ~t1_pc~0) .cse17 .cse18)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse20 (= 1 |old(~m_pc~0)|)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not .cse21)) (.cse8 (and (not (= 1 ~m_pc~0)) .cse21 .cse18))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse9 .cse8) (let ((.cse16 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse4 .cse11 .cse19 (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse13 (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) .cse14 .cse16 (= |old(~token~0)| ~token~0)) .cse7 .cse9 .cse8 .cse10 (not (= 0 |old(~m_st~0)|)) .cse2 .cse20)) (or .cse20 .cse5 .cse7 .cse8)))) [2020-07-07 14:08:55,088 INFO L264 CegarLoopResult]: At program point L213(lines 213 220) the Hoare annotation is: (let ((.cse21 (= 1 |old(~t1_pc~0)|)) (.cse10 (= 0 ~m_st~0)) (.cse23 (= 1 ~t1_i~0)) (.cse12 (not (= 0 eval_~tmp~0))) (.cse13 (= 1 ~t1_pc~0)) (.cse14 (<= 2 ~t1_st~0)) (.cse22 (= 1 ~m_i~0))) (let ((.cse19 (= 1 |old(~m_pc~0)|)) (.cse9 (let ((.cse24 (+ ~local~0 1))) (and (<= 2 ~E_1~0) .cse10 .cse23 (not (= 0 ~E_M~0)) .cse12 (not (= 1 ~E_M~0)) (<= ~token~0 .cse24) (<= .cse24 ~token~0) .cse13 .cse14 .cse22))) (.cse0 (not .cse23)) (.cse2 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse20 (not (= 0 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not .cse21)) (.cse7 (not .cse22)) (.cse8 (= 1 |old(~E_M~0)|))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse17 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= ~E_M~0 |old(~E_M~0)|)) (.cse15 (= |old(~token~0)| ~token~0))) (or .cse9 .cse0 (not (= 0 |old(~m_st~0)|)) (and (let ((.cse11 (not (= 1 ~m_pc~0)))) (or (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse16 (+ |old(~token~0)| 1))) (and .cse10 (<= ~token~0 .cse16) .cse11 (<= .cse16 ~token~0) .cse12 .cse13 .cse14)))) .cse17 .cse18) .cse1 .cse4 .cse19 .cse20 .cse21 (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse12 .cse17 (= ~local~0 |old(~local~0)|) (= 0 ~t1_st~0) .cse18 .cse15) .cse7 .cse8)) (or .cse19 .cse5 .cse7) (or .cse9 .cse0 .cse2 .cse1 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8)))) [2020-07-07 14:08:55,089 INFO L264 CegarLoopResult]: At program point L205(lines 205 209) the Hoare annotation is: (let ((.cse19 (not (= 1 ~m_pc~0))) (.cse27 (= 1 |old(~t1_pc~0)|)) (.cse24 (= 0 ~t1_st~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse25 (<= 2 ~m_st~0)) (.cse23 (<= 2 ~E_1~0)) (.cse18 (= 0 ~m_st~0)) (.cse34 (= 1 ~t1_i~0)) (.cse32 (not (= 0 ~E_M~0))) (.cse20 (not (= 0 eval_~tmp~0))) (.cse33 (not (= 1 ~E_M~0))) (.cse4 (= 1 ~t1_pc~0)) (.cse21 (<= 2 ~t1_st~0)) (.cse31 (= 1 ~m_i~0))) (let ((.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse17 (let ((.cse35 (+ ~local~0 1))) (and .cse23 .cse18 .cse34 .cse32 .cse20 .cse33 (<= ~token~0 .cse35) (<= .cse35 ~token~0) .cse4 .cse21 .cse31))) (.cse0 (not .cse34)) (.cse8 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse11 (= 0 |old(~E_M~0)|)) (.cse26 (not (= 0 |old(~t1_st~0)|))) (.cse15 (= 1 |old(~E_M~0)|)) (.cse28 (and .cse23 .cse32 .cse20 .cse33 .cse24 .cse3 .cse4 .cse6 .cse25)) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse29 (and .cse23 .cse32 .cse33 .cse3 .cse4 .cse21 .cse31 .cse6 .cse25)) (.cse13 (not .cse27)) (.cse30 (= 1 |old(~m_pc~0)|)) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not .cse31)) (.cse16 (and .cse19 .cse31 .cse25))) (and (or .cse0 (and .cse1 (= |old(~t1_st~0)| ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= 2 |old(~t1_st~0)|)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 (and (or (and .cse18 .cse19 .cse20 .cse4 .cse21 .cse7) (let ((.cse22 (+ |old(~token~0)| 1))) (and .cse18 (<= ~token~0 .cse22) .cse19 (<= .cse22 ~token~0) .cse20 .cse4 .cse21))) .cse2 .cse5) (and .cse23 .cse20 .cse24 .cse3 .cse5 .cse6 .cse25) .cse11 .cse26 .cse27 (and (= |old(~t1_pc~0)| ~t1_pc~0) .cse1 (= ~m_pc~0 |old(~m_pc~0)|) .cse20 .cse2 (= ~local~0 |old(~local~0)|) .cse24 .cse5 .cse7) .cse14 .cse15 .cse16 .cse28 (not (= 0 |old(~m_st~0)|)) .cse9 .cse29 .cse30) (or .cse17 .cse0 .cse8 .cse10 .cse11 .cse26 .cse14 .cse15 .cse16 .cse28 .cse9 .cse29 .cse12 .cse13) (or .cse30 .cse12 .cse14 .cse16)))) [2020-07-07 14:08:55,089 INFO L264 CegarLoopResult]: At program point L205-1(lines 200 238) the Hoare annotation is: (let ((.cse20 (not (= 1 ~m_pc~0))) (.cse28 (= 1 |old(~t1_pc~0)|)) (.cse25 (= 0 ~t1_st~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse26 (<= 2 ~m_st~0)) (.cse24 (<= 2 ~E_1~0)) (.cse19 (= 0 ~m_st~0)) (.cse35 (= 1 ~t1_i~0)) (.cse33 (not (= 0 ~E_M~0))) (.cse8 (not (= 0 eval_~tmp~0))) (.cse34 (not (= 1 ~E_M~0))) (.cse21 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse32 (= 1 ~m_i~0))) (let ((.cse5 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (= |old(~token~0)| ~token~0)) (.cse18 (let ((.cse36 (+ ~local~0 1))) (and .cse24 .cse19 .cse35 .cse33 .cse8 .cse34 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse21 .cse22 .cse32))) (.cse0 (not .cse35)) (.cse1 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse27 (not (= 0 |old(~t1_st~0)|))) (.cse16 (= 1 |old(~E_M~0)|)) (.cse29 (and .cse24 .cse33 .cse8 .cse34 .cse25 .cse9 .cse21 .cse11 .cse26)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse31 (and .cse24 .cse33 .cse8 .cse34 .cse9 .cse21 .cse22 .cse11 .cse26)) (.cse14 (not .cse28)) (.cse30 (= 1 |old(~m_pc~0)|)) (.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not .cse32)) (.cse17 (and .cse20 .cse32 .cse26))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 (= |old(~t1_st~0)| ~t1_st~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 (and (or (and .cse19 .cse20 .cse8 .cse21 .cse22 .cse12) (let ((.cse23 (+ |old(~token~0)| 1))) (and .cse19 (<= ~token~0 .cse23) .cse20 (<= .cse23 ~token~0) .cse8 .cse21 .cse22))) .cse7 .cse10) (and .cse24 .cse8 .cse25 .cse9 .cse10 .cse11 .cse26) .cse4 .cse27 .cse28 (and .cse5 .cse6 (= ~m_pc~0 |old(~m_pc~0)|) .cse8 .cse7 (= ~local~0 |old(~local~0)|) .cse25 .cse10 .cse12) .cse15 .cse16 .cse17 .cse29 (not (= 0 |old(~m_st~0)|)) .cse2 .cse30 .cse31) (or .cse18 .cse0 .cse1 .cse3 .cse4 .cse27 .cse15 .cse16 .cse17 .cse29 .cse2 .cse13 .cse31 .cse14) (or .cse30 .cse13 .cse15 .cse17)))) [2020-07-07 14:08:55,090 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse2 (not (= 1 ~m_pc~0))) (.cse17 (= 1 |old(~t1_pc~0)|)) (.cse11 (= 0 ~t1_st~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (<= 2 ~m_st~0)) (.cse10 (<= 2 ~E_1~0)) (.cse1 (= 0 ~m_st~0)) (.cse32 (not (= 0 ~E_M~0))) (.cse3 (not (= 0 eval_~tmp~0))) (.cse33 (not (= 1 ~E_M~0))) (.cse4 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~t1_st~0)) (.cse31 (= 1 ~m_i~0))) (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse27 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse28 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse15 (= 0 |old(~E_M~0)|)) (.cse16 (not (= 0 |old(~t1_st~0)|))) (.cse18 (let ((.cse34 (+ ~local~0 1))) (and .cse10 .cse1 .cse32 .cse3 .cse33 (<= ~token~0 .cse34) (<= .cse34 ~token~0) .cse4 .cse5 .cse31))) (.cse20 (= 1 |old(~E_M~0)|)) (.cse22 (and .cse10 .cse32 .cse3 .cse33 .cse11 .cse12 .cse4 .cse13 .cse14)) (.cse24 (not (<= 2 |old(~E_1~0)|))) (.cse23 (= ~m_st~0 |old(~m_st~0)|)) (.cse8 (= ~E_1~0 |old(~E_1~0)|)) (.cse9 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (= |old(~token~0)| ~token~0)) (.cse26 (and .cse10 .cse32 .cse3 .cse33 .cse12 .cse4 .cse5 .cse13 .cse14)) (.cse30 (not .cse17)) (.cse25 (= 1 |old(~m_pc~0)|)) (.cse29 (not (<= 2 |old(~m_st~0)|))) (.cse19 (not .cse31)) (.cse21 (and .cse2 .cse31 .cse14))) (and (or .cse0 (and (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse7 (+ |old(~token~0)| 1))) (and .cse1 (<= ~token~0 .cse7) .cse2 (<= .cse7 ~token~0) .cse3 .cse4 .cse5))) .cse8 .cse9) (and .cse10 .cse3 .cse11 .cse12 .cse9 .cse13 .cse14) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (not (= 0 |old(~m_st~0)|)) (and (= |old(~t1_pc~0)| ~t1_pc~0) .cse23 (= ~m_pc~0 |old(~m_pc~0)|) .cse8 (= ~local~0 |old(~local~0)|) .cse11 .cse9 .cse6) .cse24 .cse25 .cse26) (or .cse0 (and .cse23 (= |old(~t1_st~0)| ~t1_st~0) .cse8 .cse12 .cse4 .cse9 .cse13 .cse6) (not (<= 2 |old(~t1_st~0)|)) .cse27 .cse24 .cse28 .cse15 .cse29 .cse30 .cse19 .cse20 .cse21) (or .cse0 .cse27 .cse28 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 (and .cse23 .cse8 .cse11 .cse12 .cse4 .cse9 .cse13 .cse6) .cse29 .cse26 .cse30) (or .cse25 .cse29 .cse19 .cse21)))) [2020-07-07 14:08:55,090 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse18 (not (= 1 ~m_pc~0))) (.cse4 (= 1 |old(~t1_pc~0)|)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (not (= 0 eval_~tmp~0))) (.cse7 (<= ~token~0 ~local~0)) (.cse17 (= 1 ~t1_pc~0)) (.cse23 (= 1 ~m_i~0)) (.cse8 (not (= 0 ~t1_st~0))) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (<= 2 ~m_st~0))) (let ((.cse16 (= 1 |old(~m_pc~0)|)) (.cse0 (not (= 1 ~t1_i~0))) (.cse19 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse15 (not (<= 2 |old(~E_1~0)|))) (.cse20 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse1 (= 0 |old(~E_M~0)|)) (.cse2 (and .cse5 (not (= 0 ~E_M~0)) .cse6 (not (= 1 ~E_M~0)) .cse7 .cse17 .cse23 .cse8 .cse10 .cse11)) (.cse3 (not (= 0 |old(~t1_st~0)|))) (.cse21 (not (<= 2 |old(~m_st~0)|))) (.cse22 (not .cse4)) (.cse12 (not .cse23)) (.cse13 (= 1 |old(~E_M~0)|)) (.cse14 (and .cse18 .cse23 .cse11))) (and (let ((.cse9 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14 (not (= 0 |old(~m_st~0)|)) .cse15 .cse16 (and (= 0 ~m_st~0) (not .cse17) .cse18 .cse6 (= ~E_1~0 |old(~E_1~0)|) .cse8 .cse9 (= |old(~token~0)| ~token~0)))) (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse19 .cse15 .cse20 .cse1 .cse21 .cse22 .cse12 .cse14 .cse13) (or .cse16 .cse21 .cse12 .cse14) (or .cse0 .cse19 .cse15 .cse20 .cse1 .cse2 .cse3 .cse21 .cse22 .cse12 .cse13 .cse14)))) [2020-07-07 14:08:55,090 INFO L264 CegarLoopResult]: At program point L226(line 226) the Hoare annotation is: (let ((.cse21 (= 1 ~m_i~0)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (not (= 0 eval_~tmp~0))) (.cse14 (= 0 ~t1_st~0)) (.cse15 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (<= 2 ~m_st~0)) (.cse19 (= 1 |old(~t1_pc~0)|))) (let ((.cse1 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not .cse19)) (.cse0 (not (= 1 ~t1_i~0))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse11 (not (= 0 |old(~t1_st~0)|))) (.cse9 (= 1 |old(~E_M~0)|)) (.cse10 (and .cse12 (not (= 0 ~E_M~0)) .cse13 (not (= 1 ~E_M~0)) .cse14 .cse15 (= 1 ~t1_pc~0) .cse17 .cse18)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse20 (= 1 |old(~m_pc~0)|)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not .cse21)) (.cse8 (and (not (= 1 ~m_pc~0)) .cse21 .cse18))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse9 .cse8) (let ((.cse16 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse4 .cse11 .cse19 (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse13 (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) .cse14 .cse16 (= |old(~token~0)| ~token~0)) .cse7 .cse9 .cse8 .cse10 (not (= 0 |old(~m_st~0)|)) .cse2 .cse20)) (or .cse20 .cse5 .cse7 .cse8)))) [2020-07-07 14:08:55,091 INFO L264 CegarLoopResult]: At program point L226-1(line 226) the Hoare annotation is: (let ((.cse21 (= 1 ~m_i~0)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (not (= 0 eval_~tmp~0))) (.cse14 (= 0 ~t1_st~0)) (.cse15 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (<= 2 ~m_st~0)) (.cse19 (= 1 |old(~t1_pc~0)|))) (let ((.cse1 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not .cse19)) (.cse0 (not (= 1 ~t1_i~0))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse11 (not (= 0 |old(~t1_st~0)|))) (.cse9 (= 1 |old(~E_M~0)|)) (.cse10 (and .cse12 (not (= 0 ~E_M~0)) .cse13 (not (= 1 ~E_M~0)) .cse14 .cse15 (= 1 ~t1_pc~0) .cse17 .cse18)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse20 (= 1 |old(~m_pc~0)|)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not .cse21)) (.cse8 (and (not (= 1 ~m_pc~0)) .cse21 .cse18))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse9 .cse8) (let ((.cse16 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse4 .cse11 .cse19 (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse13 (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) .cse14 .cse16 (= |old(~token~0)| ~token~0)) .cse7 .cse9 .cse8 .cse10 (not (= 0 |old(~m_st~0)|)) .cse2 .cse20)) (or .cse20 .cse5 .cse7 .cse8)))) [2020-07-07 14:08:55,091 INFO L264 CegarLoopResult]: At program point L226-2(line 226) the Hoare annotation is: (let ((.cse21 (= 1 ~m_i~0)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (not (= 0 eval_~tmp~0))) (.cse14 (= 0 ~t1_st~0)) (.cse15 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (<= 2 ~m_st~0)) (.cse19 (= 1 |old(~t1_pc~0)|))) (let ((.cse1 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not .cse19)) (.cse0 (not (= 1 ~t1_i~0))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse11 (not (= 0 |old(~t1_st~0)|))) (.cse9 (= 1 |old(~E_M~0)|)) (.cse10 (and .cse12 (not (= 0 ~E_M~0)) .cse13 (not (= 1 ~E_M~0)) .cse14 .cse15 (= 1 ~t1_pc~0) .cse17 .cse18)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse20 (= 1 |old(~m_pc~0)|)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not .cse21)) (.cse8 (and (not (= 1 ~m_pc~0)) .cse21 .cse18))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse9 .cse8) (let ((.cse16 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse4 .cse11 .cse19 (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse13 (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) .cse14 .cse16 (= |old(~token~0)| ~token~0)) .cse7 .cse9 .cse8 .cse10 (not (= 0 |old(~m_st~0)|)) .cse2 .cse20)) (or .cse20 .cse5 .cse7 .cse8)))) [2020-07-07 14:08:55,091 INFO L264 CegarLoopResult]: At program point evalEXIT(lines 194 244) the Hoare annotation is: (let ((.cse6 (= 1 |old(~t1_pc~0)|)) (.cse14 (<= ~token~0 ~local~0)) (.cse15 (= 1 ~t1_pc~0)) (.cse17 (= 1 ~m_i~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse18 (<= 2 ~m_st~0))) (let ((.cse3 (and (<= 2 ~E_1~0) (not (= 0 ~E_M~0)) (not (= 1 ~E_M~0)) .cse14 .cse15 (<= 2 ~t1_st~0) .cse17 .cse16 .cse18)) (.cse5 (not (= 0 |old(~t1_st~0)|))) (.cse0 (not (= 1 ~t1_i~0))) (.cse10 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse2 (= 0 |old(~E_M~0)|)) (.cse13 (not .cse6)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse4 (= 1 |old(~m_pc~0)|)) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not .cse17)) (.cse9 (and (not (= 1 ~m_pc~0)) .cse17 .cse18))) (and (or .cse0 (not (= 0 |old(~m_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse3 .cse11 .cse2 .cse5 .cse12 .cse13 .cse7 .cse9 .cse8) (or .cse0 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~E_1~0 |old(~E_1~0)|) .cse14 .cse15 (= ~E_M~0 |old(~E_M~0)|) .cse16 (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~t1_st~0)|)) .cse10 .cse1 .cse11 .cse2 .cse12 .cse13 .cse7 .cse8 .cse9) (or .cse4 .cse12 .cse7 .cse9)))) [2020-07-07 14:08:55,092 INFO L264 CegarLoopResult]: At program point L210(lines 200 238) the Hoare annotation is: (let ((.cse20 (not (= 1 ~m_pc~0))) (.cse28 (= 1 |old(~t1_pc~0)|)) (.cse25 (= 0 ~t1_st~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse26 (<= 2 ~m_st~0)) (.cse24 (<= 2 ~E_1~0)) (.cse19 (= 0 ~m_st~0)) (.cse35 (= 1 ~t1_i~0)) (.cse33 (not (= 0 ~E_M~0))) (.cse8 (not (= 0 eval_~tmp~0))) (.cse34 (not (= 1 ~E_M~0))) (.cse21 (= 1 ~t1_pc~0)) (.cse22 (<= 2 ~t1_st~0)) (.cse32 (= 1 ~m_i~0))) (let ((.cse5 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (= |old(~token~0)| ~token~0)) (.cse18 (let ((.cse36 (+ ~local~0 1))) (and .cse24 .cse19 .cse35 .cse33 .cse8 .cse34 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse21 .cse22 .cse32))) (.cse0 (not .cse35)) (.cse1 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse27 (not (= 0 |old(~t1_st~0)|))) (.cse16 (= 1 |old(~E_M~0)|)) (.cse29 (and .cse24 .cse33 .cse8 .cse34 .cse25 .cse9 .cse21 .cse11 .cse26)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse31 (and .cse24 .cse33 .cse8 .cse34 .cse9 .cse21 .cse22 .cse11 .cse26)) (.cse14 (not .cse28)) (.cse30 (= 1 |old(~m_pc~0)|)) (.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not .cse32)) (.cse17 (and .cse20 .cse32 .cse26))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 (= |old(~t1_st~0)| ~t1_st~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 (and (or (and .cse19 .cse20 .cse8 .cse21 .cse22 .cse12) (let ((.cse23 (+ |old(~token~0)| 1))) (and .cse19 (<= ~token~0 .cse23) .cse20 (<= .cse23 ~token~0) .cse8 .cse21 .cse22))) .cse7 .cse10) (and .cse24 .cse8 .cse25 .cse9 .cse10 .cse11 .cse26) .cse4 .cse27 .cse28 (and .cse5 .cse6 (= ~m_pc~0 |old(~m_pc~0)|) .cse8 .cse7 (= ~local~0 |old(~local~0)|) .cse25 .cse10 .cse12) .cse15 .cse16 .cse17 .cse29 (not (= 0 |old(~m_st~0)|)) .cse2 .cse30 .cse31) (or .cse18 .cse0 .cse1 .cse3 .cse4 .cse27 .cse15 .cse16 .cse17 .cse29 .cse2 .cse13 .cse31 .cse14) (or .cse30 .cse13 .cse15 .cse17)))) [2020-07-07 14:08:55,092 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse6 (= 1 |old(~t1_pc~0)|)) (.cse14 (<= ~token~0 ~local~0)) (.cse15 (= 1 ~t1_pc~0)) (.cse17 (= 1 ~m_i~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse18 (<= 2 ~m_st~0))) (let ((.cse3 (and (<= 2 ~E_1~0) (not (= 0 ~E_M~0)) (not (= 1 ~E_M~0)) .cse14 .cse15 (<= 2 ~t1_st~0) .cse17 .cse16 .cse18)) (.cse5 (not (= 0 |old(~t1_st~0)|))) (.cse0 (not (= 1 ~t1_i~0))) (.cse10 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse2 (= 0 |old(~E_M~0)|)) (.cse13 (not .cse6)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse4 (= 1 |old(~m_pc~0)|)) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not .cse17)) (.cse9 (and (not (= 1 ~m_pc~0)) .cse17 .cse18))) (and (or .cse0 (not (= 0 |old(~m_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse3 .cse11 .cse2 .cse5 .cse12 .cse13 .cse7 .cse9 .cse8) (or .cse0 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= ~E_1~0 |old(~E_1~0)|) .cse14 .cse15 (= ~E_M~0 |old(~E_M~0)|) .cse16 (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~t1_st~0)|)) .cse10 .cse1 .cse11 .cse2 .cse12 .cse13 .cse7 .cse8 .cse9) (or .cse4 .cse12 .cse7 .cse9)))) [2020-07-07 14:08:55,092 INFO L264 CegarLoopResult]: At program point L227(lines 227 234) the Hoare annotation is: (let ((.cse21 (= 1 ~m_i~0)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (not (= 0 eval_~tmp~0))) (.cse14 (= 0 ~t1_st~0)) (.cse15 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (<= 2 ~m_st~0)) (.cse19 (= 1 |old(~t1_pc~0)|))) (let ((.cse1 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not .cse19)) (.cse0 (not (= 1 ~t1_i~0))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse11 (not (= 0 |old(~t1_st~0)|))) (.cse9 (= 1 |old(~E_M~0)|)) (.cse10 (and .cse12 (not (= 0 ~E_M~0)) .cse13 (not (= 1 ~E_M~0)) .cse14 .cse15 (= 1 ~t1_pc~0) .cse17 .cse18)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse20 (= 1 |old(~m_pc~0)|)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not .cse21)) (.cse8 (and (not (= 1 ~m_pc~0)) .cse21 .cse18))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse9 .cse8) (let ((.cse16 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse4 .cse11 .cse19 (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse13 (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) .cse14 .cse16 (= |old(~token~0)| ~token~0)) .cse7 .cse9 .cse8 .cse10 (not (= 0 |old(~m_st~0)|)) .cse2 .cse20)) (or .cse20 .cse5 .cse7 .cse8)))) [2020-07-07 14:08:55,093 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse23 (= 1 |old(~t1_pc~0)|))) (let ((.cse5 (<= ~token~0 ~local~0)) (.cse6 (= 1 ~t1_pc~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse10 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse12 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse16 (not .cse23)) (.cse9 (not (= 1 ~t1_i~0))) (.cse4 (= 0 ~t1_st~0)) (.cse11 (not (<= 2 |old(~E_1~0)|))) (.cse13 (= 0 |old(~E_M~0)|)) (.cse14 (not (= 0 |old(~t1_st~0)|))) (.cse18 (= 1 |old(~E_M~0)|)) (.cse22 (= 1 |old(~m_pc~0)|)) (.cse20 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse1 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= ~local~0 |old(~local~0)|)) (.cse7 (= ~E_M~0 |old(~E_M~0)|)) (.cse21 (= |old(~token~0)| ~token~0)) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (= 1 ~m_i~0)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse9 (not (<= 2 |old(~t1_st~0)|)) (and .cse0 .cse19 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (or .cse9 (not (= 0 |old(~m_st~0)|)) (and .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse21) .cse11 .cse22 .cse13 .cse14 .cse23 .cse17 .cse18) (or .cse22 (and .cse20 .cse0 .cse19 .cse1 .cse2 .cse3 .cse7 .cse21) .cse15 .cse17)))) [2020-07-07 14:08:55,093 INFO L264 CegarLoopResult]: At program point L215(line 215) the Hoare annotation is: (let ((.cse17 (= 0 ~m_st~0)) (.cse13 (not (= 0 eval_~tmp~0))) (.cse20 (= 1 ~t1_pc~0)) (.cse21 (<= 2 ~t1_st~0)) (.cse22 (= 1 ~m_i~0)) (.cse12 (= 1 |old(~t1_pc~0)|))) (let ((.cse2 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not .cse12)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse9 (let ((.cse23 (+ ~local~0 1))) (and (<= 2 ~E_1~0) .cse17 (not (= 0 ~E_M~0)) .cse13 (<= ~token~0 .cse23) (<= .cse23 ~token~0) (not (= 1 ~E_M~0)) .cse20 .cse21 .cse22))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse11 (= 1 |old(~m_pc~0)|)) (.cse10 (not (= 0 |old(~t1_st~0)|))) (.cse7 (not .cse22)) (.cse8 (= 1 |old(~E_M~0)|))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse2 .cse1 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 .cse8) (or .cse11 .cse5 .cse7) (let ((.cse14 (= ~E_1~0 |old(~E_1~0)|)) (.cse15 (= ~E_M~0 |old(~E_M~0)|)) (.cse16 (= |old(~token~0)| ~token~0))) (or .cse9 .cse0 (not (= 0 |old(~m_st~0)|)) .cse1 .cse4 .cse11 .cse10 .cse12 (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse13 .cse14 (= ~local~0 |old(~local~0)|) (= 0 ~t1_st~0) .cse15 .cse16) (and .cse13 .cse14 .cse15 (let ((.cse19 (not (= 1 ~m_pc~0)))) (or (let ((.cse18 (+ |old(~token~0)| 1))) (and .cse17 (<= ~token~0 .cse18) .cse19 (<= .cse18 ~token~0) .cse20 .cse21)) (and .cse17 .cse19 .cse20 .cse21 .cse16)))) .cse7 .cse8))))) [2020-07-07 14:08:55,093 INFO L264 CegarLoopResult]: At program point L211(line 211) the Hoare annotation is: (let ((.cse21 (= 1 |old(~t1_pc~0)|)) (.cse10 (= 0 ~m_st~0)) (.cse23 (= 1 ~t1_i~0)) (.cse12 (not (= 0 eval_~tmp~0))) (.cse13 (= 1 ~t1_pc~0)) (.cse14 (<= 2 ~t1_st~0)) (.cse22 (= 1 ~m_i~0))) (let ((.cse19 (= 1 |old(~m_pc~0)|)) (.cse9 (let ((.cse24 (+ ~local~0 1))) (and (<= 2 ~E_1~0) .cse10 .cse23 (not (= 0 ~E_M~0)) .cse12 (not (= 1 ~E_M~0)) (<= ~token~0 .cse24) (<= .cse24 ~token~0) .cse13 .cse14 .cse22))) (.cse0 (not .cse23)) (.cse2 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse20 (not (= 0 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not .cse21)) (.cse7 (not .cse22)) (.cse8 (= 1 |old(~E_M~0)|))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse17 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= ~E_M~0 |old(~E_M~0)|)) (.cse15 (= |old(~token~0)| ~token~0))) (or .cse9 .cse0 (not (= 0 |old(~m_st~0)|)) (and (let ((.cse11 (not (= 1 ~m_pc~0)))) (or (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse16 (+ |old(~token~0)| 1))) (and .cse10 (<= ~token~0 .cse16) .cse11 (<= .cse16 ~token~0) .cse12 .cse13 .cse14)))) .cse17 .cse18) .cse1 .cse4 .cse19 .cse20 .cse21 (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse12 .cse17 (= ~local~0 |old(~local~0)|) (= 0 ~t1_st~0) .cse18 .cse15) .cse7 .cse8)) (or .cse19 .cse5 .cse7) (or .cse9 .cse0 .cse2 .cse1 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8)))) [2020-07-07 14:08:55,094 INFO L264 CegarLoopResult]: At program point L203(line 203) the Hoare annotation is: (let ((.cse28 (not (= 1 ~m_pc~0))) (.cse23 (= 1 |old(~t1_pc~0)|)) (.cse20 (= 0 ~t1_st~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse33 (= 1 ~m_i~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse21 (<= 2 ~m_st~0)) (.cse17 (<= 2 ~E_1~0)) (.cse26 (= 0 ~m_st~0)) (.cse34 (not (= 0 ~E_M~0))) (.cse18 (not (= 0 |eval_#t~ret1|))) (.cse19 (not (= 0 eval_~tmp~0))) (.cse35 (not (= 1 ~E_M~0))) (.cse4 (= 1 ~t1_pc~0)) (.cse29 (<= 2 ~t1_st~0))) (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse8 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse11 (= 0 |old(~E_M~0)|)) (.cse22 (not (= 0 |old(~t1_st~0)|))) (.cse25 (let ((.cse36 (+ ~local~0 1))) (and .cse17 .cse26 .cse34 .cse18 .cse19 .cse35 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse4 .cse29))) (.cse15 (= 1 |old(~E_M~0)|)) (.cse24 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse31 (and .cse17 .cse34 .cse18 .cse19 .cse35 .cse20 .cse3 .cse4 .cse33 .cse6 .cse21)) (.cse32 (and .cse17 .cse34 .cse19 .cse35 .cse3 .cse4 .cse29 .cse6 .cse21)) (.cse13 (not .cse23)) (.cse30 (= 1 |old(~m_pc~0)|)) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not .cse33)) (.cse16 (and .cse28 .cse33 .cse21))) (and (or .cse0 (and .cse1 (= |old(~t1_st~0)| ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= 2 |old(~t1_st~0)|)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or (and .cse17 .cse18 .cse19 .cse20 .cse3 .cse5 .cse6 .cse21) .cse0 .cse11 .cse22 .cse23 (and .cse24 .cse1 (= ~m_pc~0 |old(~m_pc~0)|) .cse18 .cse2 (= ~local~0 |old(~local~0)|) .cse20 .cse5 .cse7) .cse25 (and .cse2 (or (let ((.cse27 (+ |old(~token~0)| 1))) (and .cse26 (<= ~token~0 .cse27) .cse28 (<= .cse27 ~token~0) .cse18 .cse19 .cse4 .cse29)) (and .cse26 .cse28 .cse18 .cse19 .cse4 .cse29 .cse7)) .cse5) .cse14 .cse15 .cse16 (not (= 0 |old(~m_st~0)|)) .cse9 .cse30 .cse31 .cse32) (or .cse0 .cse8 .cse10 .cse11 .cse22 .cse25 .cse14 .cse15 .cse16 (and .cse24 .cse1 .cse18 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7) .cse9 .cse31 .cse12 .cse32 .cse13) (or .cse30 .cse12 .cse14 .cse16)))) [2020-07-07 14:08:55,094 INFO L264 CegarLoopResult]: At program point L203-1(line 203) the Hoare annotation is: (let ((.cse28 (not (= 1 ~m_pc~0))) (.cse23 (= 1 |old(~t1_pc~0)|)) (.cse20 (= 0 ~t1_st~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse33 (= 1 ~m_i~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse21 (<= 2 ~m_st~0)) (.cse17 (<= 2 ~E_1~0)) (.cse26 (= 0 ~m_st~0)) (.cse34 (not (= 0 ~E_M~0))) (.cse18 (not (= 0 |eval_#t~ret1|))) (.cse19 (not (= 0 eval_~tmp~0))) (.cse35 (not (= 1 ~E_M~0))) (.cse4 (= 1 ~t1_pc~0)) (.cse29 (<= 2 ~t1_st~0))) (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse8 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse11 (= 0 |old(~E_M~0)|)) (.cse22 (not (= 0 |old(~t1_st~0)|))) (.cse25 (let ((.cse36 (+ ~local~0 1))) (and .cse17 .cse26 .cse34 .cse18 .cse19 .cse35 (<= ~token~0 .cse36) (<= .cse36 ~token~0) .cse4 .cse29))) (.cse15 (= 1 |old(~E_M~0)|)) (.cse24 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse31 (and .cse17 .cse34 .cse18 .cse19 .cse35 .cse20 .cse3 .cse4 .cse33 .cse6 .cse21)) (.cse32 (and .cse17 .cse34 .cse19 .cse35 .cse3 .cse4 .cse29 .cse6 .cse21)) (.cse13 (not .cse23)) (.cse30 (= 1 |old(~m_pc~0)|)) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not .cse33)) (.cse16 (and .cse28 .cse33 .cse21))) (and (or .cse0 (and .cse1 (= |old(~t1_st~0)| ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= 2 |old(~t1_st~0)|)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or (and .cse17 .cse18 .cse19 .cse20 .cse3 .cse5 .cse6 .cse21) .cse0 .cse11 .cse22 .cse23 (and .cse24 .cse1 (= ~m_pc~0 |old(~m_pc~0)|) .cse18 .cse2 (= ~local~0 |old(~local~0)|) .cse20 .cse5 .cse7) .cse25 (and .cse2 (or (let ((.cse27 (+ |old(~token~0)| 1))) (and .cse26 (<= ~token~0 .cse27) .cse28 (<= .cse27 ~token~0) .cse18 .cse19 .cse4 .cse29)) (and .cse26 .cse28 .cse18 .cse19 .cse4 .cse29 .cse7)) .cse5) .cse14 .cse15 .cse16 (not (= 0 |old(~m_st~0)|)) .cse9 .cse30 .cse31 .cse32) (or .cse0 .cse8 .cse10 .cse11 .cse22 .cse25 .cse14 .cse15 .cse16 (and .cse24 .cse1 .cse18 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7) .cse9 .cse31 .cse12 .cse32 .cse13) (or .cse30 .cse12 .cse14 .cse16)))) [2020-07-07 14:08:55,095 INFO L264 CegarLoopResult]: At program point L203-2(line 203) the Hoare annotation is: (let ((.cse23 (not (= 1 ~m_pc~0))) (.cse28 (= 1 |old(~t1_pc~0)|)) (.cse20 (= 0 ~t1_st~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse21 (<= 2 ~m_st~0)) (.cse17 (<= 2 ~E_1~0)) (.cse22 (= 0 ~m_st~0)) (.cse33 (not (= 0 ~E_M~0))) (.cse18 (not (= 0 |eval_#t~ret1|))) (.cse19 (not (= 0 eval_~tmp~0))) (.cse34 (not (= 1 ~E_M~0))) (.cse4 (= 1 ~t1_pc~0)) (.cse24 (<= 2 ~t1_st~0)) (.cse32 (= 1 ~m_i~0))) (let ((.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse0 (not (= 1 ~t1_i~0))) (.cse8 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse26 (let ((.cse35 (+ ~local~0 1))) (and .cse17 .cse22 .cse33 .cse18 .cse19 .cse34 (<= ~token~0 .cse35) (<= .cse35 ~token~0) .cse4 .cse24 .cse32))) (.cse10 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse11 (= 0 |old(~E_M~0)|)) (.cse27 (not (= 0 |old(~t1_st~0)|))) (.cse15 (= 1 |old(~E_M~0)|)) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse29 (and .cse17 .cse33 .cse34 .cse3 .cse4 .cse24 .cse32 .cse6 .cse21)) (.cse31 (and .cse17 .cse33 .cse18 .cse19 .cse34 .cse20 .cse3 .cse4 .cse32 .cse6 .cse21)) (.cse13 (not .cse28)) (.cse30 (= 1 |old(~m_pc~0)|)) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not .cse32)) (.cse16 (and .cse23 .cse32 .cse21))) (and (or .cse0 (and .cse1 (= |old(~t1_st~0)| ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= 2 |old(~t1_st~0)|)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or (and .cse17 .cse18 .cse19 .cse20 .cse3 .cse5 .cse6 .cse21) .cse0 (and (or (and .cse22 .cse23 .cse18 .cse19 .cse4 .cse24 .cse7) (let ((.cse25 (+ |old(~token~0)| 1))) (and .cse22 (<= ~token~0 .cse25) .cse23 (<= .cse25 ~token~0) .cse18 .cse19 .cse4 .cse24))) .cse2 .cse5) .cse26 .cse11 .cse27 .cse28 (and (= |old(~t1_pc~0)| ~t1_pc~0) .cse1 (= ~m_pc~0 |old(~m_pc~0)|) .cse18 .cse2 .cse19 (= ~local~0 |old(~local~0)|) .cse20 .cse5 .cse7) .cse14 .cse15 .cse16 (not (= 0 |old(~m_st~0)|)) .cse9 .cse29 .cse30 .cse31) (or .cse0 .cse8 .cse26 .cse10 .cse11 .cse27 .cse14 .cse15 .cse16 .cse9 .cse29 .cse31 .cse12 .cse13) (or .cse30 .cse12 .cse14 .cse16)))) [2020-07-07 14:08:55,095 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse2 (not (= 1 ~m_pc~0))) (.cse17 (= 1 |old(~t1_pc~0)|)) (.cse11 (= 0 ~t1_st~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (<= 2 ~m_st~0)) (.cse10 (<= 2 ~E_1~0)) (.cse1 (= 0 ~m_st~0)) (.cse32 (not (= 0 ~E_M~0))) (.cse3 (not (= 0 eval_~tmp~0))) (.cse33 (not (= 1 ~E_M~0))) (.cse4 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~t1_st~0)) (.cse31 (= 1 ~m_i~0))) (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse27 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse28 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse15 (= 0 |old(~E_M~0)|)) (.cse16 (not (= 0 |old(~t1_st~0)|))) (.cse18 (let ((.cse34 (+ ~local~0 1))) (and .cse10 .cse1 .cse32 .cse3 .cse33 (<= ~token~0 .cse34) (<= .cse34 ~token~0) .cse4 .cse5 .cse31))) (.cse20 (= 1 |old(~E_M~0)|)) (.cse22 (and .cse10 .cse32 .cse3 .cse33 .cse11 .cse12 .cse4 .cse13 .cse14)) (.cse24 (not (<= 2 |old(~E_1~0)|))) (.cse23 (= ~m_st~0 |old(~m_st~0)|)) (.cse8 (= ~E_1~0 |old(~E_1~0)|)) (.cse9 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (= |old(~token~0)| ~token~0)) (.cse26 (and .cse10 .cse32 .cse3 .cse33 .cse12 .cse4 .cse5 .cse13 .cse14)) (.cse30 (not .cse17)) (.cse25 (= 1 |old(~m_pc~0)|)) (.cse29 (not (<= 2 |old(~m_st~0)|))) (.cse19 (not .cse31)) (.cse21 (and .cse2 .cse31 .cse14))) (and (or .cse0 (and (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse7 (+ |old(~token~0)| 1))) (and .cse1 (<= ~token~0 .cse7) .cse2 (<= .cse7 ~token~0) .cse3 .cse4 .cse5))) .cse8 .cse9) (and .cse10 .cse3 .cse11 .cse12 .cse9 .cse13 .cse14) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (not (= 0 |old(~m_st~0)|)) (and (= |old(~t1_pc~0)| ~t1_pc~0) .cse23 (= ~m_pc~0 |old(~m_pc~0)|) .cse8 (= ~local~0 |old(~local~0)|) .cse11 .cse9 .cse6) .cse24 .cse25 .cse26) (or .cse0 (and .cse23 (= |old(~t1_st~0)| ~t1_st~0) .cse8 .cse12 .cse4 .cse9 .cse13 .cse6) (not (<= 2 |old(~t1_st~0)|)) .cse27 .cse24 .cse28 .cse15 .cse29 .cse30 .cse19 .cse20 .cse21) (or .cse0 .cse27 .cse28 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 (and .cse23 .cse8 .cse11 .cse12 .cse4 .cse9 .cse13 .cse6) .cse29 .cse26 .cse30) (or .cse25 .cse29 .cse19 .cse21)))) [2020-07-07 14:08:55,096 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse13 (= 1 |old(~t1_pc~0)|)) (.cse7 (not (= 0 eval_~tmp~0))) (.cse4 (= 1 ~t1_pc~0)) (.cse15 (<= 2 ~t1_st~0)) (.cse22 (= 1 ~m_i~0)) (.cse23 (= 1 ~t1_i~0))) (let ((.cse11 (= 1 |old(~m_pc~0)|)) (.cse0 (not .cse23)) (.cse1 (let ((.cse24 (+ ~local~0 1))) (and (<= 2 ~E_1~0) .cse23 (not (= 0 ~E_M~0)) .cse7 (not (= 1 ~E_M~0)) (<= ~token~0 .cse24) (<= .cse24 ~token~0) .cse4 .cse15 .cse22))) (.cse18 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse19 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse3 (= 0 |old(~E_M~0)|)) (.cse12 (not (= 0 |old(~t1_st~0)|))) (.cse20 (not (<= 2 |old(~m_st~0)|))) (.cse21 (not .cse13)) (.cse16 (not .cse22)) (.cse17 (= 1 |old(~E_M~0)|))) (and (let ((.cse6 (= 1 ~m_st~0)) (.cse5 (not (= 1 ~m_pc~0))) (.cse10 (= |old(~token~0)| ~token~0)) (.cse8 (= ~E_1~0 |old(~E_1~0)|)) (.cse9 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 (not (= 0 |old(~m_st~0)|)) .cse1 .cse2 .cse3 (and (not .cse4) .cse5 .cse6 .cse7 .cse8 (= 0 ~t1_st~0) .cse9 .cse10) .cse11 .cse12 .cse13 (and .cse6 (or (let ((.cse14 (+ |old(~token~0)| 1))) (and (<= ~token~0 .cse14) .cse5 (<= .cse14 ~token~0) .cse4 .cse15)) (and .cse5 .cse4 .cse15 .cse10)) .cse7 .cse8 .cse9) .cse16 .cse17)) (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse2 .cse18 .cse19 .cse3 .cse20 .cse21 .cse16 .cse17) (or .cse11 .cse20 .cse16) (or .cse0 .cse1 .cse18 .cse2 .cse19 .cse3 .cse12 .cse20 .cse21 .cse16 .cse17)))) [2020-07-07 14:08:55,096 INFO L264 CegarLoopResult]: At program point L212(line 212) the Hoare annotation is: (let ((.cse21 (= 1 |old(~t1_pc~0)|)) (.cse10 (= 0 ~m_st~0)) (.cse23 (= 1 ~t1_i~0)) (.cse12 (not (= 0 eval_~tmp~0))) (.cse13 (= 1 ~t1_pc~0)) (.cse14 (<= 2 ~t1_st~0)) (.cse22 (= 1 ~m_i~0))) (let ((.cse19 (= 1 |old(~m_pc~0)|)) (.cse9 (let ((.cse24 (+ ~local~0 1))) (and (<= 2 ~E_1~0) .cse10 .cse23 (not (= 0 ~E_M~0)) .cse12 (not (= 1 ~E_M~0)) (<= ~token~0 .cse24) (<= .cse24 ~token~0) .cse13 .cse14 .cse22))) (.cse0 (not .cse23)) (.cse2 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse20 (not (= 0 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not .cse21)) (.cse7 (not .cse22)) (.cse8 (= 1 |old(~E_M~0)|))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse17 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= ~E_M~0 |old(~E_M~0)|)) (.cse15 (= |old(~token~0)| ~token~0))) (or .cse9 .cse0 (not (= 0 |old(~m_st~0)|)) (and (let ((.cse11 (not (= 1 ~m_pc~0)))) (or (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse16 (+ |old(~token~0)| 1))) (and .cse10 (<= ~token~0 .cse16) .cse11 (<= .cse16 ~token~0) .cse12 .cse13 .cse14)))) .cse17 .cse18) .cse1 .cse4 .cse19 .cse20 .cse21 (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse12 .cse17 (= ~local~0 |old(~local~0)|) (= 0 ~t1_st~0) .cse18 .cse15) .cse7 .cse8)) (or .cse19 .cse5 .cse7) (or .cse9 .cse0 .cse2 .cse1 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8)))) [2020-07-07 14:08:55,096 INFO L264 CegarLoopResult]: At program point L212-1(line 212) the Hoare annotation is: (let ((.cse21 (= 1 |old(~t1_pc~0)|)) (.cse10 (= 0 ~m_st~0)) (.cse23 (= 1 ~t1_i~0)) (.cse12 (not (= 0 eval_~tmp~0))) (.cse13 (= 1 ~t1_pc~0)) (.cse14 (<= 2 ~t1_st~0)) (.cse22 (= 1 ~m_i~0))) (let ((.cse19 (= 1 |old(~m_pc~0)|)) (.cse9 (let ((.cse24 (+ ~local~0 1))) (and (<= 2 ~E_1~0) .cse10 .cse23 (not (= 0 ~E_M~0)) .cse12 (not (= 1 ~E_M~0)) (<= ~token~0 .cse24) (<= .cse24 ~token~0) .cse13 .cse14 .cse22))) (.cse0 (not .cse23)) (.cse2 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse20 (not (= 0 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not .cse21)) (.cse7 (not .cse22)) (.cse8 (= 1 |old(~E_M~0)|))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse17 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= ~E_M~0 |old(~E_M~0)|)) (.cse15 (= |old(~token~0)| ~token~0))) (or .cse9 .cse0 (not (= 0 |old(~m_st~0)|)) (and (let ((.cse11 (not (= 1 ~m_pc~0)))) (or (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse16 (+ |old(~token~0)| 1))) (and .cse10 (<= ~token~0 .cse16) .cse11 (<= .cse16 ~token~0) .cse12 .cse13 .cse14)))) .cse17 .cse18) .cse1 .cse4 .cse19 .cse20 .cse21 (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse12 .cse17 (= ~local~0 |old(~local~0)|) (= 0 ~t1_st~0) .cse18 .cse15) .cse7 .cse8)) (or .cse19 .cse5 .cse7) (or .cse9 .cse0 .cse2 .cse1 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8)))) [2020-07-07 14:08:55,097 INFO L264 CegarLoopResult]: At program point L212-2(line 212) the Hoare annotation is: (let ((.cse21 (= 1 |old(~t1_pc~0)|)) (.cse10 (= 0 ~m_st~0)) (.cse23 (= 1 ~t1_i~0)) (.cse12 (not (= 0 eval_~tmp~0))) (.cse13 (= 1 ~t1_pc~0)) (.cse14 (<= 2 ~t1_st~0)) (.cse22 (= 1 ~m_i~0))) (let ((.cse19 (= 1 |old(~m_pc~0)|)) (.cse9 (let ((.cse24 (+ ~local~0 1))) (and (<= 2 ~E_1~0) .cse10 .cse23 (not (= 0 ~E_M~0)) .cse12 (not (= 1 ~E_M~0)) (<= ~token~0 .cse24) (<= .cse24 ~token~0) .cse13 .cse14 .cse22))) (.cse0 (not .cse23)) (.cse2 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse20 (not (= 0 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not .cse21)) (.cse7 (not .cse22)) (.cse8 (= 1 |old(~E_M~0)|))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse17 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= ~E_M~0 |old(~E_M~0)|)) (.cse15 (= |old(~token~0)| ~token~0))) (or .cse9 .cse0 (not (= 0 |old(~m_st~0)|)) (and (let ((.cse11 (not (= 1 ~m_pc~0)))) (or (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse16 (+ |old(~token~0)| 1))) (and .cse10 (<= ~token~0 .cse16) .cse11 (<= .cse16 ~token~0) .cse12 .cse13 .cse14)))) .cse17 .cse18) .cse1 .cse4 .cse19 .cse20 .cse21 (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse12 .cse17 (= ~local~0 |old(~local~0)|) (= 0 ~t1_st~0) .cse18 .cse15) .cse7 .cse8)) (or .cse19 .cse5 .cse7) (or .cse9 .cse0 .cse2 .cse1 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8)))) [2020-07-07 14:08:55,097 INFO L264 CegarLoopResult]: At program point L229(line 229) the Hoare annotation is: (let ((.cse12 (<= 2 ~E_1~0)) (.cse13 (not (= 0 eval_~tmp~0))) (.cse14 (= 0 ~t1_st~0)) (.cse15 (<= ~token~0 ~local~0)) (.cse21 (= 1 ~m_i~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (<= 2 ~m_st~0)) (.cse19 (= 1 |old(~t1_pc~0)|))) (let ((.cse1 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse3 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not .cse19)) (.cse0 (not (= 1 ~t1_i~0))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse10 (not (= 0 |old(~t1_st~0)|))) (.cse9 (= 1 |old(~E_M~0)|)) (.cse11 (and .cse12 (not (= 0 ~E_M~0)) .cse13 .cse14 (not (= 1 ~E_M~0)) .cse15 (= 1 ~t1_pc~0) .cse21 .cse17 .cse18)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse20 (= 1 |old(~m_pc~0)|)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not .cse21)) (.cse8 (and (not (= 1 ~m_pc~0)) .cse21 .cse18))) (and (or .cse0 (not (<= 2 |old(~t1_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 .cse9 .cse8 .cse11) (let ((.cse16 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse4 .cse10 .cse19 (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse13 (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) .cse14 .cse16 (= |old(~token~0)| ~token~0)) .cse7 .cse9 .cse11 .cse8 (not (= 0 |old(~m_st~0)|)) .cse2 .cse20)) (or .cse20 .cse5 .cse7 .cse8)))) [2020-07-07 14:08:55,097 INFO L271 CegarLoopResult]: At program point stop_simulationFINAL(lines 384 402) the Hoare annotation is: true [2020-07-07 14:08:55,097 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-07-07 14:08:55,097 INFO L271 CegarLoopResult]: At program point L398(line 398) the Hoare annotation is: true [2020-07-07 14:08:55,097 INFO L271 CegarLoopResult]: At program point L393(line 393) the Hoare annotation is: true [2020-07-07 14:08:55,098 INFO L271 CegarLoopResult]: At program point L392(lines 392 397) the Hoare annotation is: true [2020-07-07 14:08:55,098 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-07-07 14:08:55,098 INFO L271 CegarLoopResult]: At program point stop_simulationEXIT(lines 384 402) the Hoare annotation is: true [2020-07-07 14:08:55,098 INFO L271 CegarLoopResult]: At program point L390-1(line 390) the Hoare annotation is: true [2020-07-07 14:08:55,098 INFO L271 CegarLoopResult]: At program point L390-2(line 390) the Hoare annotation is: true [2020-07-07 14:08:55,098 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-07-07 14:08:55,098 INFO L271 CegarLoopResult]: At program point L390-3(line 390) the Hoare annotation is: true [2020-07-07 14:08:55,098 INFO L271 CegarLoopResult]: At program point L386(line 386) the Hoare annotation is: true [2020-07-07 14:08:55,098 INFO L271 CegarLoopResult]: At program point update_channelsEXIT(lines 148 155) the Hoare annotation is: true [2020-07-07 14:08:55,099 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-07-07 14:08:55,099 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse5 (= 1 ~m_pc~0)) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (and (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (= 1 ~t1_pc~0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (<= 2 ~m_st~0))) (.cse3 (= 0 |old(~E_M~0)|)) (.cse6 (not (= 1 ~m_i~0))) (.cse7 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 (not (= 0 ~m_st~0)) .cse2 .cse3 .cse4 .cse5 (not (= 0 ~t1_st~0)) .cse6 .cse7) (or .cse1 .cse8 .cse5 .cse6) (or .cse0 .cse1 (not .cse4) (not (<= ~token~0 ~local~0)) (not (<= 2 ~t1_st~0)) .cse2 .cse8 .cse3 (not (<= ~local~0 ~token~0)) .cse6 .cse7))) [2020-07-07 14:08:55,099 INFO L264 CegarLoopResult]: At program point L254-1(lines 248 271) the Hoare annotation is: (let ((.cse1 (= 1 ~m_pc~0)) (.cse4 (not (= 1 ~t1_i~0))) (.cse7 (= 1 ~t1_pc~0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (= 0 |old(~E_M~0)|)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (not (= 1 ~m_i~0))) (.cse8 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (not (= 0 ~m_st~0)) .cse5 .cse6 .cse7 .cse1 (not (= 0 ~t1_st~0)) .cse2 .cse3 .cse8) (or .cse4 (not .cse7) (not (<= ~token~0 ~local~0)) (not (<= 2 ~t1_st~0)) .cse5 .cse0 .cse6 (not (<= ~local~0 ~token~0)) .cse2 .cse3 .cse8))) [2020-07-07 14:08:55,099 INFO L264 CegarLoopResult]: At program point L250(line 250) the Hoare annotation is: (let ((.cse5 (= 1 ~m_pc~0)) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (and (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (= 1 ~t1_pc~0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (<= 2 ~m_st~0))) (.cse3 (= 0 |old(~E_M~0)|)) (.cse6 (not (= 1 ~m_i~0))) (.cse7 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 (not (= 0 ~m_st~0)) .cse2 .cse3 .cse4 .cse5 (not (= 0 ~t1_st~0)) .cse6 .cse7) (or .cse1 .cse8 .cse5 .cse6) (or .cse0 .cse1 (not .cse4) (not (<= ~token~0 ~local~0)) (not (<= 2 ~t1_st~0)) .cse2 .cse8 .cse3 (not (<= ~local~0 ~token~0)) .cse6 .cse7))) [2020-07-07 14:08:55,099 INFO L264 CegarLoopResult]: At program point L265(line 265) the Hoare annotation is: (let ((.cse3 (not (<= 2 ~m_st~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse1 (= 1 ~t1_pc~0)) (.cse7 (= 1 ~m_pc~0)) (.cse5 (not (= 1 ~m_i~0))) (.cse6 (= 1 |old(~E_M~0)|))) (and (or .cse0 (not .cse1) (not (<= ~token~0 ~local~0)) (not (<= 2 ~t1_st~0)) .cse2 .cse3 .cse4 (not (<= ~local~0 ~token~0)) .cse5 .cse6) (or (= ~E_1~0 |old(~E_1~0)|) .cse3 .cse7 .cse5) (or .cse0 (not (= 0 ~m_st~0)) .cse2 .cse4 .cse1 .cse7 (not (= 0 ~t1_st~0)) .cse5 .cse6))) [2020-07-07 14:08:55,100 INFO L264 CegarLoopResult]: At program point L259-1(lines 248 271) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse4 (not (= 1 ~t1_i~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (= 0 |old(~E_M~0)|)) (.cse5 (= 1 ~t1_pc~0)) (.cse2 (= 1 ~m_pc~0)) (.cse8 (and .cse0 (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (not (= 1 ~m_i~0))) (.cse9 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (not .cse5) (not (<= ~token~0 ~local~0)) (not (<= 2 ~t1_st~0)) .cse6 .cse1 .cse7 (not (<= ~local~0 ~token~0)) .cse8 .cse3 .cse9) (or .cse4 (not (= 0 ~m_st~0)) .cse6 .cse7 .cse5 .cse2 (not (= 0 ~t1_st~0)) .cse8 .cse3 .cse9)))) [2020-07-07 14:08:55,100 INFO L264 CegarLoopResult]: At program point L255(line 255) the Hoare annotation is: (let ((.cse1 (= 1 ~m_pc~0)) (.cse4 (not (= 1 ~t1_i~0))) (.cse7 (= 1 ~t1_pc~0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (= 0 |old(~E_M~0)|)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (not (= 1 ~m_i~0))) (.cse8 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (not (= 0 ~m_st~0)) .cse5 .cse6 .cse7 .cse1 (not (= 0 ~t1_st~0)) .cse2 .cse3 .cse8) (or .cse4 (not .cse7) (not (<= ~token~0 ~local~0)) (not (<= 2 ~t1_st~0)) .cse5 .cse0 .cse6 (not (<= ~local~0 ~token~0)) .cse2 .cse3 .cse8))) [2020-07-07 14:08:55,100 INFO L264 CegarLoopResult]: At program point L249-1(lines 248 271) the Hoare annotation is: (let ((.cse1 (= 1 ~m_pc~0)) (.cse4 (not (= 1 ~t1_i~0))) (.cse7 (= 1 ~t1_pc~0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (= 0 |old(~E_M~0)|)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (not (= 1 ~m_i~0))) (.cse8 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (not (= 0 ~m_st~0)) .cse5 .cse6 .cse7 .cse1 (not (= 0 ~t1_st~0)) .cse2 .cse3 .cse8) (or .cse4 (not .cse7) (not (<= ~token~0 ~local~0)) (not (<= 2 ~t1_st~0)) .cse5 .cse0 .cse6 (not (<= ~local~0 ~token~0)) .cse2 .cse3 .cse8))) [2020-07-07 14:08:55,100 INFO L264 CegarLoopResult]: At program point fire_delta_eventsEXIT(lines 245 272) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse3 (= 1 ~t1_pc~0)) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (= 0 |old(~E_M~0)|)) (.cse4 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse5 (not (= 1 ~m_i~0))) (.cse6 (= 1 |old(~E_M~0)|))) (and (or .cse0 (not (= 0 ~m_st~0)) .cse1 .cse2 .cse3 (= 1 ~m_pc~0) (not (= 0 ~t1_st~0)) .cse4 .cse5 .cse6) (or .cse0 (not .cse3) (not (<= ~token~0 ~local~0)) (not (<= 2 ~t1_st~0)) .cse1 (not (<= 2 ~m_st~0)) .cse2 (not (<= ~local~0 ~token~0)) .cse4 .cse5 .cse6))) [2020-07-07 14:08:55,100 INFO L264 CegarLoopResult]: At program point L264-1(lines 245 272) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse3 (= 1 ~t1_pc~0)) (.cse1 (not (<= 2 |old(~E_1~0)|))) (.cse2 (= 0 |old(~E_M~0)|)) (.cse4 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse5 (not (= 1 ~m_i~0))) (.cse6 (= 1 |old(~E_M~0)|))) (and (or .cse0 (not (= 0 ~m_st~0)) .cse1 .cse2 .cse3 (= 1 ~m_pc~0) (not (= 0 ~t1_st~0)) .cse4 .cse5 .cse6) (or .cse0 (not .cse3) (not (<= ~token~0 ~local~0)) (not (<= 2 ~t1_st~0)) .cse1 (not (<= 2 ~m_st~0)) .cse2 (not (<= ~local~0 ~token~0)) .cse4 .cse5 .cse6))) [2020-07-07 14:08:55,101 INFO L264 CegarLoopResult]: At program point L260(line 260) the Hoare annotation is: (let ((.cse3 (not (<= 2 ~m_st~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse4 (= 0 |old(~E_M~0)|)) (.cse1 (= 1 ~t1_pc~0)) (.cse7 (= 1 ~m_pc~0)) (.cse5 (not (= 1 ~m_i~0))) (.cse6 (= 1 |old(~E_M~0)|))) (and (or .cse0 (not .cse1) (not (<= ~token~0 ~local~0)) (not (<= 2 ~t1_st~0)) .cse2 .cse3 .cse4 (not (<= ~local~0 ~token~0)) .cse5 .cse6) (or .cse3 .cse7 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse5) (or .cse0 (not (= 0 ~m_st~0)) .cse2 .cse4 .cse1 .cse7 (not (= 0 ~t1_st~0)) .cse5 .cse6))) [2020-07-07 14:08:55,101 INFO L264 CegarLoopResult]: At program point L448(line 448) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= 0 ~E_M~0))) (.cse3 (not (= 1 ~E_M~0))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0) (and .cse1 .cse2 .cse3 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,101 INFO L264 CegarLoopResult]: At program point L448-1(line 448) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= 0 ~E_M~0))) (.cse3 (not (= 1 ~E_M~0))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0) (and .cse1 .cse2 .cse3 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,101 INFO L264 CegarLoopResult]: At program point L448-2(line 448) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= 0 ~E_M~0))) (.cse3 (not (= 1 ~E_M~0))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0) (and .cse1 .cse2 .cse3 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,101 INFO L264 CegarLoopResult]: At program point L411(line 411) the Hoare annotation is: (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (= 0 |old(~E_M~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= 0 ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|)) [2020-07-07 14:08:55,101 INFO L271 CegarLoopResult]: At program point start_simulationEXIT(lines 403 461) the Hoare annotation is: true [2020-07-07 14:08:55,102 INFO L264 CegarLoopResult]: At program point L411-1(line 411) the Hoare annotation is: (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (= 0 |old(~E_M~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= 0 ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|)) [2020-07-07 14:08:55,102 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= 0 ~E_M~0))) (.cse3 (not (= 1 ~E_M~0))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0) (and .cse1 .cse2 .cse3 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,102 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= 0 ~E_M~0))) (.cse3 (not (= 1 ~E_M~0))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0) (and .cse1 .cse2 .cse3 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,102 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= 0 ~E_M~0))) (.cse3 (not (= 1 ~E_M~0))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0) (and .cse1 .cse2 .cse3 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,102 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (= 0 |old(~E_M~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= 0 ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|)) [2020-07-07 14:08:55,103 INFO L264 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (= 0 ~m_st~0) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= 0 ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (= 0 |old(~E_M~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|)) [2020-07-07 14:08:55,103 INFO L264 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= 0 ~E_M~0))) (.cse3 (not (= 1 ~E_M~0))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0) (and .cse1 .cse2 .cse3 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,103 INFO L264 CegarLoopResult]: At program point L437(lines 437 446) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= 0 ~E_M~0))) (.cse3 (not (= 1 ~E_M~0))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0) (and .cse1 .cse2 .cse3 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,103 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= 0 ~E_M~0))) (.cse3 (not (= 1 ~E_M~0))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0) (and .cse1 .cse2 .cse3 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,103 INFO L264 CegarLoopResult]: At program point L450(lines 450 454) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= 0 ~E_M~0))) (.cse3 (not (= 1 ~E_M~0))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0) (and .cse1 .cse2 .cse3 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,104 INFO L264 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (<= 2 ~E_1~0) (= 0 ~m_st~0) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (= 0 ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (= 0 |old(~E_M~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|)) [2020-07-07 14:08:55,104 INFO L264 CegarLoopResult]: At program point L405(line 405) the Hoare annotation is: (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (= 0 |old(~E_M~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= 0 ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|)) [2020-07-07 14:08:55,104 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and (<= 2 ~E_1~0) (not (= 0 ~E_M~0)) (not (= 1 ~E_M~0)) (<= ~token~0 ~local~0) (= 1 ~t1_pc~0) (<= 2 ~t1_st~0) (<= ~local~0 ~token~0) .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,104 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and (<= 2 ~E_1~0) (not (= 0 ~E_M~0)) (not (= 1 ~E_M~0)) (<= ~token~0 ~local~0) (= 1 ~t1_pc~0) (<= 2 ~t1_st~0) (<= ~local~0 ~token~0) .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,104 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and (<= 2 ~E_1~0) (not (= 0 ~E_M~0)) (not (= 1 ~E_M~0)) (<= ~token~0 ~local~0) (= 1 ~t1_pc~0) (<= 2 ~t1_st~0) (<= ~local~0 ~token~0) .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,105 INFO L264 CegarLoopResult]: At program point L426-1(line 426) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and (<= 2 ~E_1~0) (not (= 0 ~E_M~0)) (not (= 1 ~E_M~0)) (<= ~token~0 ~local~0) (= 1 ~t1_pc~0) (<= 2 ~t1_st~0) (<= ~local~0 ~token~0) .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,105 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse0 (not (= 1 ~m_pc~0))) (.cse2 (<= 2 ~E_1~0)) (.cse5 (not (= 0 ~E_M~0))) (.cse6 (not (= 1 ~E_M~0))) (.cse4 (= 0 ~t1_st~0)) (.cse7 (<= ~token~0 ~local~0)) (.cse3 (= 1 ~t1_pc~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse1 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1) (and .cse2 (= 0 ~m_st~0) (not .cse3) .cse0 .cse4 (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (= 0 |old(~E_M~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse2 .cse5 .cse6 .cse7 .cse3 (<= 2 ~t1_st~0) .cse8 .cse1) (and .cse2 .cse5 .cse6 .cse4 .cse7 .cse3 .cse8 .cse1))) [2020-07-07 14:08:55,105 INFO L264 CegarLoopResult]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and (<= 2 ~E_1~0) (not (= 0 ~E_M~0)) (not (= 1 ~E_M~0)) (<= ~token~0 ~local~0) (= 1 ~t1_pc~0) (<= 2 ~t1_st~0) (<= ~local~0 ~token~0) .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,105 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse0 (not (= 1 ~m_pc~0))) (.cse2 (<= 2 ~E_1~0)) (.cse5 (not (= 0 ~E_M~0))) (.cse6 (not (= 1 ~E_M~0))) (.cse4 (= 0 ~t1_st~0)) (.cse7 (<= ~token~0 ~local~0)) (.cse3 (= 1 ~t1_pc~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse1 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1) (and .cse2 (= 0 ~m_st~0) (not .cse3) .cse0 .cse4 (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (= 0 |old(~E_M~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse2 .cse5 .cse6 .cse7 .cse3 (<= 2 ~t1_st~0) .cse8 .cse1) (and .cse2 .cse5 .cse6 .cse4 .cse7 .cse3 .cse8 .cse1))) [2020-07-07 14:08:55,105 INFO L264 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (<= 2 ~E_1~0) (= 0 ~m_st~0) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (= 0 ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (= 0 |old(~E_M~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|)) [2020-07-07 14:08:55,106 INFO L264 CegarLoopResult]: At program point L410(line 410) the Hoare annotation is: (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (= 0 |old(~E_M~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= 0 ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|)) [2020-07-07 14:08:55,106 INFO L264 CegarLoopResult]: At program point L439(line 439) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= 0 ~E_M~0))) (.cse3 (not (= 1 ~E_M~0))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0) (and .cse1 .cse2 .cse3 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,106 INFO L264 CegarLoopResult]: At program point L406(line 406) the Hoare annotation is: (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (= 0 |old(~E_M~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and (= |old(~t1_pc~0)| ~t1_pc~0) (= ~m_st~0 |old(~m_st~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~local~0 |old(~local~0)|) (= 0 ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|)) [2020-07-07 14:08:55,106 INFO L264 CegarLoopResult]: At program point L435(line 435) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= 0 ~E_M~0))) (.cse3 (not (= 1 ~E_M~0))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0) (and .cse1 .cse2 .cse3 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,107 INFO L264 CegarLoopResult]: At program point L435-1(line 435) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= 0 ~E_M~0))) (.cse3 (not (= 1 ~E_M~0))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0) (and .cse1 .cse2 .cse3 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,107 INFO L264 CegarLoopResult]: At program point L435-2(line 435) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= 0 ~E_M~0))) (.cse3 (not (= 1 ~E_M~0))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0) (and .cse1 .cse2 .cse3 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,107 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= 0 ~E_M~0))) (.cse3 (not (= 1 ~E_M~0))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (and (not (= 1 ~m_pc~0)) .cse0) (not (<= 2 |old(~E_1~0)|)) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t1_st~0) .cse6 .cse0) (and .cse1 .cse2 .cse3 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse0) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|))) [2020-07-07 14:08:55,107 INFO L271 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: true [2020-07-07 14:08:55,107 INFO L264 CegarLoopResult]: At program point L419(line 419) the Hoare annotation is: (let ((.cse0 (not (= 1 ~m_pc~0))) (.cse2 (<= 2 ~E_1~0)) (.cse5 (not (= 0 ~E_M~0))) (.cse6 (not (= 1 ~E_M~0))) (.cse4 (= 0 ~t1_st~0)) (.cse7 (<= ~token~0 ~local~0)) (.cse3 (= 1 ~t1_pc~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse1 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1) (and .cse2 (= 0 ~m_st~0) (not .cse3) .cse0 .cse4 (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (= 0 |old(~E_M~0)|) (not (= 0 |old(~t1_st~0)|)) (= 1 |old(~t1_pc~0)|) (not (= 1 ~m_i~0)) (= 1 |old(~E_M~0)|) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (= 1 |old(~m_pc~0)|) (and .cse2 .cse5 .cse6 .cse7 .cse3 (<= 2 ~t1_st~0) .cse8 .cse1) (and .cse2 .cse5 .cse6 .cse4 .cse7 .cse3 .cse8 .cse1))) [2020-07-07 14:08:55,108 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse15 (= 1 ~t1_pc~0)) (.cse8 (= 0 ~t1_st~0)) (.cse16 (<= 0 is_master_triggered_~__retres1~0)) (.cse2 (= 1 ~m_pc~0)) (.cse17 (<= is_master_triggered_~__retres1~0 0))) (let ((.cse1 (and .cse16 (not .cse2) .cse17)) (.cse0 (not (<= 2 ~m_st~0))) (.cse4 (not (<= 2 ~E_1~0))) (.cse13 (not .cse8)) (.cse5 (not (= 1 ~t1_i~0))) (.cse6 (not .cse15)) (.cse10 (not (<= ~token~0 ~local~0))) (.cse7 (= 1 ~E_M~0)) (.cse11 (= 0 ~E_M~0)) (.cse14 (and .cse16 .cse17)) (.cse12 (not (<= ~local~0 ~token~0))) (.cse3 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (let ((.cse9 (+ ~local~0 1))) (or (<= 1 is_master_triggered_~__retres1~0) .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse0 .cse1 (not (<= .cse9 ~token~0)) (not (<= ~token~0 .cse9)) .cse3)) (or .cse4 .cse5 .cse6 .cse10 .cse7 .cse0 .cse11 .cse12 .cse13 .cse14 .cse3) (or .cse5 .cse10 .cse7 (not (= 1 ~m_st~0)) .cse15 .cse2 .cse11 .cse12 .cse13 .cse14 .cse3) (or .cse4 .cse5 (not (= 0 ~m_st~0)) .cse7 .cse15 .cse2 .cse11 .cse14 .cse13 .cse3) (or .cse5 .cse6 .cse10 .cse7 (not (<= 2 ~t1_st~0)) .cse11 .cse14 .cse12 .cse3)))) [2020-07-07 14:08:55,108 INFO L264 CegarLoopResult]: At program point is_master_triggeredFINAL(lines 110 128) the Hoare annotation is: (let ((.cse14 (= 0 ~t1_st~0)) (.cse11 (= 1 ~t1_pc~0)) (.cse17 (<= 0 is_master_triggered_~__retres1~0)) (.cse2 (= 1 ~m_pc~0)) (.cse18 (<= |is_master_triggered_#res| 0)) (.cse19 (<= is_master_triggered_~__retres1~0 0)) (.cse16 (= 1 ~m_i~0)) (.cse20 (<= 0 |is_master_triggered_#res|))) (let ((.cse0 (and .cse17 (not .cse2) .cse18 .cse19 .cse16 .cse20)) (.cse5 (not .cse11)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse13 (not (<= 2 ~E_1~0))) (.cse4 (not (= 1 ~t1_i~0))) (.cse6 (and .cse17 .cse18 .cse19 .cse20)) (.cse8 (= 1 ~E_M~0)) (.cse9 (= 0 ~E_M~0)) (.cse12 (not .cse14)) (.cse3 (not .cse16))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9 .cse10 .cse3) (or .cse4 .cse7 .cse6 .cse8 (not (= 1 ~m_st~0)) .cse11 .cse2 .cse9 .cse10 .cse12 .cse3) (let ((.cse15 (+ ~local~0 1))) (or .cse13 .cse4 .cse5 .cse0 (not .cse8) .cse14 .cse1 (not (<= .cse15 ~token~0)) (and (<= 1 is_master_triggered_~__retres1~0) (<= 1 |is_master_triggered_#res|)) (not (<= ~token~0 .cse15)) .cse3)) (or .cse13 .cse4 .cse5 .cse7 .cse6 .cse8 .cse1 .cse9 .cse10 .cse12 .cse3) (or .cse13 .cse4 (not (= 0 ~m_st~0)) .cse6 .cse8 .cse11 .cse2 .cse9 .cse12 .cse3)))) [2020-07-07 14:08:55,108 INFO L264 CegarLoopResult]: At program point L116(line 116) the Hoare annotation is: (let ((.cse3 (= 1 ~t1_pc~0))) (let ((.cse11 (not (<= 2 ~m_st~0))) (.cse9 (not (<= 2 ~E_1~0))) (.cse4 (= 1 ~m_pc~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse10 (not .cse3)) (.cse1 (not (<= ~token~0 ~local~0))) (.cse2 (= 1 ~E_M~0)) (.cse5 (= 0 ~E_M~0)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 (not (= 1 ~m_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse10 .cse1 .cse2 .cse11 .cse5 .cse6 .cse7 .cse8) (or .cse11 .cse4 .cse8) (or .cse9 .cse0 (not (= 0 ~m_st~0)) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (or .cse0 .cse10 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse5 .cse6 .cse8)))) [2020-07-07 14:08:55,108 INFO L264 CegarLoopResult]: At program point L115(lines 115 120) the Hoare annotation is: (let ((.cse1 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse2 (= 1 ~E_M~0)) (.cse3 (= 1 ~t1_pc~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (= 0 ~E_M~0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 (not (= 1 ~m_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (not (<= 2 ~m_st~0)) .cse4 .cse8) (or .cse0 (not .cse3) .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse4 .cse5 .cse6 .cse8) (or (not (<= 2 ~E_1~0)) .cse0 (not (= 0 ~m_st~0)) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8))) [2020-07-07 14:08:55,108 INFO L271 CegarLoopResult]: At program point L114(lines 114 123) the Hoare annotation is: true [2020-07-07 14:08:55,109 INFO L264 CegarLoopResult]: At program point L114-2(lines 114 123) the Hoare annotation is: (let ((.cse0 (+ ~local~0 1))) (or (not (<= 2 ~E_1~0)) (not (= 1 ~t1_i~0)) (not (= 1 ~m_pc~0)) (not (= 1 ~t1_pc~0)) (not (= 1 ~E_M~0)) (= 0 ~t1_st~0) (not (<= 2 ~m_st~0)) (not (<= .cse0 ~token~0)) (not (<= ~token~0 .cse0)) (not (= 1 ~m_i~0)))) [2020-07-07 14:08:55,109 INFO L264 CegarLoopResult]: At program point is_master_triggeredEXIT(lines 110 128) the Hoare annotation is: (let ((.cse14 (= 0 ~t1_st~0)) (.cse11 (= 1 ~t1_pc~0)) (.cse17 (<= 0 is_master_triggered_~__retres1~0)) (.cse2 (= 1 ~m_pc~0)) (.cse18 (<= |is_master_triggered_#res| 0)) (.cse19 (<= is_master_triggered_~__retres1~0 0)) (.cse16 (= 1 ~m_i~0)) (.cse20 (<= 0 |is_master_triggered_#res|))) (let ((.cse0 (and .cse17 (not .cse2) .cse18 .cse19 .cse16 .cse20)) (.cse5 (not .cse11)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse13 (not (<= 2 ~E_1~0))) (.cse4 (not (= 1 ~t1_i~0))) (.cse6 (and .cse17 .cse18 .cse19 .cse20)) (.cse8 (= 1 ~E_M~0)) (.cse9 (= 0 ~E_M~0)) (.cse12 (not .cse14)) (.cse3 (not .cse16))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9 .cse10 .cse3) (or .cse4 .cse7 .cse6 .cse8 (not (= 1 ~m_st~0)) .cse11 .cse2 .cse9 .cse10 .cse12 .cse3) (let ((.cse15 (+ ~local~0 1))) (or .cse13 .cse4 .cse5 .cse0 (not .cse8) .cse14 .cse1 (not (<= .cse15 ~token~0)) (and (<= 1 is_master_triggered_~__retres1~0) (<= 1 |is_master_triggered_#res|)) (not (<= ~token~0 .cse15)) .cse3)) (or .cse13 .cse4 .cse5 .cse7 .cse6 .cse8 .cse1 .cse9 .cse10 .cse12 .cse3) (or .cse13 .cse4 (not (= 0 ~m_st~0)) .cse6 .cse8 .cse11 .cse2 .cse9 .cse12 .cse3)))) [2020-07-07 14:08:55,109 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-07-07 14:08:55,109 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-07 14:08:55,109 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 2 ~E_1~0) (= 0 ~m_st~0) (not (= 1 ~t1_i~0)) (not (= 1 ~t1_pc~0)) (not (= 1 ~m_pc~0)) (not (= 0 ~E_M~0)) (= 0 ~t1_st~0) (not (= 1 ~E_M~0)) (not (= 1 ~m_i~0))) [2020-07-07 14:08:55,109 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 14:08:55,110 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-07 14:08:55,110 INFO L264 CegarLoopResult]: At program point L351(line 351) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse1 (and (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 ~m_st~0))) (.cse6 (= 0 |old(~E_M~0)|)) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= 1 ~m_i~0))) (.cse9 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ~t1_st~0)) .cse8 .cse9) (or .cse1 .cse5 (= 1 ~m_pc~0) .cse8) (or .cse0 .cse1 .cse2 .cse3 (not (<= 2 ~t1_st~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-07-07 14:08:55,110 INFO L264 CegarLoopResult]: At program point reset_time_eventsEXIT(lines 346 373) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse8 (not (= 1 ~m_i~0))) (.cse9 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~t1_st~0)) .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-07-07 14:08:55,110 INFO L264 CegarLoopResult]: At program point L366(line 366) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (not (= 1 ~m_i~0))) (.cse8 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (= ~E_1~0 |old(~E_1~0)|) .cse4 (= 1 ~m_pc~0) .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~t1_st~0)) .cse7 .cse8))) [2020-07-07 14:08:55,110 INFO L264 CegarLoopResult]: At program point L360-1(lines 349 372) the Hoare annotation is: (let ((.cse10 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (and .cse10 (= ~E_M~0 |old(~E_M~0)|))) (.cse8 (not (= 1 ~m_i~0))) (.cse9 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~t1_st~0)) .cse7 .cse8 .cse9) (or .cse10 .cse4 (= 1 ~m_pc~0) .cse8) (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2020-07-07 14:08:55,111 INFO L264 CegarLoopResult]: At program point L356(line 356) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse8 (not (= 1 ~m_i~0))) (.cse9 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~t1_st~0)) .cse7 .cse8 .cse9) (or .cse4 (= 1 ~m_pc~0) .cse7 .cse8) (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-07-07 14:08:55,111 INFO L264 CegarLoopResult]: At program point L350-1(lines 349 372) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse8 (not (= 1 ~m_i~0))) (.cse9 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~t1_st~0)) .cse7 .cse8 .cse9) (or .cse4 (= 1 ~m_pc~0) .cse7 .cse8) (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-07-07 14:08:55,111 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse1 (and (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse2 (not (= 1 ~t1_pc~0))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 ~m_st~0))) (.cse6 (= 0 |old(~E_M~0)|)) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= 1 ~m_i~0))) (.cse9 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ~t1_st~0)) .cse8 .cse9) (or .cse1 .cse5 (= 1 ~m_pc~0) .cse8) (or .cse0 .cse1 .cse2 .cse3 (not (<= 2 ~t1_st~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-07-07 14:08:55,111 INFO L264 CegarLoopResult]: At program point L365-1(lines 346 373) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse8 (not (= 1 ~m_i~0))) (.cse9 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~t1_st~0)) .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-07-07 14:08:55,111 INFO L264 CegarLoopResult]: At program point L361(line 361) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (not (= 1 ~m_i~0))) (.cse8 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse4 (= 1 ~m_pc~0) (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~t1_st~0)) .cse7 .cse8))) [2020-07-07 14:08:55,112 INFO L264 CegarLoopResult]: At program point L355-1(lines 349 372) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~m_st~0))) (.cse5 (= 0 |old(~E_M~0)|)) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse8 (not (= 1 ~m_i~0))) (.cse9 (= 1 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~t1_st~0)) .cse7 .cse8 .cse9) (or .cse4 (= 1 ~m_pc~0) .cse7 .cse8) (or .cse0 .cse1 .cse2 (not (<= 2 ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2020-07-07 14:08:55,112 INFO L264 CegarLoopResult]: At program point init_modelFINAL(lines 374 383) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (= 1 |old(~t1_i~0)|) (not (= 0 ~m_st~0)) (= 1 ~E_M~0) (= |old(~m_i~0)| 1) (and (= 1 ~t1_i~0) (= 1 ~m_i~0)) (= 1 ~t1_pc~0) (= 1 ~m_pc~0) (= 0 ~E_M~0) (not (= 0 ~t1_st~0))) [2020-07-07 14:08:55,112 INFO L264 CegarLoopResult]: At program point init_modelEXIT(lines 374 383) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (= 1 |old(~t1_i~0)|) (not (= 0 ~m_st~0)) (= 1 ~E_M~0) (= |old(~m_i~0)| 1) (and (= 1 ~t1_i~0) (= 1 ~m_i~0)) (= 1 ~t1_pc~0) (= 1 ~m_pc~0) (= 0 ~E_M~0) (not (= 0 ~t1_st~0))) [2020-07-07 14:08:55,112 INFO L264 CegarLoopResult]: At program point L379(line 379) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (= 1 |old(~t1_i~0)|) (not (= 0 ~m_st~0)) (= 1 ~E_M~0) (= |old(~m_i~0)| 1) (and (not (= 1 ~t1_i~0)) (= 1 ~m_i~0)) (= 1 ~t1_pc~0) (= 1 ~m_pc~0) (= 0 ~E_M~0) (not (= 0 ~t1_st~0))) [2020-07-07 14:08:55,112 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (= 1 |old(~t1_i~0)|) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~m_i~0)| ~m_i~0)) (not (= 0 ~m_st~0)) (= 1 ~E_M~0) (= |old(~m_i~0)| 1) (= 1 ~t1_pc~0) (= 1 ~m_pc~0) (= 0 ~E_M~0) (not (= 0 ~t1_st~0))) [2020-07-07 14:08:55,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 02:08:55 BoogieIcfgContainer [2020-07-07 14:08:55,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 14:08:55,197 INFO L168 Benchmark]: Toolchain (without parser) took 148088.13 ms. Allocated memory was 138.4 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 103.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2020-07-07 14:08:55,200 INFO L168 Benchmark]: CDTParser took 0.88 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-07 14:08:55,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.89 ms. Allocated memory is still 138.4 MB. Free memory was 103.4 MB in the beginning and 89.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-07 14:08:55,201 INFO L168 Benchmark]: Boogie Preprocessor took 129.02 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 89.8 MB in the beginning and 179.7 MB in the end (delta: -90.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-07 14:08:55,202 INFO L168 Benchmark]: RCFGBuilder took 637.02 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 142.9 MB in the end (delta: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. [2020-07-07 14:08:55,202 INFO L168 Benchmark]: TraceAbstraction took 146980.81 ms. Allocated memory was 202.4 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 142.2 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2020-07-07 14:08:55,204 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.88 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 335.89 ms. Allocated memory is still 138.4 MB. Free memory was 103.4 MB in the beginning and 89.8 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.02 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 89.8 MB in the beginning and 179.7 MB in the end (delta: -90.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 637.02 ms. Allocated memory is still 202.4 MB. Free memory was 179.7 MB in the beginning and 142.9 MB in the end (delta: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 146980.81 ms. Allocated memory was 202.4 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 142.2 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 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: 177]: Loop Invariant Derived loop invariant: (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == t1_pc)) || !(0 == m_st)) || 1 == E_M) || !(2 <= t1_st)) || 1 <= __retres1) || 1 == m_pc) || 0 == E_M) || !(1 == m_i)) && (((((((((!(2 <= E_1) || !(1 == t1_i)) || !(token <= local)) || 1 == E_M) || 1 <= __retres1) || !(2 <= m_st)) || 0 == E_M) || !(local <= token)) || !(0 == t1_st)) || !(1 == m_i))) && ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == t1_pc)) || !(0 == m_st)) || 1 == E_M) || !(2 <= t1_st)) || 1 <= __retres1) || !(local + 1 <= token)) || 0 == E_M) || !(token <= local + 1)) || !(1 == m_i))) && (((((((((!(2 <= E_1) || !(1 == t1_i)) || !(0 == m_st)) || 1 == E_M) || 1 <= __retres1) || 1 == t1_pc) || 1 == m_pc) || 0 == E_M) || !(0 == t1_st)) || !(1 == m_i)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((((((!(1 == t1_i) || ((((((((0 == m_st && !(1 == m_pc)) && !(0 == tmp)) && 1 == t1_pc) && 2 <= t1_st) && \old(token) == token) || ((((((0 == m_st && token <= \old(token) + 1) && !(1 == m_pc)) && \old(token) + 1 <= token) && !(0 == tmp)) && 1 == t1_pc) && 2 <= t1_st)) && E_1 == \old(E_1)) && E_M == \old(E_M))) || ((((((2 <= E_1 && !(0 == tmp)) && 0 == t1_st) && token <= local) && E_M == \old(E_M)) && local <= token) && 2 <= m_st)) || 0 == \old(E_M)) || !(0 == \old(t1_st))) || 1 == \old(t1_pc)) || (((((((((2 <= E_1 && 0 == m_st) && !(0 == E_M)) && !(0 == tmp)) && !(1 == E_M)) && token <= local + 1) && local + 1 <= token) && 1 == t1_pc) && 2 <= t1_st) && 1 == m_i)) || !(1 == m_i)) || 1 == \old(E_M)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st)) || ((((((((2 <= E_1 && !(0 == E_M)) && !(0 == tmp)) && !(1 == E_M)) && 0 == t1_st) && token <= local) && 1 == t1_pc) && local <= token) && 2 <= m_st)) || !(0 == \old(m_st))) || (((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && 0 == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || ((((((((2 <= E_1 && !(0 == E_M)) && !(0 == tmp)) && !(1 == E_M)) && token <= local) && 1 == t1_pc) && 2 <= t1_st) && local <= token) && 2 <= m_st)) && (((((((((((!(1 == t1_i) || (((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && E_1 == \old(E_1)) && token <= local) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token) && \old(token) == token)) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(\old(local) <= \old(token))) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) || 1 == \old(E_M)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st))) && ((((((((((((((!(1 == t1_i) || !(\old(token) <= \old(local))) || !(\old(local) <= \old(token))) || 0 == \old(E_M)) || !(0 == \old(t1_st))) || (((((((((2 <= E_1 && 0 == m_st) && !(0 == E_M)) && !(0 == tmp)) && !(1 == E_M)) && token <= local + 1) && local + 1 <= token) && 1 == t1_pc) && 2 <= t1_st) && 1 == m_i)) || !(1 == m_i)) || 1 == \old(E_M)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st)) || ((((((((2 <= E_1 && !(0 == E_M)) && !(0 == tmp)) && !(1 == E_M)) && 0 == t1_st) && token <= local) && 1 == t1_pc) && local <= token) && 2 <= m_st)) || !(2 <= \old(E_1))) || (((((((m_st == \old(m_st) && E_1 == \old(E_1)) && 0 == t1_st) && token <= local) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token) && \old(token) == token)) || !(2 <= \old(m_st))) || ((((((((2 <= E_1 && !(0 == E_M)) && !(0 == tmp)) && !(1 == E_M)) && token <= local) && 1 == t1_pc) && 2 <= t1_st) && local <= token) && 2 <= m_st)) || !(1 == \old(t1_pc)))) && (((1 == \old(m_pc) || !(2 <= \old(m_st))) || !(1 == m_i)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((!(2 <= m_st) || ((0 <= __retres1 && !(1 == m_pc)) && __retres1 <= 0)) || 1 == m_pc) || !(1 == m_i)) && ((((((((((1 <= __retres1 || !(2 <= E_1)) || !(1 == t1_i)) || !(1 == t1_pc)) || !(1 == E_M)) || 0 == t1_st) || !(2 <= m_st)) || ((0 <= __retres1 && !(1 == m_pc)) && __retres1 <= 0)) || !(local + 1 <= token)) || !(token <= local + 1)) || !(1 == m_i))) && ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == t1_pc)) || !(token <= local)) || 1 == E_M) || !(2 <= m_st)) || 0 == E_M) || !(local <= token)) || !(0 == t1_st)) || (0 <= __retres1 && __retres1 <= 0)) || !(1 == m_i))) && ((((((((((!(1 == t1_i) || !(token <= local)) || 1 == E_M) || !(1 == m_st)) || 1 == t1_pc) || 1 == m_pc) || 0 == E_M) || !(local <= token)) || !(0 == t1_st)) || (0 <= __retres1 && __retres1 <= 0)) || !(1 == m_i))) && (((((((((!(2 <= E_1) || !(1 == t1_i)) || !(0 == m_st)) || 1 == E_M) || 1 == t1_pc) || 1 == m_pc) || 0 == E_M) || (0 <= __retres1 && __retres1 <= 0)) || !(0 == t1_st)) || !(1 == m_i))) && ((((((((!(1 == t1_i) || !(1 == t1_pc)) || !(token <= local)) || 1 == E_M) || !(2 <= t1_st)) || 0 == E_M) || (0 <= __retres1 && __retres1 <= 0)) || !(local <= token)) || !(1 == m_i)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((!(1 == t1_i) || 1 == E_M) || !(1 == \old(m_st))) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || ((((2 <= E_1 && 0 == t1_st) && token <= local) && local <= token) && 2 <= m_st)) || !(0 == \old(t1_st))) || 1 == t1_pc) || 0 == E_M) || !(1 == m_i)) && (((((((((!(1 == t1_i) || !(1 == t1_pc)) || 1 == E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || ((((((((2 <= E_1 && 1 == t1_i) && !(1 == E_M)) && 0 == t1_st) && token <= local) && 1 == t1_pc) && 1 == m_i) && local <= token) && 2 <= m_st)) || 0 == E_M) || ((((((((2 <= E_1 && 1 == t1_i) && !(1 == E_M)) && token <= local) && 1 == t1_pc) && 2 <= t1_st) && 1 == m_i) && local <= token) && 2 <= m_st)) || !(1 == m_i))) && ((((((((((!(1 == t1_i) || !(1 == t1_pc)) || 1 == E_M) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(local) + 1 <= \old(token))) || ((((((((2 <= E_1 && 1 == t1_i) && !(1 == E_M)) && 0 == t1_st) && token <= local) && 1 == t1_pc) && 1 == m_i) && local <= token) && 2 <= m_st)) || 0 == E_M) || ((((((((2 <= E_1 && 1 == t1_i) && !(1 == E_M)) && token <= local) && 1 == t1_pc) && 2 <= t1_st) && 1 == m_i) && local <= token) && 2 <= m_st)) || !(1 == m_i)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((((!(2 <= E_1) || !(1 == t1_i)) || ((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(0 == \old(m_st))) || 0 == \old(t1_st)) || 0 == \old(E_M)) || 1 == \old(t1_pc)) || 1 == m_pc) || !(1 == m_i)) || 1 == \old(E_M)) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || (((((0 == m_st && !(0 == E_M)) && !(1 == E_M)) && token <= local + 1) && local + 1 <= token) && 1 == t1_pc)) || 0 == \old(t1_st)) || !(local <= \old(token))) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) || !(\old(token) <= local)) || 1 == \old(E_M)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st))) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || (((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || 0 == \old(t1_st)) || !(local <= \old(token))) || 0 == \old(E_M)) || 1 == \old(t1_pc)) || !(2 <= \old(m_st))) || !(1 == m_i)) || !(\old(token) <= local)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st)) || 1 == \old(E_M))) && (((1 == m_pc || !(2 <= \old(m_st))) || !(1 == m_i)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((((((((((!(1 == t1_i) || !(0 == \old(m_st))) || !(2 <= \old(E_1))) || 0 == \old(E_M)) || ((((((((2 <= E_1 && !(0 == E_M)) && !(1 == E_M)) && token <= local) && 1 == t1_pc) && 2 <= t1_st) && 1 == m_i) && local <= token) && 2 <= m_st)) || 1 == \old(m_pc)) || !(0 == \old(t1_st))) || 1 == \old(t1_pc)) || !(1 == m_i)) || 1 == \old(E_M)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st)) && (((((((((((!(1 == t1_i) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || ((((((((2 <= E_1 && !(0 == E_M)) && !(1 == E_M)) && token <= local) && 1 == t1_pc) && 2 <= t1_st) && 1 == m_i) && local <= token) && 2 <= m_st)) || !(\old(local) <= \old(token))) || 0 == \old(E_M)) || !(0 == \old(t1_st))) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st)) || 1 == \old(E_M))) && (((((((((((!(1 == t1_i) || (((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && E_1 == \old(E_1)) && token <= local) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token) && \old(token) == token)) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(\old(local) <= \old(token))) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) || 1 == \old(E_M)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st))) && (((1 == \old(m_pc) || !(2 <= \old(m_st))) || !(1 == m_i)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st)) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((((((!(2 <= E_1) || !(1 == t1_i)) || ((((((0 == m_st && !(0 == E_M)) && token <= local + 1) && !(1 == E_M)) && local + 1 <= token) && 1 == t1_pc) && 2 <= t1_st)) || 0 == \old(t1_st)) || !(local <= \old(token))) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) || !(\old(token) <= local)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st)) || 1 == \old(E_M)) && (((1 == m_pc || !(2 <= \old(m_st))) || !(1 == m_i)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st))) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || 0 == \old(t1_st)) || !(local <= \old(token))) || 0 == \old(E_M)) || 1 == \old(t1_pc)) || !(2 <= \old(m_st))) || (((((token <= local && 1 == t1_pc) && 2 <= t1_st) && E_M == \old(E_M)) && local <= token) && 2 <= m_st)) || !(1 == m_i)) || !(\old(token) <= local)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st)) || 1 == \old(E_M))) && (((((((((!(2 <= E_1) || !(1 == t1_i)) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(0 == \old(m_st))) || 0 == \old(t1_st)) || 0 == \old(E_M)) || 1 == \old(t1_pc)) || 1 == m_pc) || !(1 == m_i)) || 1 == \old(E_M)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((((!(2 <= E_1) || !(1 == t1_i)) || 0 == \old(t1_st)) || !(local <= \old(token))) || 0 == \old(E_M)) || 1 == \old(t1_pc)) || !(2 <= \old(m_st))) || !(1 == m_i)) || !(\old(token) <= local)) || 1 == \old(E_M)) && ((((((((!(2 <= E_1) || !(1 == t1_i)) || !(0 == \old(m_st))) || 0 == \old(t1_st)) || 0 == \old(E_M)) || 1 == \old(t1_pc)) || 1 == m_pc) || !(1 == m_i)) || 1 == \old(E_M))) && (((((((((!(2 <= E_1) || !(1 == t1_i)) || 0 == \old(t1_st)) || !(local <= \old(token))) || 0 == \old(E_M)) || (((((m_st == \old(m_st) && \old(t1_st) == t1_st) && token <= local) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token)) || !(2 <= \old(m_st))) || !(1 == m_i)) || !(\old(token) <= local)) || 1 == \old(E_M))) && (((((((\old(t1_pc) == t1_pc && m_st == \old(m_st)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token) || 1 == m_pc) || !(2 <= \old(m_st))) || !(1 == m_i)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((((((((!(1 == t1_i) || (!(1 == m_pc) && 2 <= m_st)) || ((((((2 <= E_1 && 0 == m_st) && !(1 == t1_pc)) && !(1 == m_pc)) && 0 == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || 0 == \old(E_M)) || !(0 == \old(t1_st))) || 1 == \old(t1_pc)) || !(1 == m_i)) || 1 == \old(E_M)) || !(0 == \old(m_st))) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((((2 <= E_1 && !(0 == E_M)) && !(1 == E_M)) && token <= local) && 1 == t1_pc) && 2 <= t1_st) && local <= token) && 2 <= m_st)) || (((((((2 <= E_1 && !(0 == E_M)) && !(1 == E_M)) && 0 == t1_st) && token <= local) && 1 == t1_pc) && local <= token) && 2 <= m_st) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((!(1 == t1_i) || !(1 == t1_pc)) || 1 == E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || 0 == E_M) || !(1 == m_i)) && ((((((((!(1 == t1_i) || 1 == E_M) || !(1 == \old(m_st))) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || !(0 == \old(t1_st))) || 1 == t1_pc) || 0 == E_M) || !(1 == m_i))) && (((((((((!(1 == t1_i) || !(1 == t1_pc)) || 1 == E_M) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && \old(token) == token)) || !(\old(local) + 1 <= \old(token))) || 0 == E_M) || !(1 == m_i)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((!(1 == t1_i) || 1 == E_M) || !(1 == \old(m_st))) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || (((((1 == m_st && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && 0 == t1_st) && \old(token) == token)) || !(0 == \old(t1_st))) || 1 == t1_pc) || 0 == E_M) || !(1 == m_i)) && ((((((((!(1 == t1_i) || !(1 == t1_pc)) || 1 == E_M) || !(2 <= \old(t1_st))) || (((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && \old(token) == token)) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || 0 == E_M) || !(1 == m_i))) && (((((((((!(1 == t1_i) || !(1 == t1_pc)) || 1 == E_M) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || (((((m_st == \old(m_st) && \old(t1_st) == t1_st) && m_pc == \old(m_pc)) && E_1 == \old(E_1)) && local == \old(local)) && \old(token) == token)) || !(\old(local) + 1 <= \old(token))) || 0 == E_M) || !(1 == m_i)) - ProcedureContractResult [Line: 74]: Procedure Contract for transmit1 Derived contract for procedure transmit1: (((((((((((((!(2 <= E_1) || !(1 == t1_i)) || ((((((0 == m_st && !(0 == E_M)) && token <= local + 1) && !(1 == E_M)) && local + 1 <= token) && 1 == t1_pc) && 2 <= t1_st)) || 0 == \old(t1_st)) || !(local <= \old(token))) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) || !(\old(token) <= local)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st)) || 1 == \old(E_M)) && (((1 == m_pc || !(2 <= \old(m_st))) || !(1 == m_i)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st))) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || 0 == \old(t1_st)) || !(local <= \old(token))) || 0 == \old(E_M)) || 1 == \old(t1_pc)) || !(2 <= \old(m_st))) || (((((token <= local && 1 == t1_pc) && 2 <= t1_st) && E_M == \old(E_M)) && local <= token) && 2 <= m_st)) || !(1 == m_i)) || !(\old(token) <= local)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st)) || 1 == \old(E_M))) && (((((((((!(2 <= E_1) || !(1 == t1_i)) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(0 == \old(m_st))) || 0 == \old(t1_st)) || 0 == \old(E_M)) || 1 == \old(t1_pc)) || 1 == m_pc) || !(1 == m_i)) || 1 == \old(E_M)) - ProcedureContractResult [Line: 301]: Procedure Contract for activate_threads Derived contract for procedure activate_threads: ((((((((((((((((!(1 == t1_i) || !(token <= local)) || (((m_st == \old(m_st) && 0 == t1_st) && 0 <= tmp) && tmp <= 0)) || 1 == E_M) || !(1 == \old(m_st))) || !(0 == \old(t1_st))) || 1 == t1_pc) || 0 == E_M) || 1 == m_pc) || !(local <= token)) || !(1 == m_i)) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == t1_pc)) || !(token <= local)) || 1 == E_M) || (((((m_st == \old(m_st) && 0 == t1_st) && 0 <= tmp) && 1 == m_i) && tmp <= 0) && 2 <= m_st)) || !(0 == \old(t1_st))) || 0 == E_M) || !(2 <= \old(m_st))) || !(local <= token)) || ((((!(1 == m_pc) && 0 <= tmp) && 1 == m_i) && tmp <= 0) && 2 <= m_st)) || !(1 == m_i))) && (((1 == m_pc || !(2 <= \old(m_st))) || ((((!(1 == m_pc) && 0 <= tmp) && 1 == m_i) && tmp <= 0) && 2 <= m_st)) || !(1 == m_i))) && ((((((((((0 <= tmp && tmp <= 0) || !(1 == t1_i)) || !(1 == t1_pc)) || !(token <= local)) || 1 == E_M) || !(2 <= \old(t1_st))) || 1 == m_pc) || 0 == E_M) || !(local <= token)) || !(1 == m_i))) && ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == t1_pc)) || 0 == \old(t1_st)) || !(1 == E_M)) || (0 == m_st && 1 <= tmp)) || !(local + 1 <= token)) || !(2 <= \old(m_st))) || ((((!(1 == m_pc) && 0 <= tmp) && 1 == m_i) && tmp <= 0) && 2 <= m_st)) || !(token <= local + 1)) || !(1 == m_i))) && ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == t1_pc)) || !(token <= local)) || 1 == E_M) || !(2 <= \old(t1_st))) || 0 == E_M) || !(2 <= \old(m_st))) || !(local <= token)) || !(1 == m_i)) || (((0 <= tmp && 1 == m_i) && tmp <= 0) && 2 <= m_st))) && (((((((((!(1 == t1_i) || !(1 == t1_pc)) || !(token <= local)) || 1 == E_M) || !(2 <= \old(t1_st))) || ((m_st == \old(m_st) && \old(t1_st) == t1_st) && ((0 <= tmp && tmp <= 0) || 0 == m_st))) || 0 == E_M) || ((0 == m_st || (0 <= tmp && tmp <= 0)) && 0 == t1_st)) || !(local <= token)) || !(1 == m_i))) && (((((((((!(2 <= E_1) || !(1 == t1_i)) || (((m_st == \old(m_st) && 0 == t1_st) && 0 <= tmp) && tmp <= 0)) || !(0 == \old(m_st))) || 1 == E_M) || !(0 == \old(t1_st))) || 1 == t1_pc) || 1 == m_pc) || 0 == E_M) || !(1 == m_i)) - ProcedureContractResult [Line: 326]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify: ((((((((((((m_st == \old(m_st) && \old(t1_st) == t1_st) || !(1 == t1_i)) || !(1 == t1_pc)) || !(token <= local)) || 1 == E_M) || !(2 <= \old(t1_st))) || 0 == t1_st) || 0 == E_M) || !(local <= token)) || !(1 == m_i)) && ((((((((((!(2 <= E_1) || 0 == m_st) || !(1 == t1_i)) || !(1 == t1_pc)) || 0 == \old(t1_st)) || !(1 == E_M)) || !(local + 1 <= token)) || !(2 <= \old(m_st))) || !(token <= local + 1)) || !(1 == m_i)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st))) && (((1 == m_pc || !(2 <= \old(m_st))) || !(1 == m_i)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st))) && ((((((((((!(1 == t1_i) || !(token <= local)) || 1 == E_M) || (1 == m_st && 0 == t1_st)) || !(1 == \old(m_st))) || !(0 == \old(t1_st))) || 1 == t1_pc) || 1 == m_pc) || 0 == E_M) || !(local <= token)) || !(1 == m_i)) - ProcedureContractResult [Line: 174]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread: (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(0 == m_st)) || 1 == E_M) || (1 <= \result && 1 <= __retres1)) || 1 == t1_pc) || 1 == m_pc) || 0 == E_M) || !(0 == t1_st)) || !(1 == m_i)) && (((((((((!(2 <= E_1) || !(1 == t1_i)) || !(token <= local)) || 1 == E_M) || (1 <= \result && 1 <= __retres1)) || !(2 <= m_st)) || 0 == E_M) || !(local <= token)) || !(0 == t1_st)) || !(1 == m_i))) && ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == t1_pc)) || !(0 == m_st)) || 1 == E_M) || !(2 <= t1_st)) || (1 <= \result && 1 <= __retres1)) || !(local + 1 <= token)) || 0 == E_M) || !(token <= local + 1)) || !(1 == m_i))) && (((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == t1_pc)) || !(0 == m_st)) || 1 == E_M) || !(2 <= t1_st)) || (1 <= \result && 1 <= __retres1)) || 1 == m_pc) || 0 == E_M) || !(1 == m_i)) - ProcedureContractResult [Line: 129]: Procedure Contract for is_transmit1_triggered Derived contract for procedure is_transmit1_triggered: 1 - ProcedureContractResult [Line: 273]: Procedure Contract for reset_delta_events Derived contract for procedure reset_delta_events: (((((((((((!(1 == t1_i) || !(1 == t1_pc)) || !(token <= local)) || !(2 <= \old(E_1))) || !(2 <= m_st)) || 0 == \old(E_M)) || !(local <= token)) || !(0 == t1_st)) || (E_1 == \old(E_1) && E_M == \old(E_M))) || !(1 == m_i)) || 1 == \old(E_M)) && (((((((((!(1 == t1_i) || !(0 == m_st)) || !(2 <= \old(E_1))) || 0 == \old(E_M)) || 1 == t1_pc) || 1 == m_pc) || !(0 == t1_st)) || (E_1 == \old(E_1) && E_M == \old(E_M))) || !(1 == m_i)) || 1 == \old(E_M))) && ((((((((((!(1 == t1_i) || !(1 == t1_pc)) || !(token <= local)) || !(2 <= t1_st)) || !(2 <= \old(E_1))) || !(2 <= m_st)) || 0 == \old(E_M)) || !(local <= token)) || (E_1 == \old(E_1) && E_M == \old(E_M))) || !(1 == m_i)) || 1 == \old(E_M)) - ProcedureContractResult [Line: 156]: Procedure Contract for init_threads Derived contract for procedure init_threads: ((((((((!(2 <= E_1) || !(1 == t1_i)) || !(0 == \old(m_st))) || (0 == m_st && 0 == t1_st)) || 1 == E_M) || !(0 == \old(t1_st))) || 1 == t1_pc) || 1 == m_pc) || 0 == E_M) || !(1 == m_i) - ProcedureContractResult [Line: 462]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for error Derived contract for procedure error: 1 - ProcedureContractResult [Line: 30]: Procedure Contract for master Derived contract for procedure master: ((((((((((!(1 == t1_i) || 1 == E_M) || !(1 == \old(m_st))) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || ((((2 <= E_1 && 0 == t1_st) && token <= local) && local <= token) && 2 <= m_st)) || !(0 == \old(t1_st))) || 1 == t1_pc) || 0 == E_M) || !(1 == m_i)) && (((((((((!(1 == t1_i) || !(1 == t1_pc)) || 1 == E_M) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || 1 == \old(m_pc)) || ((((((((2 <= E_1 && 1 == t1_i) && !(1 == E_M)) && 0 == t1_st) && token <= local) && 1 == t1_pc) && 1 == m_i) && local <= token) && 2 <= m_st)) || 0 == E_M) || ((((((((2 <= E_1 && 1 == t1_i) && !(1 == E_M)) && token <= local) && 1 == t1_pc) && 2 <= t1_st) && 1 == m_i) && local <= token) && 2 <= m_st)) || !(1 == m_i))) && ((((((((((!(1 == t1_i) || !(1 == t1_pc)) || 1 == E_M) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(local) + 1 <= \old(token))) || ((((((((2 <= E_1 && 1 == t1_i) && !(1 == E_M)) && 0 == t1_st) && token <= local) && 1 == t1_pc) && 1 == m_i) && local <= token) && 2 <= m_st)) || 0 == E_M) || ((((((((2 <= E_1 && 1 == t1_i) && !(1 == E_M)) && token <= local) && 1 == t1_pc) && 2 <= t1_st) && 1 == m_i) && local <= token) && 2 <= m_st)) || !(1 == m_i)) - ProcedureContractResult [Line: 337]: Procedure Contract for fire_time_events Derived contract for procedure fire_time_events: 1 - ProcedureContractResult [Line: 194]: Procedure Contract for eval Derived contract for procedure eval: ((((((((((((!(1 == t1_i) || !(0 == \old(m_st))) || !(2 <= \old(E_1))) || 0 == \old(E_M)) || ((((((((2 <= E_1 && !(0 == E_M)) && !(1 == E_M)) && token <= local) && 1 == t1_pc) && 2 <= t1_st) && 1 == m_i) && local <= token) && 2 <= m_st)) || 1 == \old(m_pc)) || !(0 == \old(t1_st))) || 1 == \old(t1_pc)) || !(1 == m_i)) || 1 == \old(E_M)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st)) && (((((((((((!(1 == t1_i) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || ((((((((2 <= E_1 && !(0 == E_M)) && !(1 == E_M)) && token <= local) && 1 == t1_pc) && 2 <= t1_st) && 1 == m_i) && local <= token) && 2 <= m_st)) || !(\old(local) <= \old(token))) || 0 == \old(E_M)) || !(0 == \old(t1_st))) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st)) || 1 == \old(E_M))) && (((((((((((!(1 == t1_i) || (((((((m_st == \old(m_st) && \old(t1_st) == t1_st) && E_1 == \old(E_1)) && token <= local) && 1 == t1_pc) && E_M == \old(E_M)) && local <= token) && \old(token) == token)) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(\old(local) <= \old(token))) || 0 == \old(E_M)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) || 1 == \old(E_M)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st))) && (((1 == \old(m_pc) || !(2 <= \old(m_st))) || !(1 == m_i)) || ((!(1 == m_pc) && 1 == m_i) && 2 <= m_st)) - ProcedureContractResult [Line: 384]: Procedure Contract for stop_simulation Derived contract for procedure stop_simulation: 1 - ProcedureContractResult [Line: 148]: Procedure Contract for update_channels Derived contract for procedure update_channels: 1 - ProcedureContractResult [Line: 245]: Procedure Contract for fire_delta_events Derived contract for procedure fire_delta_events: (((((((((!(1 == t1_i) || !(0 == m_st)) || !(2 <= \old(E_1))) || 0 == \old(E_M)) || 1 == t1_pc) || 1 == m_pc) || !(0 == t1_st)) || (E_1 == \old(E_1) && E_M == \old(E_M))) || !(1 == m_i)) || 1 == \old(E_M)) && ((((((((((!(1 == t1_i) || !(1 == t1_pc)) || !(token <= local)) || !(2 <= t1_st)) || !(2 <= \old(E_1))) || !(2 <= m_st)) || 0 == \old(E_M)) || !(local <= token)) || (E_1 == \old(E_1) && E_M == \old(E_M))) || !(1 == m_i)) || 1 == \old(E_M)) - ProcedureContractResult [Line: 403]: Procedure Contract for start_simulation Derived contract for procedure start_simulation: 1 - ProcedureContractResult [Line: 110]: Procedure Contract for is_master_triggered Derived contract for procedure is_master_triggered: ((((((((((((0 <= __retres1 && !(1 == m_pc)) && \result <= 0) && __retres1 <= 0) && 1 == m_i) && 0 <= \result) || !(2 <= m_st)) || 1 == m_pc) || !(1 == m_i)) && ((((((((!(1 == t1_i) || !(1 == t1_pc)) || (((0 <= __retres1 && \result <= 0) && __retres1 <= 0) && 0 <= \result)) || !(token <= local)) || 1 == E_M) || !(2 <= t1_st)) || 0 == E_M) || !(local <= token)) || !(1 == m_i))) && ((((((((((!(1 == t1_i) || !(token <= local)) || (((0 <= __retres1 && \result <= 0) && __retres1 <= 0) && 0 <= \result)) || 1 == E_M) || !(1 == m_st)) || 1 == t1_pc) || 1 == m_pc) || 0 == E_M) || !(local <= token)) || !(0 == t1_st)) || !(1 == m_i))) && ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == t1_pc)) || (((((0 <= __retres1 && !(1 == m_pc)) && \result <= 0) && __retres1 <= 0) && 1 == m_i) && 0 <= \result)) || !(1 == E_M)) || 0 == t1_st) || !(2 <= m_st)) || !(local + 1 <= token)) || (1 <= __retres1 && 1 <= \result)) || !(token <= local + 1)) || !(1 == m_i))) && ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == t1_pc)) || !(token <= local)) || (((0 <= __retres1 && \result <= 0) && __retres1 <= 0) && 0 <= \result)) || 1 == E_M) || !(2 <= m_st)) || 0 == E_M) || !(local <= token)) || !(0 == t1_st)) || !(1 == m_i))) && (((((((((!(2 <= E_1) || !(1 == t1_i)) || !(0 == m_st)) || (((0 <= __retres1 && \result <= 0) && __retres1 <= 0) && 0 <= \result)) || 1 == E_M) || 1 == t1_pc) || 1 == m_pc) || 0 == E_M) || !(0 == t1_st)) || !(1 == m_i)) - ProcedureContractResult [Line: 346]: Procedure Contract for reset_time_events Derived contract for procedure reset_time_events: ((((((((((!(1 == t1_i) || !(1 == t1_pc)) || !(token <= local)) || !(2 <= \old(E_1))) || !(2 <= m_st)) || 0 == \old(E_M)) || !(local <= token)) || !(0 == t1_st)) || (E_1 == \old(E_1) && E_M == \old(E_M))) || !(1 == m_i)) || 1 == \old(E_M)) && ((((((((((!(1 == t1_i) || !(1 == t1_pc)) || !(token <= local)) || !(2 <= t1_st)) || !(2 <= \old(E_1))) || !(2 <= m_st)) || 0 == \old(E_M)) || !(local <= token)) || (E_1 == \old(E_1) && E_M == \old(E_M))) || !(1 == m_i)) || 1 == \old(E_M)) - ProcedureContractResult [Line: 374]: Procedure Contract for init_model Derived contract for procedure init_model: ((((((((!(2 <= E_1) || 1 == \old(t1_i)) || !(0 == m_st)) || 1 == E_M) || \old(m_i) == 1) || (1 == t1_i && 1 == m_i)) || 1 == t1_pc) || 1 == m_pc) || 0 == E_M) || !(0 == t1_st) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 218 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 55.4s, OverallIterations: 15, TraceHistogramMax: 7, AutomataDifference: 43.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 91.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4010 SDtfs, 15553 SDslu, 1723 SDs, 0 SdLazy, 24013 SolverSat, 5644 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1283 GetRequests, 857 SyntacticMatches, 2 SemanticMatches, 424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4359occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 7685 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 218 LocationsWithAnnotation, 31527 PreInvPairs, 37526 NumberOfFragments, 29184 HoareAnnotationTreeSize, 31527 FomulaSimplifications, 28528690437 FormulaSimplificationTreeSizeReduction, 22.4s HoareSimplificationTime, 218 FomulaSimplificationsInter, 60493419 FormulaSimplificationTreeSizeReductionInter, 68.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...