/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 02:40:51,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 02:40:51,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 02:40:52,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 02:40:52,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 02:40:52,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 02:40:52,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 02:40:52,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 02:40:52,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 02:40:52,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 02:40:52,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 02:40:52,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 02:40:52,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 02:40:52,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 02:40:52,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 02:40:52,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 02:40:52,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 02:40:52,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 02:40:52,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 02:40:52,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 02:40:52,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 02:40:52,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 02:40:52,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 02:40:52,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 02:40:52,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 02:40:52,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 02:40:52,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 02:40:52,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 02:40:52,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 02:40:52,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 02:40:52,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 02:40:52,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 02:40:52,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 02:40:52,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 02:40:52,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 02:40:52,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 02:40:52,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 02:40:52,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 02:40:52,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 02:40:52,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 02:40:52,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 02:40:52,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 02:40:52,148 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 02:40:52,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 02:40:52,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 02:40:52,150 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 02:40:52,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 02:40:52,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 02:40:52,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 02:40:52,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 02:40:52,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 02:40:52,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 02:40:52,152 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 02:40:52,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 02:40:52,153 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 02:40:52,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 02:40:52,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 02:40:52,154 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 02:40:52,154 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 02:40:52,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 02:40:52,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 02:40:52,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 02:40:52,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 02:40:52,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 02:40:52,156 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 02:40:52,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 02:40:52,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 02:40:52,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 02:40:52,600 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 02:40:52,601 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 02:40:52,602 INFO L432 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-10-24 02:40:52,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313641c60/a26925e9c09f4d9eb180b89dccd8a489/FLAG2f9053d0a [2020-10-24 02:40:53,365 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 02:40:53,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-10-24 02:40:53,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313641c60/a26925e9c09f4d9eb180b89dccd8a489/FLAG2f9053d0a [2020-10-24 02:40:53,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313641c60/a26925e9c09f4d9eb180b89dccd8a489 [2020-10-24 02:40:53,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 02:40:53,743 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 02:40:53,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 02:40:53,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 02:40:53,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 02:40:53,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:40:53" (1/1) ... [2020-10-24 02:40:53,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1526b808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:53, skipping insertion in model container [2020-10-24 02:40:53,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:40:53" (1/1) ... [2020-10-24 02:40:53,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 02:40:53,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 02:40:54,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:40:54,032 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 02:40:54,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:40:54,134 INFO L208 MainTranslator]: Completed translation [2020-10-24 02:40:54,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:54 WrapperNode [2020-10-24 02:40:54,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 02:40:54,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 02:40:54,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 02:40:54,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 02:40:54,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:54" (1/1) ... [2020-10-24 02:40:54,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:54" (1/1) ... [2020-10-24 02:40:54,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:54" (1/1) ... [2020-10-24 02:40:54,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:54" (1/1) ... [2020-10-24 02:40:54,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:54" (1/1) ... [2020-10-24 02:40:54,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:54" (1/1) ... [2020-10-24 02:40:54,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:54" (1/1) ... [2020-10-24 02:40:54,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 02:40:54,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 02:40:54,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 02:40:54,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 02:40:54,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:54" (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-10-24 02:40:54,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 02:40:54,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 02:40:54,269 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 02:40:54,270 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-10-24 02:40:54,270 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-10-24 02:40:54,270 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-10-24 02:40:54,270 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-10-24 02:40:54,270 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-10-24 02:40:54,270 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-10-24 02:40:54,271 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-10-24 02:40:54,271 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-10-24 02:40:54,271 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-10-24 02:40:54,271 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-10-24 02:40:54,271 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-10-24 02:40:54,271 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-10-24 02:40:54,272 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-10-24 02:40:54,272 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-10-24 02:40:54,272 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-10-24 02:40:54,272 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-10-24 02:40:54,272 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-10-24 02:40:54,272 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-10-24 02:40:54,273 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 02:40:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 02:40:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 02:40:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 02:40:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 02:40:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-10-24 02:40:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-10-24 02:40:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-10-24 02:40:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-10-24 02:40:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 02:40:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-10-24 02:40:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-10-24 02:40:54,275 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-10-24 02:40:54,275 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-10-24 02:40:54,275 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-10-24 02:40:54,275 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-10-24 02:40:54,275 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-10-24 02:40:54,275 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-10-24 02:40:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-10-24 02:40:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-10-24 02:40:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-10-24 02:40:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-10-24 02:40:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-10-24 02:40:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-10-24 02:40:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 02:40:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 02:40:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 02:40:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 02:40:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 02:40:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 02:40:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 02:40:55,157 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 02:40:55,158 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-10-24 02:40:55,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:40:55 BoogieIcfgContainer [2020-10-24 02:40:55,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 02:40:55,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 02:40:55,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 02:40:55,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 02:40:55,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:40:53" (1/3) ... [2020-10-24 02:40:55,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136f2dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:40:55, skipping insertion in model container [2020-10-24 02:40:55,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:40:54" (2/3) ... [2020-10-24 02:40:55,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136f2dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:40:55, skipping insertion in model container [2020-10-24 02:40:55,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:40:55" (3/3) ... [2020-10-24 02:40:55,180 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-10-24 02:40:55,196 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 02:40:55,204 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 02:40:55,227 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 02:40:55,267 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 02:40:55,267 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 02:40:55,268 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 02:40:55,268 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 02:40:55,268 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 02:40:55,268 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 02:40:55,268 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 02:40:55,269 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 02:40:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states. [2020-10-24 02:40:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-10-24 02:40:55,331 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:55,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:55,334 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:55,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1506744400, now seen corresponding path program 1 times [2020-10-24 02:40:55,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:55,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [95070920] [2020-10-24 02:40:55,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:55,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:56,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:40:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:56,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:40:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:56,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:40:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:56,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:40:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:56,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:40:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:56,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:40:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:56,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:40:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:56,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:40:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:56,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:40:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:40:56,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [95070920] [2020-10-24 02:40:56,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:40:56,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-24 02:40:56,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618221488] [2020-10-24 02:40:56,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:40:56,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:56,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:40:56,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:40:56,234 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 7 states. [2020-10-24 02:40:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:59,340 INFO L93 Difference]: Finished difference Result 786 states and 1048 transitions. [2020-10-24 02:40:59,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 02:40:59,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2020-10-24 02:40:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:59,385 INFO L225 Difference]: With dead ends: 786 [2020-10-24 02:40:59,385 INFO L226 Difference]: Without dead ends: 581 [2020-10-24 02:40:59,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:40:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-10-24 02:40:59,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 400. [2020-10-24 02:40:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-10-24 02:40:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 484 transitions. [2020-10-24 02:40:59,617 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 484 transitions. Word has length 116 [2020-10-24 02:40:59,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:59,619 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 484 transitions. [2020-10-24 02:40:59,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:40:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 484 transitions. [2020-10-24 02:40:59,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-10-24 02:40:59,625 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:59,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:59,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 02:40:59,626 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:59,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:59,627 INFO L82 PathProgramCache]: Analyzing trace with hash -471057246, now seen corresponding path program 1 times [2020-10-24 02:40:59,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:59,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1105239801] [2020-10-24 02:40:59,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:59,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:59,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:40:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:59,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:40:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:59,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:40:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:59,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:40:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:59,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:40:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:59,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:40:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:59,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:40:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:59,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:40:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:59,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:40:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:00,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 02:41:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:00,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-24 02:41:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:00,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:00,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:00,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:00,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-10-24 02:41:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-24 02:41:00,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1105239801] [2020-10-24 02:41:00,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:41:00,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-24 02:41:00,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485561960] [2020-10-24 02:41:00,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:41:00,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:00,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:41:00,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:41:00,348 INFO L87 Difference]: Start difference. First operand 400 states and 484 transitions. Second operand 10 states. [2020-10-24 02:41:04,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:04,503 INFO L93 Difference]: Finished difference Result 1537 states and 2105 transitions. [2020-10-24 02:41:04,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 02:41:04,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 179 [2020-10-24 02:41:04,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:04,521 INFO L225 Difference]: With dead ends: 1537 [2020-10-24 02:41:04,521 INFO L226 Difference]: Without dead ends: 1185 [2020-10-24 02:41:04,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2020-10-24 02:41:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-10-24 02:41:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 763. [2020-10-24 02:41:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2020-10-24 02:41:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 961 transitions. [2020-10-24 02:41:04,779 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 961 transitions. Word has length 179 [2020-10-24 02:41:04,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:04,784 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 961 transitions. [2020-10-24 02:41:04,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:41:04,785 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 961 transitions. [2020-10-24 02:41:04,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-10-24 02:41:04,801 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:04,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:04,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 02:41:04,802 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:04,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:04,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1422926590, now seen corresponding path program 1 times [2020-10-24 02:41:04,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:04,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1566692705] [2020-10-24 02:41:04,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:41:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:04,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:41:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:05,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:41:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:05,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:41:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:05,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:05,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:05,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:05,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:41:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:05,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 02:41:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:05,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-24 02:41:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:05,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:05,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:05,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:05,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-10-24 02:41:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-10-24 02:41:05,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1566692705] [2020-10-24 02:41:05,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:41:05,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-24 02:41:05,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420337357] [2020-10-24 02:41:05,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:41:05,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:05,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:41:05,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:41:05,204 INFO L87 Difference]: Start difference. First operand 763 states and 961 transitions. Second operand 9 states. [2020-10-24 02:41:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:07,740 INFO L93 Difference]: Finished difference Result 1788 states and 2319 transitions. [2020-10-24 02:41:07,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 02:41:07,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2020-10-24 02:41:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:07,758 INFO L225 Difference]: With dead ends: 1788 [2020-10-24 02:41:07,759 INFO L226 Difference]: Without dead ends: 1071 [2020-10-24 02:41:07,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2020-10-24 02:41:07,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2020-10-24 02:41:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 757. [2020-10-24 02:41:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2020-10-24 02:41:07,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 950 transitions. [2020-10-24 02:41:07,970 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 950 transitions. Word has length 179 [2020-10-24 02:41:07,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:07,972 INFO L481 AbstractCegarLoop]: Abstraction has 757 states and 950 transitions. [2020-10-24 02:41:07,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:41:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 950 transitions. [2020-10-24 02:41:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-10-24 02:41:07,976 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:07,976 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:07,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 02:41:07,983 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:07,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:07,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1075147907, now seen corresponding path program 1 times [2020-10-24 02:41:07,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:07,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [207881060] [2020-10-24 02:41:07,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:41:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:41:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:41:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:41:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:41:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 02:41:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-24 02:41:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-10-24 02:41:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-10-24 02:41:08,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [207881060] [2020-10-24 02:41:08,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:41:08,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-24 02:41:08,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074165069] [2020-10-24 02:41:08,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:41:08,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:08,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:41:08,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:41:08,362 INFO L87 Difference]: Start difference. First operand 757 states and 950 transitions. Second operand 11 states. [2020-10-24 02:41:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:16,113 INFO L93 Difference]: Finished difference Result 4460 states and 6052 transitions. [2020-10-24 02:41:16,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-10-24 02:41:16,114 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 184 [2020-10-24 02:41:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:16,145 INFO L225 Difference]: With dead ends: 4460 [2020-10-24 02:41:16,145 INFO L226 Difference]: Without dead ends: 3748 [2020-10-24 02:41:16,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2020-10-24 02:41:16,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2020-10-24 02:41:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 2960. [2020-10-24 02:41:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2960 states. [2020-10-24 02:41:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2960 states and 3739 transitions. [2020-10-24 02:41:16,886 INFO L78 Accepts]: Start accepts. Automaton has 2960 states and 3739 transitions. Word has length 184 [2020-10-24 02:41:16,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:16,887 INFO L481 AbstractCegarLoop]: Abstraction has 2960 states and 3739 transitions. [2020-10-24 02:41:16,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:41:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2960 states and 3739 transitions. [2020-10-24 02:41:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-10-24 02:41:16,896 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:16,896 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, 2, 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] [2020-10-24 02:41:16,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 02:41:16,897 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:16,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:16,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1695855478, now seen corresponding path program 1 times [2020-10-24 02:41:16,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:16,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [524643984] [2020-10-24 02:41:16,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:41:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:41:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:41:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:41:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:41:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 02:41:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-24 02:41:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:41:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2020-10-24 02:41:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:41:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:41:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-10-24 02:41:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:17,421 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 29 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-10-24 02:41:17,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [524643984] [2020-10-24 02:41:17,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:41:17,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:41:17,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418904281] [2020-10-24 02:41:17,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:41:17,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:17,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:41:17,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:41:17,432 INFO L87 Difference]: Start difference. First operand 2960 states and 3739 transitions. Second operand 12 states. [2020-10-24 02:41:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:21,067 INFO L93 Difference]: Finished difference Result 6449 states and 8415 transitions. [2020-10-24 02:41:21,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 02:41:21,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 228 [2020-10-24 02:41:21,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:21,096 INFO L225 Difference]: With dead ends: 6449 [2020-10-24 02:41:21,097 INFO L226 Difference]: Without dead ends: 3224 [2020-10-24 02:41:21,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=224, Invalid=532, Unknown=0, NotChecked=0, Total=756 [2020-10-24 02:41:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2020-10-24 02:41:21,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 2414. [2020-10-24 02:41:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2414 states. [2020-10-24 02:41:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 2984 transitions. [2020-10-24 02:41:21,709 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 2984 transitions. Word has length 228 [2020-10-24 02:41:21,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:21,710 INFO L481 AbstractCegarLoop]: Abstraction has 2414 states and 2984 transitions. [2020-10-24 02:41:21,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:41:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 2984 transitions. [2020-10-24 02:41:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-10-24 02:41:21,716 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:21,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:21,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 02:41:21,717 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:21,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:21,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1709667110, now seen corresponding path program 1 times [2020-10-24 02:41:21,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:21,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1003815488] [2020-10-24 02:41:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:41:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:41:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:41:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:41:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:41:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 02:41:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-24 02:41:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:21,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-10-24 02:41:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:22,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:41:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:22,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:22,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:22,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:41:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:22,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-10-24 02:41:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-10-24 02:41:22,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1003815488] [2020-10-24 02:41:22,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:41:22,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-24 02:41:22,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643048874] [2020-10-24 02:41:22,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:41:22,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:22,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:41:22,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:41:22,097 INFO L87 Difference]: Start difference. First operand 2414 states and 2984 transitions. Second operand 11 states. [2020-10-24 02:41:26,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:26,869 INFO L93 Difference]: Finished difference Result 6907 states and 8962 transitions. [2020-10-24 02:41:26,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 02:41:26,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2020-10-24 02:41:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:26,904 INFO L225 Difference]: With dead ends: 6907 [2020-10-24 02:41:26,904 INFO L226 Difference]: Without dead ends: 4538 [2020-10-24 02:41:26,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2020-10-24 02:41:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4538 states. [2020-10-24 02:41:27,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4538 to 3624. [2020-10-24 02:41:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3624 states. [2020-10-24 02:41:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 4394 transitions. [2020-10-24 02:41:27,705 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 4394 transitions. Word has length 228 [2020-10-24 02:41:27,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:27,705 INFO L481 AbstractCegarLoop]: Abstraction has 3624 states and 4394 transitions. [2020-10-24 02:41:27,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:41:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 4394 transitions. [2020-10-24 02:41:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2020-10-24 02:41:27,714 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:27,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:27,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 02:41:27,715 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:27,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:27,716 INFO L82 PathProgramCache]: Analyzing trace with hash -730853257, now seen corresponding path program 1 times [2020-10-24 02:41:27,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:27,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [250112722] [2020-10-24 02:41:27,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:27,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:27,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:27,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:41:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:27,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:41:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:27,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:41:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:27,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:41:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:27,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:27,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:27,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:27,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:41:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:27,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 02:41:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:27,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-24 02:41:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:27,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:27,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:27,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:28,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-10-24 02:41:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:28,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-10-24 02:41:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:28,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-10-24 02:41:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:28,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:41:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:28,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:28,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:28,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:41:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:28,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2020-10-24 02:41:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-10-24 02:41:28,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [250112722] [2020-10-24 02:41:28,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:41:28,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:41:28,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828108111] [2020-10-24 02:41:28,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:41:28,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:28,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:41:28,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:41:28,208 INFO L87 Difference]: Start difference. First operand 3624 states and 4394 transitions. Second operand 12 states. [2020-10-24 02:41:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:36,568 INFO L93 Difference]: Finished difference Result 7013 states and 8631 transitions. [2020-10-24 02:41:36,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-10-24 02:41:36,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 257 [2020-10-24 02:41:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:36,600 INFO L225 Difference]: With dead ends: 7013 [2020-10-24 02:41:36,600 INFO L226 Difference]: Without dead ends: 4573 [2020-10-24 02:41:36,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=689, Invalid=3217, Unknown=0, NotChecked=0, Total=3906 [2020-10-24 02:41:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2020-10-24 02:41:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 3666. [2020-10-24 02:41:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3666 states. [2020-10-24 02:41:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 4342 transitions. [2020-10-24 02:41:37,297 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 4342 transitions. Word has length 257 [2020-10-24 02:41:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:37,298 INFO L481 AbstractCegarLoop]: Abstraction has 3666 states and 4342 transitions. [2020-10-24 02:41:37,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:41:37,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 4342 transitions. [2020-10-24 02:41:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-10-24 02:41:37,308 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:37,308 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:37,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 02:41:37,308 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:37,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:37,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1731988670, now seen corresponding path program 1 times [2020-10-24 02:41:37,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:37,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1336552853] [2020-10-24 02:41:37,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:41:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:41:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:41:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:41:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:41:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:41:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-24 02:41:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-10-24 02:41:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-24 02:41:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-10-24 02:41:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:41:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:41:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2020-10-24 02:41:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-10-24 02:41:37,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1336552853] [2020-10-24 02:41:37,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:41:37,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-24 02:41:37,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67308333] [2020-10-24 02:41:37,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 02:41:37,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:37,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 02:41:37,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:41:37,810 INFO L87 Difference]: Start difference. First operand 3666 states and 4342 transitions. Second operand 17 states. [2020-10-24 02:41:46,334 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-24 02:41:49,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:49,662 INFO L93 Difference]: Finished difference Result 8415 states and 10549 transitions. [2020-10-24 02:41:49,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2020-10-24 02:41:49,663 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 263 [2020-10-24 02:41:49,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:49,692 INFO L225 Difference]: With dead ends: 8415 [2020-10-24 02:41:49,692 INFO L226 Difference]: Without dead ends: 4793 [2020-10-24 02:41:49,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3887 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1782, Invalid=8724, Unknown=0, NotChecked=0, Total=10506 [2020-10-24 02:41:49,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4793 states. [2020-10-24 02:41:50,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4793 to 3674. [2020-10-24 02:41:50,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3674 states. [2020-10-24 02:41:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3674 states to 3674 states and 4249 transitions. [2020-10-24 02:41:50,606 INFO L78 Accepts]: Start accepts. Automaton has 3674 states and 4249 transitions. Word has length 263 [2020-10-24 02:41:50,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:50,607 INFO L481 AbstractCegarLoop]: Abstraction has 3674 states and 4249 transitions. [2020-10-24 02:41:50,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 02:41:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3674 states and 4249 transitions. [2020-10-24 02:41:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-10-24 02:41:50,616 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:50,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:50,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 02:41:50,617 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:50,617 INFO L82 PathProgramCache]: Analyzing trace with hash -928461701, now seen corresponding path program 1 times [2020-10-24 02:41:50,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:50,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2115217765] [2020-10-24 02:41:50,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:41:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:41:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:41:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:41:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:41:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:41:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-24 02:41:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-10-24 02:41:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-24 02:41:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:50,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-10-24 02:41:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:51,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:41:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:51,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:51,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:51,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:41:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:51,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2020-10-24 02:41:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-10-24 02:41:51,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2115217765] [2020-10-24 02:41:51,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:41:51,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:41:51,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090081556] [2020-10-24 02:41:51,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:41:51,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:51,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:41:51,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:41:51,161 INFO L87 Difference]: Start difference. First operand 3674 states and 4249 transitions. Second operand 12 states. [2020-10-24 02:41:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:58,496 INFO L93 Difference]: Finished difference Result 10323 states and 12288 transitions. [2020-10-24 02:41:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-10-24 02:41:58,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 263 [2020-10-24 02:41:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:58,547 INFO L225 Difference]: With dead ends: 10323 [2020-10-24 02:41:58,547 INFO L226 Difference]: Without dead ends: 7591 [2020-10-24 02:41:58,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2020-10-24 02:41:58,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7591 states. [2020-10-24 02:42:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7591 to 6221. [2020-10-24 02:42:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-10-24 02:42:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 7326 transitions. [2020-10-24 02:42:00,088 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 7326 transitions. Word has length 263 [2020-10-24 02:42:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:00,090 INFO L481 AbstractCegarLoop]: Abstraction has 6221 states and 7326 transitions. [2020-10-24 02:42:00,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:42:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 7326 transitions. [2020-10-24 02:42:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2020-10-24 02:42:00,101 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:00,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:42:00,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 02:42:00,102 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:00,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:00,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1796451529, now seen corresponding path program 1 times [2020-10-24 02:42:00,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:00,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1142128057] [2020-10-24 02:42:00,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:42:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:42:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:42:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:42:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:42:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 02:42:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-24 02:42:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-10-24 02:42:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-10-24 02:42:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-10-24 02:42:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2020-10-24 02:42:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:42:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2020-10-24 02:42:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2020-10-24 02:42:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2020-10-24 02:42:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2020-10-24 02:42:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-24 02:42:00,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1142128057] [2020-10-24 02:42:00,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:00,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 02:42:00,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766033504] [2020-10-24 02:42:00,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 02:42:00,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:00,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 02:42:00,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:42:00,542 INFO L87 Difference]: Start difference. First operand 6221 states and 7326 transitions. Second operand 13 states. [2020-10-24 02:42:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:05,261 INFO L93 Difference]: Finished difference Result 10840 states and 12764 transitions. [2020-10-24 02:42:05,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-10-24 02:42:05,262 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 284 [2020-10-24 02:42:05,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:05,287 INFO L225 Difference]: With dead ends: 10840 [2020-10-24 02:42:05,288 INFO L226 Difference]: Without dead ends: 4665 [2020-10-24 02:42:05,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=490, Invalid=1490, Unknown=0, NotChecked=0, Total=1980 [2020-10-24 02:42:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4665 states. [2020-10-24 02:42:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4665 to 3929. [2020-10-24 02:42:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2020-10-24 02:42:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 4552 transitions. [2020-10-24 02:42:06,120 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 4552 transitions. Word has length 284 [2020-10-24 02:42:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:06,120 INFO L481 AbstractCegarLoop]: Abstraction has 3929 states and 4552 transitions. [2020-10-24 02:42:06,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 02:42:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 4552 transitions. [2020-10-24 02:42:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2020-10-24 02:42:06,125 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:06,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:42:06,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 02:42:06,126 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:06,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:06,126 INFO L82 PathProgramCache]: Analyzing trace with hash -3043505, now seen corresponding path program 1 times [2020-10-24 02:42:06,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:06,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [245148982] [2020-10-24 02:42:06,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:42:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:42:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:42:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:42:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:42:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 02:42:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-24 02:42:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-10-24 02:42:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-24 02:42:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-10-24 02:42:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-10-24 02:42:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-10-24 02:42:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:42:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2020-10-24 02:42:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2020-10-24 02:42:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-10-24 02:42:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2020-10-24 02:42:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 53 proven. 14 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-10-24 02:42:06,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [245148982] [2020-10-24 02:42:06,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:06,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 02:42:06,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357019879] [2020-10-24 02:42:06,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 02:42:06,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:06,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 02:42:06,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-10-24 02:42:06,703 INFO L87 Difference]: Start difference. First operand 3929 states and 4552 transitions. Second operand 16 states. [2020-10-24 02:42:07,121 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2020-10-24 02:42:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:14,524 INFO L93 Difference]: Finished difference Result 9855 states and 12115 transitions. [2020-10-24 02:42:14,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-10-24 02:42:14,524 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 293 [2020-10-24 02:42:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:14,563 INFO L225 Difference]: With dead ends: 9855 [2020-10-24 02:42:14,563 INFO L226 Difference]: Without dead ends: 5976 [2020-10-24 02:42:14,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=896, Invalid=3526, Unknown=0, NotChecked=0, Total=4422 [2020-10-24 02:42:14,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-10-24 02:42:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 4920. [2020-10-24 02:42:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4920 states. [2020-10-24 02:42:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4920 states to 4920 states and 5549 transitions. [2020-10-24 02:42:15,757 INFO L78 Accepts]: Start accepts. Automaton has 4920 states and 5549 transitions. Word has length 293 [2020-10-24 02:42:15,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:15,758 INFO L481 AbstractCegarLoop]: Abstraction has 4920 states and 5549 transitions. [2020-10-24 02:42:15,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 02:42:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 4920 states and 5549 transitions. [2020-10-24 02:42:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2020-10-24 02:42:15,769 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:15,769 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 02:42:15,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 02:42:15,770 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:15,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:15,770 INFO L82 PathProgramCache]: Analyzing trace with hash 686538755, now seen corresponding path program 1 times [2020-10-24 02:42:15,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:15,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1220976815] [2020-10-24 02:42:15,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:15,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:15,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:15,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:42:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:15,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:42:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:15,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:42:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:15,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:42:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:15,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:15,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:15,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:42:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-24 02:42:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-10-24 02:42:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:42:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-24 02:42:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-10-24 02:42:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:42:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2020-10-24 02:42:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2020-10-24 02:42:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2020-10-24 02:42:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2020-10-24 02:42:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2020-10-24 02:42:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2020-10-24 02:42:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2020-10-24 02:42:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2020-10-24 02:42:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2020-10-24 02:42:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:42:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:42:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2020-10-24 02:42:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 118 proven. 37 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2020-10-24 02:42:16,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1220976815] [2020-10-24 02:42:16,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:16,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 02:42:16,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378987274] [2020-10-24 02:42:16,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:42:16,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:16,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:42:16,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:42:16,412 INFO L87 Difference]: Start difference. First operand 4920 states and 5549 transitions. Second operand 11 states. [2020-10-24 02:42:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:20,189 INFO L93 Difference]: Finished difference Result 9579 states and 11063 transitions. [2020-10-24 02:42:20,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 02:42:20,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 428 [2020-10-24 02:42:20,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:20,212 INFO L225 Difference]: With dead ends: 9579 [2020-10-24 02:42:20,212 INFO L226 Difference]: Without dead ends: 4879 [2020-10-24 02:42:20,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2020-10-24 02:42:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2020-10-24 02:42:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 4498. [2020-10-24 02:42:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4498 states. [2020-10-24 02:42:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 5020 transitions. [2020-10-24 02:42:21,267 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 5020 transitions. Word has length 428 [2020-10-24 02:42:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:21,268 INFO L481 AbstractCegarLoop]: Abstraction has 4498 states and 5020 transitions. [2020-10-24 02:42:21,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:42:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 5020 transitions. [2020-10-24 02:42:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2020-10-24 02:42:21,277 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:21,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:42:21,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 02:42:21,278 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:21,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:21,279 INFO L82 PathProgramCache]: Analyzing trace with hash -818266378, now seen corresponding path program 1 times [2020-10-24 02:42:21,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:21,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2074835097] [2020-10-24 02:42:21,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:42:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:42:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:42:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:42:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:42:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-24 02:42:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-10-24 02:42:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:42:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-24 02:42:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-10-24 02:42:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:42:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-10-24 02:42:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2020-10-24 02:42:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2020-10-24 02:42:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2020-10-24 02:42:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2020-10-24 02:42:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2020-10-24 02:42:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2020-10-24 02:42:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2020-10-24 02:42:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2020-10-24 02:42:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:42:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:42:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2020-10-24 02:42:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 108 proven. 37 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2020-10-24 02:42:21,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2074835097] [2020-10-24 02:42:21,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:21,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 02:42:21,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337726677] [2020-10-24 02:42:21,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 02:42:21,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:21,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 02:42:21,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:42:21,906 INFO L87 Difference]: Start difference. First operand 4498 states and 5020 transitions. Second operand 15 states. [2020-10-24 02:42:26,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:26,601 INFO L93 Difference]: Finished difference Result 6018 states and 6735 transitions. [2020-10-24 02:42:26,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-10-24 02:42:26,602 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 430 [2020-10-24 02:42:26,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:26,612 INFO L225 Difference]: With dead ends: 6018 [2020-10-24 02:42:26,613 INFO L226 Difference]: Without dead ends: 1790 [2020-10-24 02:42:26,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=449, Invalid=1621, Unknown=0, NotChecked=0, Total=2070 [2020-10-24 02:42:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2020-10-24 02:42:27,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1588. [2020-10-24 02:42:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-10-24 02:42:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 1723 transitions. [2020-10-24 02:42:27,104 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 1723 transitions. Word has length 430 [2020-10-24 02:42:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:27,105 INFO L481 AbstractCegarLoop]: Abstraction has 1588 states and 1723 transitions. [2020-10-24 02:42:27,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 02:42:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1723 transitions. [2020-10-24 02:42:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2020-10-24 02:42:27,111 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:27,112 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-24 02:42:27,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 02:42:27,112 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:27,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:27,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1676985734, now seen corresponding path program 1 times [2020-10-24 02:42:27,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:27,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1081339569] [2020-10-24 02:42:27,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:42:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:42:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:42:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:42:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:42:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 02:42:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-24 02:42:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-10-24 02:42:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-24 02:42:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-10-24 02:42:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-10-24 02:42:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-10-24 02:42:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-10-24 02:42:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-10-24 02:42:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2020-10-24 02:42:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2020-10-24 02:42:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2020-10-24 02:42:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-10-24 02:42:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2020-10-24 02:42:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2020-10-24 02:42:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2020-10-24 02:42:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2020-10-24 02:42:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:42:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2020-10-24 02:42:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2020-10-24 02:42:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2020-10-24 02:42:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2020-10-24 02:42:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:27,697 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2020-10-24 02:42:27,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1081339569] [2020-10-24 02:42:27,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:42:27,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-24 02:42:27,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478282530] [2020-10-24 02:42:27,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:42:27,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:27,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:42:27,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:42:27,700 INFO L87 Difference]: Start difference. First operand 1588 states and 1723 transitions. Second operand 12 states. [2020-10-24 02:42:31,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:31,220 INFO L93 Difference]: Finished difference Result 2873 states and 3125 transitions. [2020-10-24 02:42:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-24 02:42:31,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 438 [2020-10-24 02:42:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:31,235 INFO L225 Difference]: With dead ends: 2873 [2020-10-24 02:42:31,235 INFO L226 Difference]: Without dead ends: 1555 [2020-10-24 02:42:31,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=317, Invalid=943, Unknown=0, NotChecked=0, Total=1260 [2020-10-24 02:42:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2020-10-24 02:42:31,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1452. [2020-10-24 02:42:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2020-10-24 02:42:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1559 transitions. [2020-10-24 02:42:31,555 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1559 transitions. Word has length 438 [2020-10-24 02:42:31,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:31,556 INFO L481 AbstractCegarLoop]: Abstraction has 1452 states and 1559 transitions. [2020-10-24 02:42:31,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:42:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1559 transitions. [2020-10-24 02:42:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2020-10-24 02:42:31,561 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:31,562 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-24 02:42:31,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 02:42:31,562 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:31,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:31,563 INFO L82 PathProgramCache]: Analyzing trace with hash -318238593, now seen corresponding path program 1 times [2020-10-24 02:42:31,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:31,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [238040578] [2020-10-24 02:42:31,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:42:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:42:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:42:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:42:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:42:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 02:42:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-24 02:42:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-10-24 02:42:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-24 02:42:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-10-24 02:42:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-10-24 02:42:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-10-24 02:42:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-10-24 02:42:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-10-24 02:42:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2020-10-24 02:42:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2020-10-24 02:42:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2020-10-24 02:42:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2020-10-24 02:42:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2020-10-24 02:42:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2020-10-24 02:42:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2020-10-24 02:42:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2020-10-24 02:42:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:42:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2020-10-24 02:42:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2020-10-24 02:42:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2020-10-24 02:42:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:31,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2020-10-24 02:42:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 56 proven. 20 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2020-10-24 02:42:32,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [238040578] [2020-10-24 02:42:32,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:32,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 02:42:32,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307118155] [2020-10-24 02:42:32,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 02:42:32,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:32,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 02:42:32,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-10-24 02:42:32,108 INFO L87 Difference]: Start difference. First operand 1452 states and 1559 transitions. Second operand 14 states. [2020-10-24 02:42:35,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:35,087 INFO L93 Difference]: Finished difference Result 2747 states and 2968 transitions. [2020-10-24 02:42:35,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 02:42:35,088 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 439 [2020-10-24 02:42:35,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:35,097 INFO L225 Difference]: With dead ends: 2747 [2020-10-24 02:42:35,097 INFO L226 Difference]: Without dead ends: 1565 [2020-10-24 02:42:35,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2020-10-24 02:42:35,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2020-10-24 02:42:35,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1449. [2020-10-24 02:42:35,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2020-10-24 02:42:35,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 1553 transitions. [2020-10-24 02:42:35,641 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 1553 transitions. Word has length 439 [2020-10-24 02:42:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:35,642 INFO L481 AbstractCegarLoop]: Abstraction has 1449 states and 1553 transitions. [2020-10-24 02:42:35,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 02:42:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1553 transitions. [2020-10-24 02:42:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2020-10-24 02:42:35,647 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:35,648 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-10-24 02:42:35,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 02:42:35,648 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:35,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:35,649 INFO L82 PathProgramCache]: Analyzing trace with hash 784629983, now seen corresponding path program 1 times [2020-10-24 02:42:35,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:35,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1192693296] [2020-10-24 02:42:35,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:42:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:42:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:42:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:42:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:42:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-24 02:42:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-24 02:42:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-10-24 02:42:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-24 02:42:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-10-24 02:42:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-10-24 02:42:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2020-10-24 02:42:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-10-24 02:42:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2020-10-24 02:42:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2020-10-24 02:42:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2020-10-24 02:42:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:42:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2020-10-24 02:42:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2020-10-24 02:42:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2020-10-24 02:42:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2020-10-24 02:42:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2020-10-24 02:42:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2020-10-24 02:42:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:42:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2020-10-24 02:42:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2020-10-24 02:42:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2020-10-24 02:42:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2020-10-24 02:42:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2020-10-24 02:42:36,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1192693296] [2020-10-24 02:42:36,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:36,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 02:42:36,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217415560] [2020-10-24 02:42:36,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 02:42:36,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:36,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 02:42:36,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:42:36,198 INFO L87 Difference]: Start difference. First operand 1449 states and 1553 transitions. Second operand 15 states. [2020-10-24 02:42:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:39,686 INFO L93 Difference]: Finished difference Result 2282 states and 2452 transitions. [2020-10-24 02:42:39,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-10-24 02:42:39,686 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 439 [2020-10-24 02:42:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:39,688 INFO L225 Difference]: With dead ends: 2282 [2020-10-24 02:42:39,689 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 02:42:39,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=332, Invalid=1308, Unknown=0, NotChecked=0, Total=1640 [2020-10-24 02:42:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 02:42:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 02:42:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 02:42:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 02:42:39,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 439 [2020-10-24 02:42:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:39,696 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 02:42:39,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 02:42:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 02:42:39,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 02:42:39,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 02:42:39,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 02:42:41,029 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2020-10-24 02:42:41,758 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2020-10-24 02:42:42,136 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 114 [2020-10-24 02:42:42,528 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 116 [2020-10-24 02:42:42,820 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 119 [2020-10-24 02:42:42,979 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 127 [2020-10-24 02:42:43,098 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 127 [2020-10-24 02:42:44,001 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 139 [2020-10-24 02:42:44,195 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 139 [2020-10-24 02:42:44,505 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 119 [2020-10-24 02:42:49,863 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 105 [2020-10-24 02:42:50,045 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 105 [2020-10-24 02:42:50,177 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 105 [2020-10-24 02:42:51,509 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 140 [2020-10-24 02:42:54,798 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 127 [2020-10-24 02:42:55,085 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 119 [2020-10-24 02:42:55,289 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 118 [2020-10-24 02:42:57,171 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 127 [2020-10-24 02:42:57,523 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 119 [2020-10-24 02:42:57,728 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 118 [2020-10-24 02:42:58,056 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 131 [2020-10-24 02:42:58,172 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 131 [2020-10-24 02:42:58,347 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 117 [2020-10-24 02:42:58,690 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 121 [2020-10-24 02:43:02,471 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 124 [2020-10-24 02:43:03,135 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2020-10-24 02:43:05,660 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 124 [2020-10-24 02:43:06,227 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 87 [2020-10-24 02:43:09,667 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107 [2020-10-24 02:43:09,778 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 118 [2020-10-24 02:43:09,889 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 118 [2020-10-24 02:43:10,001 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107 [2020-10-24 02:43:10,238 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2020-10-24 02:43:10,347 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2020-10-24 02:43:10,921 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2020-10-24 02:43:11,049 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2020-10-24 02:43:11,185 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2020-10-24 02:43:11,344 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2020-10-24 02:43:11,667 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2020-10-24 02:43:11,808 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2020-10-24 02:43:13,883 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2020-10-24 02:43:14,012 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2020-10-24 02:43:14,144 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 102 [2020-10-24 02:43:14,304 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 116 [2020-10-24 02:43:14,625 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2020-10-24 02:43:14,766 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2020-10-24 02:43:20,358 WARN L193 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2020-10-24 02:43:20,635 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2020-10-24 02:43:22,097 WARN L193 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 131 DAG size of output: 73 [2020-10-24 02:43:23,578 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 154 DAG size of output: 76 [2020-10-24 02:43:24,657 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 146 DAG size of output: 74 [2020-10-24 02:43:25,581 WARN L193 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 55 [2020-10-24 02:43:26,878 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 162 DAG size of output: 89 [2020-10-24 02:43:27,151 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 36 [2020-10-24 02:43:29,405 WARN L193 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 178 DAG size of output: 89 [2020-10-24 02:43:31,602 WARN L193 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 178 DAG size of output: 89 [2020-10-24 02:43:31,837 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-10-24 02:43:32,919 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2020-10-24 02:43:33,590 WARN L193 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 53 [2020-10-24 02:43:33,747 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 1 [2020-10-24 02:43:34,040 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 41 [2020-10-24 02:43:35,936 WARN L193 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 125 DAG size of output: 67 [2020-10-24 02:43:36,052 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 1 [2020-10-24 02:43:37,956 WARN L193 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 130 DAG size of output: 72 [2020-10-24 02:43:38,441 WARN L193 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2020-10-24 02:43:39,183 WARN L193 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2020-10-24 02:43:39,447 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2020-10-24 02:43:39,727 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 38 [2020-10-24 02:43:40,186 WARN L193 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2020-10-24 02:43:40,383 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-10-24 02:43:40,617 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-10-24 02:43:40,765 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-10-24 02:43:40,876 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2020-10-24 02:43:41,116 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2020-10-24 02:43:41,261 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-10-24 02:43:41,514 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2020-10-24 02:43:41,753 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2020-10-24 02:43:41,999 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2020-10-24 02:43:43,215 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2020-10-24 02:43:43,653 WARN L193 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2020-10-24 02:43:43,763 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2020-10-24 02:43:44,486 WARN L193 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2020-10-24 02:43:44,610 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 1 [2020-10-24 02:43:45,327 WARN L193 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 57 [2020-10-24 02:43:45,891 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 58 [2020-10-24 02:43:46,302 WARN L193 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-10-24 02:43:46,559 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2020-10-24 02:43:47,711 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2020-10-24 02:43:49,030 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 127 DAG size of output: 69 [2020-10-24 02:43:49,518 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 57 [2020-10-24 02:43:50,345 WARN L193 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2020-10-24 02:43:52,378 WARN L193 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 174 DAG size of output: 88 [2020-10-24 02:43:53,273 WARN L193 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 64 [2020-10-24 02:43:53,826 WARN L193 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2020-10-24 02:43:54,463 WARN L193 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2020-10-24 02:43:54,696 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2020-10-24 02:43:55,363 WARN L193 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 43 [2020-10-24 02:43:55,832 WARN L193 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 58 [2020-10-24 02:43:56,062 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-10-24 02:43:56,291 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-10-24 02:43:56,691 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-10-24 02:43:56,922 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-10-24 02:43:57,597 WARN L193 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 43 [2020-10-24 02:43:59,727 WARN L193 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 170 DAG size of output: 90 [2020-10-24 02:44:01,159 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 131 DAG size of output: 73 [2020-10-24 02:44:01,536 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 45 [2020-10-24 02:44:02,684 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 120 DAG size of output: 59 [2020-10-24 02:44:03,897 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 195 DAG size of output: 56 [2020-10-24 02:44:04,130 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2020-10-24 02:44:05,795 WARN L193 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 140 DAG size of output: 84 [2020-10-24 02:44:07,377 WARN L193 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 135 DAG size of output: 79 [2020-10-24 02:44:07,813 WARN L193 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2020-10-24 02:44:09,379 WARN L193 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 135 DAG size of output: 79 [2020-10-24 02:44:09,697 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 39 [2020-10-24 02:44:09,838 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-10-24 02:44:10,608 WARN L193 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 68 [2020-10-24 02:44:10,739 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2020-10-24 02:44:11,107 WARN L193 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 44 [2020-10-24 02:44:11,863 WARN L193 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2020-10-24 02:44:12,060 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-10-24 02:44:12,275 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2020-10-24 02:44:12,416 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-10-24 02:44:12,559 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-10-24 02:44:12,945 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2020-10-24 02:44:13,324 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2020-10-24 02:44:14,519 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 195 DAG size of output: 56 [2020-10-24 02:44:14,897 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 57 [2020-10-24 02:44:15,328 WARN L193 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 41 [2020-10-24 02:44:16,699 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 166 DAG size of output: 82 [2020-10-24 02:44:17,503 WARN L193 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2020-10-24 02:44:17,792 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 41 [2020-10-24 02:44:19,811 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 174 DAG size of output: 88 [2020-10-24 02:44:19,973 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 32 [2020-10-24 02:44:20,847 WARN L193 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2020-10-24 02:44:21,780 WARN L193 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 65 [2020-10-24 02:44:21,939 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 1 [2020-10-24 02:44:22,500 WARN L193 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 51 [2020-10-24 02:44:22,610 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2020-10-24 02:44:22,795 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2020-10-24 02:44:23,434 WARN L193 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 63 [2020-10-24 02:44:23,641 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2020-10-24 02:44:24,466 WARN L193 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2020-10-24 02:44:25,296 WARN L193 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2020-10-24 02:44:25,636 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2020-10-24 02:44:27,939 WARN L193 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 159 DAG size of output: 85 [2020-10-24 02:44:28,727 WARN L193 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2020-10-24 02:44:31,622 WARN L193 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 192 DAG size of output: 98 [2020-10-24 02:44:31,880 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2020-10-24 02:44:32,069 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-10-24 02:44:32,519 WARN L193 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2020-10-24 02:44:33,970 WARN L193 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 154 DAG size of output: 76 [2020-10-24 02:44:34,563 WARN L193 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 52 [2020-10-24 02:44:35,046 WARN L193 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2020-10-24 02:44:35,973 WARN L193 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 64 [2020-10-24 02:44:36,969 WARN L193 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 73 [2020-10-24 02:44:37,752 WARN L193 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2020-10-24 02:44:38,344 WARN L193 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2020-10-24 02:44:39,890 WARN L193 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 131 DAG size of output: 73 [2020-10-24 02:44:40,035 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-10-24 02:44:40,675 WARN L193 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 63 [2020-10-24 02:44:41,174 WARN L193 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2020-10-24 02:44:41,545 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 46 [2020-10-24 02:44:41,744 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2020-10-24 02:44:41,854 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2020-10-24 02:44:44,725 WARN L193 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 192 DAG size of output: 98 [2020-10-24 02:44:44,917 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-10-24 02:44:45,843 WARN L193 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 62 [2020-10-24 02:44:46,544 WARN L193 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2020-10-24 02:44:47,810 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2020-10-24 02:44:48,373 WARN L193 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2020-10-24 02:44:49,214 WARN L193 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 75 [2020-10-24 02:44:49,589 WARN L193 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2020-10-24 02:44:50,078 WARN L193 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2020-10-24 02:44:51,688 WARN L193 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 158 DAG size of output: 86 [2020-10-24 02:44:52,128 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2020-10-24 02:44:53,746 WARN L193 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 158 DAG size of output: 86 [2020-10-24 02:44:54,145 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2020-10-24 02:44:55,248 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2020-10-24 02:44:55,439 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2020-10-24 02:44:55,660 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2020-10-24 02:44:56,459 WARN L193 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2020-10-24 02:44:56,649 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-10-24 02:44:56,977 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-10-24 02:44:57,442 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2020-10-24 02:44:58,519 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 149 DAG size of output: 61 [2020-10-24 02:44:59,108 WARN L193 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2020-10-24 02:44:59,650 WARN L193 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2020-10-24 02:45:00,388 WARN L193 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2020-10-24 02:45:01,426 WARN L193 SmtUtils]: Spent 964.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 60 [2020-10-24 02:45:01,841 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2020-10-24 02:45:02,775 WARN L193 SmtUtils]: Spent 929.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 64 [2020-10-24 02:45:02,965 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-10-24 02:45:03,134 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2020-10-24 02:45:03,702 WARN L193 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2020-10-24 02:45:06,089 WARN L193 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 159 DAG size of output: 85 [2020-10-24 02:45:08,511 WARN L193 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 158 DAG size of output: 87 [2020-10-24 02:45:09,049 WARN L193 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2020-10-24 02:45:10,729 WARN L193 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 158 DAG size of output: 86 [2020-10-24 02:45:10,901 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 33 [2020-10-24 02:45:11,857 WARN L193 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 60 [2020-10-24 02:45:12,958 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2020-10-24 02:45:14,165 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2020-10-24 02:45:16,513 WARN L193 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 159 DAG size of output: 85 [2020-10-24 02:45:17,439 WARN L193 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 81 [2020-10-24 02:45:18,559 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2020-10-24 02:45:18,765 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2020-10-24 02:45:19,263 WARN L193 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2020-10-24 02:45:19,467 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-10-24 02:45:19,999 WARN L193 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2020-10-24 02:45:20,336 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 44 [2020-10-24 02:45:20,489 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-10-24 02:45:20,694 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2020-10-24 02:45:22,209 WARN L193 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 146 DAG size of output: 77 [2020-10-24 02:45:22,408 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-10-24 02:45:22,604 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2020-10-24 02:45:23,315 WARN L193 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 70 [2020-10-24 02:45:24,276 WARN L193 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 64 [2020-10-24 02:45:24,597 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 56 [2020-10-24 02:45:24,745 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 1 [2020-10-24 02:45:26,708 WARN L193 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 130 DAG size of output: 72 [2020-10-24 02:45:26,989 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2020-10-24 02:45:28,146 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 146 DAG size of output: 74 [2020-10-24 02:45:28,630 WARN L193 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 38 [2020-10-24 02:45:28,910 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2020-10-24 02:45:30,976 WARN L193 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 136 DAG size of output: 80 [2020-10-24 02:45:31,357 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 46 [2020-10-24 02:45:32,044 WARN L193 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 40 [2020-10-24 02:45:32,166 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 1 [2020-10-24 02:45:32,473 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 40 [2020-10-24 02:45:32,953 WARN L193 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2020-10-24 02:45:32,968 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-24 02:45:32,968 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-24 02:45:32,968 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-24 02:45:32,969 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-24 02:45:32,969 INFO L270 CegarLoopResult]: At program point L91-1(lines 79 110) the Hoare annotation is: (let ((.cse4 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse8 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse10 (not (= |old(~t1_pc~0)| 0))) (.cse3 (= ~t1_pc~0 0)) (.cse5 (= |old(~token~0)| ~token~0)) (.cse0 (not (= ~m_pc~0 0))) (.cse7 (not (= |old(~m_st~0)| 0))) (.cse13 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (= ~M_E~0 2))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse11 (not (= ~t1_i~0 1))) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse17 (or (= ~t1_st~0 0) .cse4)) (.cse1 (= ~E_M~0 ~M_E~0)) (.cse2 (= ~m_st~0 0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse6 .cse8 .cse9 .cse10 .cse14 .cse11 .cse15 (and (= ~m_st~0 |old(~m_st~0)|) .cse1 .cse3 .cse4 .cse5) .cse16 .cse12) (or .cse0 .cse11 .cse16 (and (<= 2 ~m_st~0) .cse17)) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse13 .cse18 .cse6 .cse19 .cse7 .cse9 .cse14 .cse11 .cse15 .cse12) (or .cse13 .cse18 .cse6 .cse19 .cse9 .cse14 .cse11 .cse15 .cse16 .cse12))) (let ((.cse20 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (<= .cse20 ~token~0) .cse17 (<= ~token~0 .cse20) .cse1 .cse2)))))) [2020-10-24 02:45:32,969 INFO L270 CegarLoopResult]: At program point L83(lines 83 87) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse9 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse11 (not (= |old(~t1_pc~0)| 0))) (.cse15 (not (= |old(~m_st~0)| 0))) (.cse7 (not (<= |old(~token~0)| ~local~0))) (.cse8 (not (= ~M_E~0 2))) (.cse10 (= |old(~t1_st~0)| 0)) (.cse12 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse13 (not (= ~m_pc~0 1))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (= |old(~token~0)| ~token~0))) (and (or .cse0 (and .cse1 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse5 .cse13 .cse6 .cse14) (or .cse0 .cse8 .cse15 .cse9 .cse10 .cse11 .cse5 .cse14) (or (let ((.cse16 (= |old(~E_M~0)| 1)) (.cse17 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse7 .cse16 .cse8 .cse17 .cse15 .cse10 .cse12 .cse5 .cse13 .cse14) (or .cse7 .cse16 .cse8 .cse17 .cse10 .cse12 .cse5 .cse13 .cse6 .cse14))) (and .cse1 (= ~t1_pc~0 1) .cse2 .cse3 .cse4)))) [2020-10-24 02:45:32,970 INFO L270 CegarLoopResult]: At program point transmit1ENTRY(lines 76 111) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse10 (not (= |old(~m_st~0)| 0))) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse15 (not (<= |old(~token~0)| ~local~0))) (.cse9 (not (= ~M_E~0 2))) (.cse11 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse12 (= |old(~t1_st~0)| 0)) (.cse13 (not (= |old(~t1_pc~0)| 0))) (.cse18 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse19 (not (= ~m_pc~0 1))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_M~0 ~M_E~0)) (.cse8 (= ~t1_pc~0 0)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= |old(~token~0)| ~token~0)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0)))) (and (or .cse0 (and .cse1 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse0 (and .cse7 (= ~m_st~0 0) .cse8 .cse2 .cse4) .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse14) (or (let ((.cse16 (= |old(~E_M~0)| 1)) (.cse17 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse15 .cse16 .cse9 .cse17 .cse10 .cse12 .cse18 .cse5 .cse19 .cse14) (or .cse15 .cse16 .cse9 .cse17 .cse12 .cse18 .cse5 .cse19 .cse6 .cse14))) (and .cse1 (= ~t1_pc~0 1) .cse2 .cse3 .cse4)) (or .cse15 .cse9 .cse11 .cse12 .cse13 .cse18 .cse5 .cse19 (and .cse1 .cse7 .cse8 .cse2 .cse4) .cse6 .cse14))) [2020-10-24 02:45:32,970 INFO L270 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (let ((.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse5 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (= ~m_pc~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse17 (not (= |old(~m_st~0)| 0))) (.cse2 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse4 (not (= |old(~t1_pc~0)| 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 (and .cse11 .cse12 .cse13) .cse6 .cse8) (or (let ((.cse14 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) .cse11 (<= .cse14 ~token~0) (<= ~token~0 .cse14) .cse12 .cse13)) (let ((.cse15 (= |old(~E_M~0)| 1)) (.cse16 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse0 .cse15 .cse1 .cse16 .cse17 .cse3 .cse5 .cse6 .cse7 .cse9) (or .cse0 .cse15 .cse1 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9)))) (or .cse10 .cse1 .cse17 .cse2 .cse3 .cse4 .cse6 .cse9))) [2020-10-24 02:45:32,971 INFO L270 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse10 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse3 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse5 (not (= |old(~t1_pc~0)| 0))) (.cse11 (= |old(~token~0)| ~token~0)) (.cse0 (not (= ~m_pc~0 0))) (.cse2 (not (= |old(~m_st~0)| 0))) (.cse13 (not (<= |old(~token~0)| ~local~0))) (.cse1 (not (= ~M_E~0 2))) (.cse4 (= |old(~t1_st~0)| 0)) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse7 (= ~t1_pc~0 1)) (.cse17 (or (= ~t1_st~0 0) .cse10)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (or .cse13 .cse1 .cse3 .cse4 .cse5 .cse14 .cse6 .cse15 (and .cse7 (= ~m_st~0 |old(~m_st~0)|) .cse8 .cse10 .cse11) .cse16 .cse12) (or .cse0 .cse6 .cse16 (and (<= 2 ~m_st~0) .cse17)) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse13 .cse18 .cse1 .cse19 .cse2 .cse4 .cse14 .cse6 .cse15 .cse12) (or .cse13 .cse18 .cse1 .cse19 .cse4 .cse14 .cse6 .cse15 .cse16 .cse12))) (let ((.cse20 (+ |old(~token~0)| 1))) (and .cse7 (<= .cse20 ~token~0) .cse17 (<= ~token~0 .cse20) .cse8 .cse9)))))) [2020-10-24 02:45:32,971 INFO L270 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse4 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse8 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse10 (not (= |old(~t1_pc~0)| 0))) (.cse3 (= ~t1_pc~0 0)) (.cse5 (= |old(~token~0)| ~token~0)) (.cse0 (not (= ~m_pc~0 0))) (.cse7 (not (= |old(~m_st~0)| 0))) (.cse13 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (= ~M_E~0 2))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse14 (not (<= ~local~0 |old(~token~0)|))) (.cse11 (not (= ~t1_i~0 1))) (.cse15 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse17 (or (= ~t1_st~0 0) .cse4)) (.cse1 (= ~E_M~0 ~M_E~0)) (.cse2 (= ~m_st~0 0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse6 .cse8 .cse9 .cse10 .cse14 .cse11 .cse15 (and (= ~m_st~0 |old(~m_st~0)|) .cse1 .cse3 .cse4 .cse5) .cse16 .cse12) (or .cse0 .cse11 .cse16 (and (<= 2 ~m_st~0) .cse17)) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse13 .cse18 .cse6 .cse19 .cse7 .cse9 .cse14 .cse11 .cse15 .cse12) (or .cse13 .cse18 .cse6 .cse19 .cse9 .cse14 .cse11 .cse15 .cse16 .cse12))) (let ((.cse20 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (<= .cse20 ~token~0) .cse17 (<= ~token~0 .cse20) .cse1 .cse2)))))) [2020-10-24 02:45:32,971 INFO L270 CegarLoopResult]: At program point L84(lines 79 110) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse9 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse11 (not (= |old(~t1_pc~0)| 0))) (.cse15 (not (= |old(~m_st~0)| 0))) (.cse7 (not (<= |old(~token~0)| ~local~0))) (.cse8 (not (= ~M_E~0 2))) (.cse10 (= |old(~t1_st~0)| 0)) (.cse12 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse13 (not (= ~m_pc~0 1))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (= |old(~token~0)| ~token~0))) (and (or .cse0 (and .cse1 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse5 .cse13 .cse6 .cse14) (or .cse0 .cse8 .cse15 .cse9 .cse10 .cse11 .cse5 .cse14) (or (let ((.cse16 (= |old(~E_M~0)| 1)) (.cse17 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse7 .cse16 .cse8 .cse17 .cse15 .cse10 .cse12 .cse5 .cse13 .cse14) (or .cse7 .cse16 .cse8 .cse17 .cse10 .cse12 .cse5 .cse13 .cse6 .cse14))) (and .cse1 (= ~t1_pc~0 1) .cse2 .cse3 .cse4)))) [2020-10-24 02:45:32,972 INFO L270 CegarLoopResult]: At program point transmit1EXIT(lines 76 111) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse8 (not (= |old(~t1_pc~0)| 0))) (.cse1 (<= 2 ~m_st~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse5 (not (= |old(~m_st~0)| 0))) (.cse15 (not (<= |old(~token~0)| ~local~0))) (.cse4 (not (= ~M_E~0 2))) (.cse7 (= |old(~t1_st~0)| 0)) (.cse16 (not (<= ~local~0 |old(~token~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse17 (not (= ~m_pc~0 1))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse15 .cse4 .cse6 .cse7 .cse8 .cse16 .cse2 .cse17 (and .cse9 .cse1 .cse10 .cse11 .cse13) .cse3 .cse14) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse15 .cse18 .cse4 .cse19 .cse5 .cse7 .cse16 .cse2 .cse17 .cse14) (or .cse15 .cse18 .cse4 .cse19 .cse7 .cse16 .cse2 .cse17 .cse3 .cse14))) (let ((.cse20 (+ |old(~token~0)| 1))) (and .cse9 .cse10 (<= .cse20 ~token~0) .cse11 (<= ~token~0 .cse20) .cse12))))) [2020-10-24 02:45:32,972 INFO L270 CegarLoopResult]: At program point L105(lines 76 111) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse8 (not (= |old(~t1_pc~0)| 0))) (.cse1 (<= 2 ~m_st~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse5 (not (= |old(~m_st~0)| 0))) (.cse15 (not (<= |old(~token~0)| ~local~0))) (.cse4 (not (= ~M_E~0 2))) (.cse7 (= |old(~t1_st~0)| 0)) (.cse16 (not (<= ~local~0 |old(~token~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse17 (not (= ~m_pc~0 1))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (<= 2 ~E_1~0))) (.cse9 (<= 2 ~t1_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse15 .cse4 .cse6 .cse7 .cse8 .cse16 .cse2 .cse17 (and .cse9 .cse1 .cse10 .cse11 .cse13) .cse3 .cse14) (or (let ((.cse18 (= |old(~E_M~0)| 1)) (.cse19 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse15 .cse18 .cse4 .cse19 .cse5 .cse7 .cse16 .cse2 .cse17 .cse14) (or .cse15 .cse18 .cse4 .cse19 .cse7 .cse16 .cse2 .cse17 .cse3 .cse14))) (let ((.cse20 (+ |old(~token~0)| 1))) (and .cse9 .cse10 (<= .cse20 ~token~0) .cse11 (<= ~token~0 .cse20) .cse12))))) [2020-10-24 02:45:32,972 INFO L270 CegarLoopResult]: At program point L101(line 101) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse7 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse9 (not (= |old(~t1_pc~0)| 0))) (.cse13 (not (= |old(~m_st~0)| 0))) (.cse5 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (= ~M_E~0 2))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse10 (not (<= ~local~0 |old(~token~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse11 (not (= ~m_pc~0 1))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse3 .cse11 .cse4 .cse12) (or .cse0 .cse6 .cse13 .cse7 .cse8 .cse9 .cse3 .cse12) (or (let ((.cse14 (= |old(~E_M~0)| 1)) (.cse15 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse5 .cse14 .cse6 .cse15 .cse13 .cse8 .cse10 .cse3 .cse11 .cse12) (or .cse5 .cse14 .cse6 .cse15 .cse8 .cse10 .cse3 .cse11 .cse4 .cse12))) (let ((.cse16 (+ |old(~token~0)| 1))) (and .cse1 (= ~t1_pc~0 1) (= ~E_M~0 1) (<= .cse16 ~token~0) (<= ~token~0 .cse16) .cse2))))) [2020-10-24 02:45:32,973 INFO L270 CegarLoopResult]: At program point L101-1(line 101) the Hoare annotation is: (let ((.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse5 (not (<= ~local~0 |old(~token~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse12 (not (= |old(~m_st~0)| 0))) (.cse2 (not (= ~M_E~0 |old(~E_M~0)|))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse4 (not (= |old(~t1_pc~0)| 0))) (.cse9 (not (<= 2 ~E_1~0))) (.cse15 (not (= ~m_pc~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse14 (or (= ~t1_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (let ((.cse10 (= |old(~E_M~0)| 1)) (.cse11 (not (= |old(~t1_pc~0)| 1)))) (and (or .cse0 .cse10 .cse1 .cse11 .cse12 .cse3 .cse5 .cse6 .cse7 .cse9) (or .cse0 .cse10 .cse1 .cse11 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9))) (let ((.cse13 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (= ~E_M~0 1) (<= .cse13 ~token~0) .cse14 (<= ~token~0 .cse13) (= ~m_st~0 0)))) (or .cse15 .cse1 .cse12 .cse2 .cse3 .cse4 .cse6 .cse9) (or .cse15 .cse6 .cse8 (and (<= 2 ~m_st~0) .cse14)))) [2020-10-24 02:45:32,973 INFO L270 CegarLoopResult]: At program point immediate_notifyEXIT(lines 328 338) the Hoare annotation is: (let ((.cse22 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse13 (= ~m_st~0 0)) (.cse1 (= |old(~t1_st~0)| 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse6 (and .cse22 .cse14)) (.cse19 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (= ~t1_st~0 0)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse11 (and .cse22 (not (= ~E_1~0 1)) .cse14)) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (= ~t1_i~0 1))) (.cse18 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 (not .cse1) .cse2 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse2 .cse10 .cse3 .cse11 .cse4 (and .cse12 (not .cse13)) .cse5 .cse7 .cse8) (or (and .cse12 .cse13) (and .cse13 .cse14) (let ((.cse21 (+ ~local~0 1))) (let ((.cse15 (not (<= ~token~0 .cse21))) (.cse16 (not (<= .cse21 ~token~0))) (.cse17 (not (= ~E_M~0 1))) (.cse20 (not (<= 2 ~E_1~0)))) (and (or .cse9 .cse15 .cse2 .cse16 .cse1 .cse17 .cse5 .cse18 .cse19 .cse20) (or .cse9 .cse15 .cse2 (not .cse4) .cse16 .cse1 .cse17 .cse5 .cse18 .cse20))))) (or .cse0 (and (<= 2 ~m_st~0) .cse12) .cse5 .cse6 .cse19) (or .cse9 .cse2 .cse10 .cse12 .cse3 .cse11 .cse4 .cse5 .cse18 .cse7 .cse8)))) [2020-10-24 02:45:32,973 INFO L270 CegarLoopResult]: At program point immediate_notifyENTRY(lines 328 338) the Hoare annotation is: (let ((.cse1 (= |old(~t1_st~0)| 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse14 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 (not .cse1) .cse2 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse6 (let ((.cse17 (+ ~local~0 1))) (let ((.cse11 (not (<= ~token~0 .cse17))) (.cse12 (not (<= .cse17 ~token~0))) (.cse13 (not (= ~E_M~0 1))) (.cse16 (not (<= 2 ~E_1~0)))) (and (or .cse9 .cse11 .cse2 .cse12 .cse1 .cse13 .cse5 .cse14 .cse15 .cse16) (or .cse9 .cse11 .cse2 (not .cse4) .cse12 .cse1 .cse13 .cse5 .cse14 .cse16))))) (or .cse0 .cse5 .cse6 .cse15) (or .cse9 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8))) [2020-10-24 02:45:32,974 INFO L270 CegarLoopResult]: At program point immediate_notifyFINAL(lines 328 338) the Hoare annotation is: (let ((.cse22 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse13 (= ~m_st~0 0)) (.cse1 (= |old(~t1_st~0)| 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse6 (and .cse22 .cse14)) (.cse19 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse12 (= ~t1_st~0 0)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse11 (and .cse22 (not (= ~E_1~0 1)) .cse14)) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (= ~t1_i~0 1))) (.cse18 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 (not .cse1) .cse2 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse2 .cse10 .cse3 .cse11 .cse4 (and .cse12 (not .cse13)) .cse5 .cse7 .cse8) (or (and .cse12 .cse13) (and .cse13 .cse14) (let ((.cse21 (+ ~local~0 1))) (let ((.cse15 (not (<= ~token~0 .cse21))) (.cse16 (not (<= .cse21 ~token~0))) (.cse17 (not (= ~E_M~0 1))) (.cse20 (not (<= 2 ~E_1~0)))) (and (or .cse9 .cse15 .cse2 .cse16 .cse1 .cse17 .cse5 .cse18 .cse19 .cse20) (or .cse9 .cse15 .cse2 (not .cse4) .cse16 .cse1 .cse17 .cse5 .cse18 .cse20))))) (or .cse0 (and (<= 2 ~m_st~0) .cse12) .cse5 .cse6 .cse19) (or .cse9 .cse2 .cse10 .cse12 .cse3 .cse11 .cse4 .cse5 .cse18 .cse7 .cse8)))) [2020-10-24 02:45:32,974 INFO L270 CegarLoopResult]: At program point L320(line 320) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (<= activate_threads_~tmp~1 0)) (.cse6 (< 0 (+ activate_threads_~tmp~1 1))) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse10 (= |old(~m_st~0)| 0)) (.cse26 (= |old(~t1_st~0)| 0))) (let ((.cse20 (not (= ~M_E~0 1))) (.cse12 (not (= ~m_pc~0 1))) (.cse19 (= ~E_M~0 1)) (.cse16 (not .cse26)) (.cse28 (not .cse10)) (.cse17 (not (= ~t1_pc~0 0))) (.cse22 (not (<= 2 ~E_1~0))) (.cse23 (= ~m_st~0 0)) (.cse21 (not (<= 2 |old(~m_st~0)|))) (.cse18 (and .cse3 .cse4 .cse6 .cse8)) (.cse5 (<= 1 activate_threads_~tmp___0~0)) (.cse7 (not (= ~E_1~0 1))) (.cse15 (not (= ~m_pc~0 0))) (.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (not (<= ~token~0 ~local~0))) (.cse11 (not (= ~t1_i~0 1))) (.cse13 (not (= ~E_M~0 ~M_E~0))) (.cse14 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 (and .cse3 (or (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse6)) .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse15 .cse16 .cse1 .cse17 .cse9 .cse10 .cse11 .cse13 .cse14 .cse18) (or .cse0 .cse2 .cse19 .cse9 .cse11 .cse12 .cse20 .cse14 .cse21 .cse18 .cse22) (or .cse16 .cse0 .cse19 .cse9 .cse11 .cse12 .cse20 .cse14 .cse21 .cse18 .cse22) (or (and .cse23 .cse8 (<= 1 activate_threads_~tmp~1)) (let ((.cse29 (+ ~local~0 1))) (let ((.cse24 (not (<= ~token~0 .cse29))) (.cse25 (not (<= .cse29 ~token~0))) (.cse27 (not .cse19))) (and (or .cse0 .cse24 .cse1 .cse25 .cse26 .cse27 .cse11 .cse12 .cse21 .cse22) (or .cse0 .cse24 .cse1 .cse28 .cse25 .cse26 .cse27 .cse11 .cse12 .cse22))))) (or .cse15 .cse16 .cse1 .cse28 .cse17 .cse11 .cse13 .cse22 (and .cse4 .cse6 .cse23 .cse8)) (or .cse15 .cse11 .cse21 .cse18) (or (and (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse7 .cse4 .cse6)) .cse8) .cse15 .cse0 .cse1 .cse2 .cse9 .cse10 .cse11 .cse13 .cse14)))) [2020-10-24 02:45:32,975 INFO L270 CegarLoopResult]: At program point L319(lines 319 323) the Hoare annotation is: (let ((.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse25 (<= activate_threads_~tmp~1 0)) (.cse26 (< 0 (+ activate_threads_~tmp~1 1))) (.cse18 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= |old(~m_st~0)| 0)) (.cse21 (= |old(~t1_st~0)| 0))) (let ((.cse14 (not (= ~M_E~0 1))) (.cse12 (= ~E_M~0 1)) (.cse1 (not .cse21)) (.cse23 (not .cse5)) (.cse3 (not (= ~t1_pc~0 0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse17 (= ~m_st~0 0)) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse9 (and .cse29 .cse25 .cse26 .cse18)) (.cse0 (not (= ~m_pc~0 0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse27 (and .cse29 .cse25 (<= 1 activate_threads_~tmp___0~0) .cse26 .cse18)) (.cse28 (and .cse29 (not (= ~E_1~0 1)) .cse25 .cse26 .cse18)) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse13 (not (= ~m_pc~0 1))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse4 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16) (or .cse1 .cse10 .cse12 .cse4 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16) (or (and .cse17 .cse18 (<= 1 activate_threads_~tmp~1)) (let ((.cse24 (+ ~local~0 1))) (let ((.cse19 (not (<= ~token~0 .cse24))) (.cse20 (not (<= .cse24 ~token~0))) (.cse22 (not .cse12))) (and (or .cse10 .cse19 .cse2 .cse20 .cse21 .cse22 .cse6 .cse13 .cse15 .cse16) (or .cse10 .cse19 .cse2 .cse23 .cse20 .cse21 .cse22 .cse6 .cse13 .cse16))))) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse6 .cse7 .cse16 (and .cse25 .cse26 .cse17 .cse18)) (or .cse0 .cse6 .cse15 .cse9) (or .cse0 .cse10 .cse2 .cse27 .cse28 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse10 .cse2 .cse27 .cse28 .cse11 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8)))) [2020-10-24 02:45:32,975 INFO L270 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse7 (= |old(~m_st~0)| 0)) (.cse23 (= |old(~t1_st~0)| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0)) (.cse28 (< 0 (+ activate_threads_~tmp~1 1))) (.cse20 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse16 (not (= ~M_E~0 1))) (.cse14 (= ~E_M~0 1)) (.cse1 (and .cse29 .cse27 (<= 1 |activate_threads_#t~ret12|) .cse28 .cse20)) (.cse2 (not (= ~t1_pc~0 1))) (.cse4 (and .cse29 (not (= ~E_1~0 1)) .cse27 .cse28 .cse20)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse15 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not .cse23)) (.cse3 (not (= ~M_E~0 2))) (.cse25 (not .cse7)) (.cse12 (not (= ~t1_pc~0 0))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (= ~m_st~0 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse17 (not (<= 2 |old(~m_st~0)|))) (.cse13 (and .cse29 .cse27 .cse28 .cse20))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (or .cse2 .cse5 .cse14 .cse6 .cse8 .cse15 .cse16 .cse10 .cse17 .cse13 .cse18) (or .cse11 .cse2 .cse14 .cse6 .cse8 .cse15 .cse16 .cse10 .cse17 .cse13 .cse18) (or (and .cse19 .cse20 (<= 1 activate_threads_~tmp~1)) (let ((.cse26 (+ ~local~0 1))) (let ((.cse21 (not (<= ~token~0 .cse26))) (.cse22 (not (<= .cse26 ~token~0))) (.cse24 (not .cse14))) (and (or .cse2 .cse21 .cse3 .cse22 .cse23 .cse24 .cse8 .cse15 .cse17 .cse18) (or .cse2 .cse21 .cse3 .cse25 .cse22 .cse23 .cse24 .cse8 .cse15 .cse18))))) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10) (or .cse0 .cse11 .cse3 .cse25 .cse12 .cse8 .cse9 .cse18 (and .cse27 .cse28 .cse19 .cse20)) (or .cse0 .cse8 .cse17 .cse13)))) [2020-10-24 02:45:32,976 INFO L270 CegarLoopResult]: At program point L319-2(lines 303 327) the Hoare annotation is: (let ((.cse32 (not (= ~E_1~0 1))) (.cse35 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse30 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse29 (= |old(~m_st~0)| 0))) (let ((.cse14 (not .cse29)) (.cse19 (not (= ~t1_pc~0 0))) (.cse24 (and .cse30 .cse0 .cse21 .cse22)) (.cse18 (not .cse8)) (.cse15 (= ~E_M~0 1)) (.cse26 (not (= ~M_E~0 1))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse28 (and .cse35 .cse21 .cse22 .cse3)) (.cse13 (not (<= 2 ~E_1~0))) (.cse11 (not (= ~m_pc~0 1))) (.cse17 (not (= ~m_pc~0 0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~M_E~0 2))) (.cse31 (and .cse35 .cse32 .cse21 .cse22 .cse3)) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse25 (not (<= ~token~0 ~local~0))) (.cse10 (not (= ~t1_i~0 1))) (.cse20 (not (= ~E_M~0 ~M_E~0))) (.cse27 (not (<= ~local~0 ~token~0))) (.cse33 (<= 1 activate_threads_~tmp___0~0)) (.cse1 (= ~m_st~0 0))) (and (let ((.cse2 (<= 1 activate_threads_~tmp~1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (let ((.cse16 (+ ~local~0 1))) (let ((.cse5 (not (<= ~token~0 .cse16))) (.cse7 (not (<= .cse16 ~token~0))) (.cse9 (not .cse15))) (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)))))) (or .cse17 .cse18 .cse6 .cse14 .cse19 .cse10 .cse20 (and .cse21 .cse22 .cse1 .cse3) .cse13) (or .cse4 .cse23 .cse15 .cse24 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (or .cse17 .cse18 .cse6 .cse19 .cse25 .cse29 .cse10 .cse20 .cse27 .cse28) (or .cse17 .cse24 .cse10 .cse12 .cse28) (or .cse30 .cse4 .cse6 .cse23 .cse25 .cse10 .cse11 .cse20 .cse27 .cse12 .cse13) (or .cse18 .cse4 .cse15 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (or .cse6 .cse31 .cse10 .cse11 .cse27 (and .cse32 .cse0 .cse21 .cse22) .cse4 (and .cse32 .cse0 .cse1) .cse23 .cse25 (and .cse0 .cse1 .cse33) .cse29 (and .cse0 .cse21 .cse33 .cse22) .cse20) (let ((.cse34 (not .cse1))) (or .cse17 (and .cse32 .cse0 .cse21 .cse22 .cse34) .cse4 .cse6 .cse31 .cse23 .cse25 .cse29 .cse10 .cse20 .cse27 (and .cse0 .cse21 .cse33 .cse22 .cse34)))))) [2020-10-24 02:45:32,976 INFO L270 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse7 (= |old(~m_st~0)| 0)) (.cse23 (= |old(~t1_st~0)| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0)) (.cse28 (< 0 (+ activate_threads_~tmp~1 1))) (.cse20 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse16 (not (= ~M_E~0 1))) (.cse14 (= ~E_M~0 1)) (.cse1 (and .cse29 .cse27 (<= 1 |activate_threads_#t~ret12|) .cse28 .cse20)) (.cse2 (not (= ~t1_pc~0 1))) (.cse4 (and .cse29 (not (= ~E_1~0 1)) .cse27 .cse28 .cse20)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse15 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not .cse23)) (.cse3 (not (= ~M_E~0 2))) (.cse25 (not .cse7)) (.cse12 (not (= ~t1_pc~0 0))) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (= ~m_st~0 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse17 (not (<= 2 |old(~m_st~0)|))) (.cse13 (and .cse29 .cse27 .cse28 .cse20))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (or .cse2 .cse5 .cse14 .cse6 .cse8 .cse15 .cse16 .cse10 .cse17 .cse13 .cse18) (or .cse11 .cse2 .cse14 .cse6 .cse8 .cse15 .cse16 .cse10 .cse17 .cse13 .cse18) (or (and .cse19 .cse20 (<= 1 activate_threads_~tmp~1)) (let ((.cse26 (+ ~local~0 1))) (let ((.cse21 (not (<= ~token~0 .cse26))) (.cse22 (not (<= .cse26 ~token~0))) (.cse24 (not .cse14))) (and (or .cse2 .cse21 .cse3 .cse22 .cse23 .cse24 .cse8 .cse15 .cse17 .cse18) (or .cse2 .cse21 .cse3 .cse25 .cse22 .cse23 .cse24 .cse8 .cse15 .cse18))))) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10) (or .cse0 .cse11 .cse3 .cse25 .cse12 .cse8 .cse9 .cse18 (and .cse27 .cse28 .cse19 .cse20)) (or .cse0 .cse8 .cse17 .cse13)))) [2020-10-24 02:45:32,976 INFO L270 CegarLoopResult]: At program point L317-2(line 317) the Hoare annotation is: (let ((.cse5 (= |old(~m_st~0)| 0)) (.cse21 (= |old(~t1_st~0)| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0)) (.cse28 (< 0 (+ activate_threads_~tmp~1 1))) (.cse18 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse14 (not (= ~M_E~0 1))) (.cse12 (= ~E_M~0 1)) (.cse13 (not (= ~m_pc~0 1))) (.cse10 (not (= ~t1_pc~0 1))) (.cse25 (and .cse29 (not (= ~E_1~0 1)) .cse27 .cse28 .cse18)) (.cse26 (and .cse29 .cse27 (<= 1 |activate_threads_#t~ret12|) (<= 1 activate_threads_~tmp___0~0) .cse28 .cse18)) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse1 (not .cse21)) (.cse2 (not (= ~M_E~0 2))) (.cse23 (not .cse5)) (.cse3 (not (= ~t1_pc~0 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse17 (= ~m_st~0 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse9 (and .cse29 .cse27 .cse28 .cse18))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse4 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16) (or .cse1 .cse10 .cse12 .cse4 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16) (or (and .cse17 .cse18 (<= 1 activate_threads_~tmp~1)) (let ((.cse24 (+ ~local~0 1))) (let ((.cse19 (not (<= ~token~0 .cse24))) (.cse20 (not (<= .cse24 ~token~0))) (.cse22 (not .cse12))) (and (or .cse10 .cse19 .cse2 .cse20 .cse21 .cse22 .cse6 .cse13 .cse15 .cse16) (or .cse10 .cse19 .cse2 .cse23 .cse20 .cse21 .cse22 .cse6 .cse13 .cse16))))) (or .cse10 .cse2 .cse25 .cse26 .cse11 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8) (or .cse0 .cse10 .cse2 .cse25 .cse26 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse6 .cse7 .cse16 (and .cse27 .cse28 .cse17 .cse18)) (or .cse0 .cse6 .cse15 .cse9)))) [2020-10-24 02:45:32,977 INFO L270 CegarLoopResult]: At program point L312(line 312) the Hoare annotation is: (let ((.cse18 (= |old(~t1_st~0)| 0)) (.cse4 (= |old(~m_st~0)| 0))) (let ((.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (not (= ~m_pc~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse20 (not .cse4)) (.cse15 (not (= ~t1_pc~0 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse14 (not .cse18)) (.cse0 (not (= ~t1_pc~0 1))) (.cse11 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse12 (not (= ~M_E~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse5 .cse10) (or .cse0 .cse2 .cse11 .cse3 .cse5 .cse6 .cse12 .cse8 .cse10 .cse13) (or .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (or .cse9 .cse14 .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse8) (or (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (<= 1 activate_threads_~tmp~1)) (let ((.cse21 (+ ~local~0 1))) (let ((.cse16 (not (<= ~token~0 .cse21))) (.cse17 (not (<= .cse21 ~token~0))) (.cse19 (not .cse11))) (and (or .cse0 .cse16 .cse1 .cse17 .cse18 .cse19 .cse5 .cse6 .cse10 .cse13) (or .cse0 .cse16 .cse1 .cse20 .cse17 .cse18 .cse19 .cse5 .cse6 .cse13))))) (or .cse9 .cse14 .cse1 .cse20 .cse15 .cse5 .cse7 .cse13) (or .cse14 .cse0 .cse11 .cse3 .cse5 .cse6 .cse12 .cse8 .cse10 .cse13)))) [2020-10-24 02:45:32,977 INFO L270 CegarLoopResult]: At program point L311(lines 311 315) the Hoare annotation is: (let ((.cse21 (= |old(~t1_st~0)| 0)) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (<= activate_threads_~tmp~1 0)) (.cse8 (< 0 (+ activate_threads_~tmp~1 1))) (.cse9 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (= |old(~m_st~0)| 0))) (let ((.cse4 (not (= ~t1_pc~0 0))) (.cse3 (not .cse12)) (.cse0 (not (= ~m_pc~0 0))) (.cse2 (not (= ~M_E~0 2))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse16 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (and .cse18 .cse7 .cse8 .cse9)) (.cse1 (not .cse21)) (.cse15 (not (= ~t1_pc~0 1))) (.cse24 (= ~E_M~0 1)) (.cse11 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse17 (not (= ~m_pc~0 1))) (.cse26 (not (= ~M_E~0 1))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse23 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 (= ~m_st~0 0) .cse9) .cse10) (or .cse0 .cse1 .cse2 .cse4 .cse11 .cse12 .cse5 .cse6 .cse13 .cse14) (or .cse15 .cse2 .cse16 .cse11 .cse12 .cse5 .cse17 .cse6 .cse13 .cse14) (or (and .cse18 .cse9 (<= 1 activate_threads_~tmp~1)) (let ((.cse25 (+ ~local~0 1))) (let ((.cse19 (not (<= ~token~0 .cse25))) (.cse20 (not (<= .cse25 ~token~0))) (.cse22 (not .cse24))) (and (or .cse15 .cse19 .cse2 .cse20 .cse21 .cse22 .cse5 .cse17 .cse23 .cse10) (or .cse15 .cse19 .cse2 .cse3 .cse20 .cse21 .cse22 .cse5 .cse17 .cse10))))) (or .cse0 .cse5 .cse23 .cse14) (or .cse0 .cse15 .cse2 .cse16 .cse11 .cse12 .cse5 .cse6 .cse13 .cse14) (or .cse15 .cse16 .cse24 .cse11 .cse5 .cse17 .cse26 .cse13 .cse23 .cse10 .cse14) (or .cse1 .cse15 .cse24 .cse11 .cse5 .cse17 .cse26 .cse13 .cse23 .cse10 (and .cse18 (= ~t1_st~0 0) .cse7 .cse8))))) [2020-10-24 02:45:32,978 INFO L270 CegarLoopResult]: At program point L309(line 309) the Hoare annotation is: (let ((.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= |old(~m_st~0)| 0)) (.cse22 (= |old(~t1_st~0)| 0))) (let ((.cse1 (not .cse22)) (.cse3 (not (= ~t1_pc~0 0))) (.cse18 (not .cse5)) (.cse0 (not (= ~m_pc~0 0))) (.cse11 (= ~E_M~0 1)) (.cse13 (not (= ~M_E~0 1))) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (<= 2 ~E_1~0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse17 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and .cse14 .cse19)) (.cse12 (not (= ~m_pc~0 1))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse10 .cse11 .cse4 .cse6 .cse12 .cse13 (and .cse14 (= ~t1_st~0 0)) .cse9 .cse15 .cse16) (or .cse0 .cse10 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse6 (and (= ~m_st~0 0) .cse19) .cse8 .cse16) (or .cse7 (let ((.cse24 (+ ~local~0 1))) (let ((.cse20 (not (<= ~token~0 .cse24))) (.cse21 (not (<= .cse24 ~token~0))) (.cse23 (not .cse11))) (and (or .cse10 .cse20 .cse2 .cse21 .cse22 .cse23 .cse6 .cse12 .cse15 .cse16) (or .cse10 .cse20 .cse2 .cse18 .cse21 .cse22 .cse23 .cse6 .cse12 .cse16))))) (or .cse0 .cse6 .cse7 .cse15) (or .cse10 .cse17 .cse11 .cse4 .cse6 .cse7 .cse12 .cse13 .cse9 .cse15 .cse16) (or .cse10 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9)))) [2020-10-24 02:45:32,978 INFO L270 CegarLoopResult]: At program point L311-2(lines 311 315) the Hoare annotation is: (let ((.cse25 (<= activate_threads_~tmp~1 0)) (.cse26 (< 0 (+ activate_threads_~tmp~1 1))) (.cse18 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= |old(~m_st~0)| 0)) (.cse21 (= |old(~t1_st~0)| 0))) (let ((.cse14 (not (= ~M_E~0 1))) (.cse12 (= ~E_M~0 1)) (.cse13 (not (= ~m_pc~0 1))) (.cse1 (not .cse21)) (.cse23 (not .cse5)) (.cse3 (not (= ~t1_pc~0 0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse17 (= ~m_st~0 0)) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~m_pc~0 0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (and (= ~m_st~0 |old(~m_st~0)|) .cse25 .cse26 .cse18))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse4 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16) (or .cse1 .cse10 .cse12 .cse4 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16) (or (and .cse17 .cse18 (<= 1 activate_threads_~tmp~1)) (let ((.cse24 (+ ~local~0 1))) (let ((.cse19 (not (<= ~token~0 .cse24))) (.cse20 (not (<= .cse24 ~token~0))) (.cse22 (not .cse12))) (and (or .cse10 .cse19 .cse2 .cse20 .cse21 .cse22 .cse6 .cse13 .cse15 .cse16) (or .cse10 .cse19 .cse2 .cse23 .cse20 .cse21 .cse22 .cse6 .cse13 .cse16))))) (or .cse10 .cse2 .cse11 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse6 .cse7 .cse16 (and .cse25 .cse26 .cse17 .cse18)) (or .cse0 .cse6 .cse15 .cse9) (or .cse0 .cse10 .cse2 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2020-10-24 02:45:32,979 INFO L270 CegarLoopResult]: At program point L309-1(line 309) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (<= |activate_threads_#t~ret11| 0)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (<= 0 |activate_threads_#t~ret11|)) (.cse6 (= |old(~m_st~0)| 0)) (.cse24 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not (= ~t1_pc~0 0))) (.cse1 (not .cse24)) (.cse14 (not (= ~M_E~0 1))) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse17 (not .cse6)) (.cse12 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 ~E_1~0))) (.cse13 (= ~E_M~0 1)) (.cse0 (not (= ~m_pc~0 0))) (.cse2 (and .cse21 .cse18 .cse19 .cse20)) (.cse7 (not (= ~t1_i~0 1))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse2 .cse10 .cse3 .cse11 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9) (or .cse10 .cse2 .cse11 .cse13 .cse5 .cse7 .cse12 .cse14 .cse9 .cse15 .cse16) (or .cse0 .cse1 .cse3 .cse17 .cse4 .cse7 .cse8 .cse16 (and (= ~m_st~0 0) .cse18 .cse19 .cse20)) (or .cse1 .cse10 (and .cse21 (= ~t1_st~0 0) .cse18 .cse20) .cse13 .cse5 .cse7 .cse12 .cse14 .cse9 .cse15 .cse16) (or .cse0 .cse10 .cse3 .cse2 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9) (or (and .cse21 (<= 1 |activate_threads_#t~ret11|) .cse19) (let ((.cse26 (+ ~local~0 1))) (let ((.cse22 (not (<= ~token~0 .cse26))) (.cse23 (not (<= .cse26 ~token~0))) (.cse25 (not .cse13))) (and (or .cse10 .cse22 .cse3 .cse23 .cse24 .cse25 .cse7 .cse12 .cse15 .cse16) (or .cse10 .cse22 .cse3 .cse17 .cse23 .cse24 .cse25 .cse7 .cse12 .cse16))))) (or .cse0 .cse2 .cse7 .cse15)))) [2020-10-24 02:45:32,979 INFO L270 CegarLoopResult]: At program point L309-2(line 309) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (<= |activate_threads_#t~ret11| 0)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse20 (<= 0 |activate_threads_#t~ret11|)) (.cse6 (= |old(~m_st~0)| 0)) (.cse24 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not (= ~t1_pc~0 0))) (.cse1 (not .cse24)) (.cse14 (not (= ~M_E~0 1))) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~M_E~0 2))) (.cse17 (not .cse6)) (.cse12 (not (= ~m_pc~0 1))) (.cse16 (not (<= 2 ~E_1~0))) (.cse13 (= ~E_M~0 1)) (.cse0 (not (= ~m_pc~0 0))) (.cse2 (and .cse21 .cse18 .cse19 .cse20)) (.cse7 (not (= ~t1_i~0 1))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse2 .cse10 .cse3 .cse11 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9) (or .cse10 .cse2 .cse11 .cse13 .cse5 .cse7 .cse12 .cse14 .cse9 .cse15 .cse16) (or .cse0 .cse1 .cse3 .cse17 .cse4 .cse7 .cse8 .cse16 (and (= ~m_st~0 0) .cse18 .cse19 .cse20)) (or .cse1 .cse10 (and .cse21 (= ~t1_st~0 0) .cse18 .cse20) .cse13 .cse5 .cse7 .cse12 .cse14 .cse9 .cse15 .cse16) (or .cse0 .cse10 .cse3 .cse2 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9) (or (and .cse21 (<= 1 |activate_threads_#t~ret11|) .cse19) (let ((.cse26 (+ ~local~0 1))) (let ((.cse22 (not (<= ~token~0 .cse26))) (.cse23 (not (<= .cse26 ~token~0))) (.cse25 (not .cse13))) (and (or .cse10 .cse22 .cse3 .cse23 .cse24 .cse25 .cse7 .cse12 .cse15 .cse16) (or .cse10 .cse22 .cse3 .cse17 .cse23 .cse24 .cse25 .cse7 .cse12 .cse16))))) (or .cse0 .cse2 .cse7 .cse15)))) [2020-10-24 02:45:32,979 INFO L270 CegarLoopResult]: At program point L309-3(line 309) the Hoare annotation is: (let ((.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse22 (<= activate_threads_~tmp~1 0)) (.cse23 (< 0 (+ activate_threads_~tmp~1 1))) (.cse24 (<= |activate_threads_#t~ret11| 0)) (.cse1 (= |old(~t1_st~0)| ~t1_st~0)) (.cse25 (<= 0 |activate_threads_#t~ret11|)) (.cse6 (= |old(~t1_st~0)| 0)) (.cse28 (= |old(~m_st~0)| 0))) (let ((.cse12 (not .cse28)) (.cse13 (= ~E_M~0 1)) (.cse17 (not (= ~M_E~0 1))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (<= 2 ~E_1~0))) (.cse21 (not .cse6)) (.cse26 (not (= ~t1_pc~0 0))) (.cse20 (not (= ~m_pc~0 0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~M_E~0 2))) (.cse15 (not (<= 2 |old(~t1_st~0)|))) (.cse16 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse27 (not (= ~E_M~0 ~M_E~0))) (.cse18 (and .cse0 .cse22 .cse23 .cse24 .cse1 .cse25)) (.cse19 (not (<= ~local~0 ~token~0)))) (and (or (and .cse0 (<= 1 |activate_threads_#t~ret11|) .cse1 (<= 1 activate_threads_~tmp~1)) (let ((.cse14 (+ ~local~0 1))) (let ((.cse3 (not (<= ~token~0 .cse14))) (.cse5 (not (<= .cse14 ~token~0))) (.cse7 (not .cse13))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse2 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11))))) (or .cse2 .cse15 .cse13 .cse16 .cse8 .cse9 .cse17 .cse18 .cse19 .cse10 .cse11) (or .cse20 .cse21 .cse4 (and .cse22 .cse23 (= ~m_st~0 0) .cse24 .cse1 .cse25) .cse12 .cse26 .cse8 .cse27 .cse11) (or .cse20 .cse8 .cse18 .cse10) (or (and .cse0 (= ~t1_st~0 0) .cse22 .cse23 .cse24 .cse25) .cse21 .cse2 .cse13 .cse16 .cse8 .cse9 .cse17 .cse19 .cse10 .cse11) (or .cse20 .cse21 .cse4 .cse26 .cse16 .cse28 .cse8 .cse18 .cse27 .cse19) (or .cse20 .cse2 .cse4 .cse15 .cse16 .cse28 .cse8 .cse18 .cse27 .cse19) (or .cse2 .cse4 .cse15 .cse16 .cse28 .cse8 .cse9 .cse27 .cse18 .cse19)))) [2020-10-24 02:45:32,980 INFO L270 CegarLoopResult]: At program point L305(line 305) the Hoare annotation is: (let ((.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= |old(~m_st~0)| 0)) (.cse22 (= |old(~t1_st~0)| 0))) (let ((.cse1 (not .cse22)) (.cse3 (not (= ~t1_pc~0 0))) (.cse18 (not .cse5)) (.cse0 (not (= ~m_pc~0 0))) (.cse11 (= ~E_M~0 1)) (.cse13 (not (= ~M_E~0 1))) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (<= 2 ~E_1~0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse17 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and .cse14 .cse19)) (.cse12 (not (= ~m_pc~0 1))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse10 .cse11 .cse4 .cse6 .cse12 .cse13 (and .cse14 (= ~t1_st~0 0)) .cse9 .cse15 .cse16) (or .cse0 .cse10 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse6 (and (= ~m_st~0 0) .cse19) .cse8 .cse16) (or .cse7 (let ((.cse24 (+ ~local~0 1))) (let ((.cse20 (not (<= ~token~0 .cse24))) (.cse21 (not (<= .cse24 ~token~0))) (.cse23 (not .cse11))) (and (or .cse10 .cse20 .cse2 .cse21 .cse22 .cse23 .cse6 .cse12 .cse15 .cse16) (or .cse10 .cse20 .cse2 .cse18 .cse21 .cse22 .cse23 .cse6 .cse12 .cse16))))) (or .cse0 .cse6 .cse7 .cse15) (or .cse10 .cse17 .cse11 .cse4 .cse6 .cse7 .cse12 .cse13 .cse9 .cse15 .cse16) (or .cse10 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9)))) [2020-10-24 02:45:32,980 INFO L270 CegarLoopResult]: At program point activate_threadsENTRY(lines 303 327) the Hoare annotation is: (let ((.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse19 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= |old(~m_st~0)| 0)) (.cse22 (= |old(~t1_st~0)| 0))) (let ((.cse1 (not .cse22)) (.cse3 (not (= ~t1_pc~0 0))) (.cse18 (not .cse5)) (.cse0 (not (= ~m_pc~0 0))) (.cse11 (= ~E_M~0 1)) (.cse13 (not (= ~M_E~0 1))) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (<= 2 ~E_1~0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse17 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (and .cse14 .cse19)) (.cse12 (not (= ~m_pc~0 1))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse10 .cse11 .cse4 .cse6 .cse12 .cse13 (and .cse14 (= ~t1_st~0 0)) .cse9 .cse15 .cse16) (or .cse0 .cse10 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse6 (and (= ~m_st~0 0) .cse19) .cse8 .cse16) (or .cse7 (let ((.cse24 (+ ~local~0 1))) (let ((.cse20 (not (<= ~token~0 .cse24))) (.cse21 (not (<= .cse24 ~token~0))) (.cse23 (not .cse11))) (and (or .cse10 .cse20 .cse2 .cse21 .cse22 .cse23 .cse6 .cse12 .cse15 .cse16) (or .cse10 .cse20 .cse2 .cse18 .cse21 .cse22 .cse23 .cse6 .cse12 .cse16))))) (or .cse0 .cse6 .cse7 .cse15) (or .cse10 .cse17 .cse11 .cse4 .cse6 .cse7 .cse12 .cse13 .cse9 .cse15 .cse16) (or .cse10 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9)))) [2020-10-24 02:45:32,981 INFO L270 CegarLoopResult]: At program point activate_threadsEXIT(lines 303 327) the Hoare annotation is: (let ((.cse32 (not (= ~E_1~0 1))) (.cse35 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse30 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse29 (= |old(~m_st~0)| 0))) (let ((.cse14 (not .cse29)) (.cse19 (not (= ~t1_pc~0 0))) (.cse24 (and .cse30 .cse0 .cse21 .cse22)) (.cse18 (not .cse8)) (.cse15 (= ~E_M~0 1)) (.cse26 (not (= ~M_E~0 1))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse28 (and .cse35 .cse21 .cse22 .cse3)) (.cse13 (not (<= 2 ~E_1~0))) (.cse11 (not (= ~m_pc~0 1))) (.cse17 (not (= ~m_pc~0 0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~M_E~0 2))) (.cse31 (and .cse35 .cse32 .cse21 .cse22 .cse3)) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse25 (not (<= ~token~0 ~local~0))) (.cse10 (not (= ~t1_i~0 1))) (.cse20 (not (= ~E_M~0 ~M_E~0))) (.cse27 (not (<= ~local~0 ~token~0))) (.cse33 (<= 1 activate_threads_~tmp___0~0)) (.cse1 (= ~m_st~0 0))) (and (let ((.cse2 (<= 1 activate_threads_~tmp~1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (let ((.cse16 (+ ~local~0 1))) (let ((.cse5 (not (<= ~token~0 .cse16))) (.cse7 (not (<= .cse16 ~token~0))) (.cse9 (not .cse15))) (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)))))) (or .cse17 .cse18 .cse6 .cse14 .cse19 .cse10 .cse20 (and .cse21 .cse22 .cse1 .cse3) .cse13) (or .cse4 .cse23 .cse15 .cse24 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (or .cse17 .cse18 .cse6 .cse19 .cse25 .cse29 .cse10 .cse20 .cse27 .cse28) (or .cse17 .cse24 .cse10 .cse12 .cse28) (or .cse30 .cse4 .cse6 .cse23 .cse25 .cse10 .cse11 .cse20 .cse27 .cse12 .cse13) (or .cse18 .cse4 .cse15 .cse25 .cse10 .cse11 .cse26 .cse27 .cse12 .cse28 .cse13) (or .cse6 .cse31 .cse10 .cse11 .cse27 (and .cse32 .cse0 .cse21 .cse22) .cse4 (and .cse32 .cse0 .cse1) .cse23 .cse25 (and .cse0 .cse1 .cse33) .cse29 (and .cse0 .cse21 .cse33 .cse22) .cse20) (let ((.cse34 (not .cse1))) (or .cse17 (and .cse32 .cse0 .cse21 .cse22 .cse34) .cse4 .cse6 .cse31 .cse23 .cse25 .cse29 .cse10 .cse20 .cse27 (and .cse0 .cse21 .cse33 .cse22 .cse34)))))) [2020-10-24 02:45:32,981 INFO L270 CegarLoopResult]: At program point L192(lines 179 194) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse10 (= ~E_M~0 1)) (.cse1 (not (= ~t1_pc~0 1))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~m_st~0 0))) (.cse9 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~M_E~0 2))) (.cse14 (not (= ~t1_pc~0 0))) (.cse11 (not (<= ~token~0 ~local~0))) (.cse3 (not (= ~t1_i~0 1))) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (not (= ~t1_st~0 0))) (.cse5 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (and (<= exists_runnable_thread_~__retres1~2 0) (<= 0 exists_runnable_thread_~__retres1~2)) .cse9 .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse4 .cse13 .cse8) (or .cse0 .cse2 .cse14 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse15 .cse5 .cse13 .cse8) (let ((.cse16 (+ ~local~0 1))) (or .cse1 .cse2 (not (<= ~token~0 .cse16)) (not (<= .cse16 ~token~0)) .cse3 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8)) (or .cse9 .cse2 .cse14 .cse11 .cse3 .cse12 .cse15 .cse5 .cse6 .cse13 .cse8))) [2020-10-24 02:45:32,981 INFO L270 CegarLoopResult]: At program point L191(line 191) the Hoare annotation is: (let ((.cse10 (not (= ~t1_pc~0 0))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~t1_st~0 0))) (.cse5 (not (= ~m_pc~0 1))) (.cse9 (not (= ~m_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (not (= ~t1_i~0 1))) (.cse14 (not (<= 2 ~t1_st~0))) (.cse11 (not (= ~E_M~0 ~M_E~0))) (.cse12 (not (= ~m_st~0 0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 (= ~E_M~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse2 .cse10 .cse4 .cse6 .cse11 .cse12 .cse8) (or .cse0 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8) (or .cse9 .cse0 .cse4 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse1 (not (<= ~token~0 .cse13)) .cse2 (not (<= .cse13 ~token~0)) .cse4 .cse5 .cse14 .cse11 .cse12 .cse8)) (or .cse9 .cse1 .cse2 .cse4 .cse14 .cse11 .cse12 .cse8))) [2020-10-24 02:45:32,982 INFO L270 CegarLoopResult]: At program point exists_runnable_threadEXIT(lines 176 195) the Hoare annotation is: (let ((.cse13 (not (<= 2 ~t1_st~0))) (.cse16 (not (= ~m_pc~0 0))) (.cse2 (not (= ~t1_pc~0 0))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse14 (not (= ~m_st~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse15 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= ~t1_st~0 0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse12 (+ ~local~0 1))) (or .cse11 (not (<= ~token~0 .cse12)) .cse1 (not (<= .cse12 ~token~0)) .cse4 .cse5 .cse6 .cse13 .cse8 .cse14 .cse10)) (or (and (<= exists_runnable_thread_~__retres1~2 0) (<= 0 |exists_runnable_thread_#res|) (<= |exists_runnable_thread_#res| 0) (<= 0 exists_runnable_thread_~__retres1~2)) .cse0 .cse11 .cse1 .cse15 .cse3 .cse5 .cse6 .cse13 .cse9 .cse10) (or .cse16 .cse11 .cse1 .cse4 .cse5 .cse13 .cse8 .cse14 .cse10) (or .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse14 .cse10) (or .cse0 .cse11 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10))) [2020-10-24 02:45:32,982 INFO L270 CegarLoopResult]: At program point L185(line 185) the Hoare annotation is: (let ((.cse2 (= ~t1_st~0 0)) (.cse1 (not (<= 2 ~m_st~0))) (.cse10 (not (= ~m_pc~0 1))) (.cse0 (not (= ~m_pc~0 0))) (.cse8 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~M_E~0 2))) (.cse3 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 (not (= ~t1_pc~0 0)) .cse3 (not .cse2) .cse5 .cse6 .cse7) (let ((.cse9 (+ ~local~0 1))) (or .cse8 (not (<= ~token~0 .cse9)) .cse4 (not (<= .cse9 ~token~0)) .cse3 .cse10 .cse11 .cse5 .cse6 .cse7)) (or .cse1 .cse8 .cse4 (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) .cse3 .cse10 .cse11 (not (<= ~local~0 ~token~0)) .cse7) (or .cse0 .cse8 .cse4 .cse3 .cse11 .cse5 .cse6 .cse7))) [2020-10-24 02:45:32,982 INFO L270 CegarLoopResult]: At program point L184(lines 184 189) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~t1_i~0 1))) (.cse8 (not (<= 2 ~t1_st~0))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 (not (= ~t1_pc~0 0)) .cse2 (not (= ~t1_st~0 0)) .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (or .cse6 (not (<= ~token~0 .cse7)) .cse1 (not (<= .cse7 ~token~0)) .cse2 (not (= ~m_pc~0 1)) .cse8 .cse3 .cse4 .cse5)) (or .cse0 .cse6 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5))) [2020-10-24 02:45:32,982 INFO L277 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 176 195) the Hoare annotation is: true [2020-10-24 02:45:32,982 INFO L270 CegarLoopResult]: At program point L181(line 181) the Hoare annotation is: (let ((.cse7 (not (= ~t1_st~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (= ~E_M~0 1)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~E_1~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse5 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse2 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 ~M_E~0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or (not (= ~m_pc~0 0)) .cse0 .cse5))) [2020-10-24 02:45:32,983 INFO L277 CegarLoopResult]: At program point L180(lines 180 190) the Hoare annotation is: true [2020-10-24 02:45:32,983 INFO L270 CegarLoopResult]: At program point exists_runnable_threadFINAL(lines 176 195) the Hoare annotation is: (let ((.cse13 (not (<= 2 ~t1_st~0))) (.cse16 (not (= ~m_pc~0 0))) (.cse2 (not (= ~t1_pc~0 0))) (.cse8 (not (= ~E_M~0 ~M_E~0))) (.cse14 (not (= ~m_st~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse15 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= ~t1_st~0 0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse12 (+ ~local~0 1))) (or .cse11 (not (<= ~token~0 .cse12)) .cse1 (not (<= .cse12 ~token~0)) .cse4 .cse5 .cse6 .cse13 .cse8 .cse14 .cse10)) (or (and (<= exists_runnable_thread_~__retres1~2 0) (<= 0 |exists_runnable_thread_#res|) (<= |exists_runnable_thread_#res| 0) (<= 0 exists_runnable_thread_~__retres1~2)) .cse0 .cse11 .cse1 .cse15 .cse3 .cse5 .cse6 .cse13 .cse9 .cse10) (or .cse16 .cse11 .cse1 .cse4 .cse5 .cse13 .cse8 .cse14 .cse10) (or .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse14 .cse10) (or .cse0 .cse11 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10))) [2020-10-24 02:45:32,983 INFO L270 CegarLoopResult]: At program point is_transmit1_triggeredFINAL(lines 131 149) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (<= 1 is_transmit1_triggered_~__retres1~1) (<= 1 |is_transmit1_triggered_#res|))) (.cse3 (not (= ~E_1~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8))) [2020-10-24 02:45:32,983 INFO L277 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 131 149) the Hoare annotation is: true [2020-10-24 02:45:32,983 INFO L270 CegarLoopResult]: At program point is_transmit1_triggeredEXIT(lines 131 149) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and (<= 1 is_transmit1_triggered_~__retres1~1) (<= 1 |is_transmit1_triggered_#res|))) (.cse3 (not (= ~E_1~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8))) [2020-10-24 02:45:32,984 INFO L270 CegarLoopResult]: At program point L146(lines 134 148) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (<= 1 is_transmit1_triggered_~__retres1~1)) (.cse3 (not (= ~E_1~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8))) [2020-10-24 02:45:32,984 INFO L270 CegarLoopResult]: At program point L137(line 137) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 0)) (.cse6 (= ~m_st~0 0))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse2 (not (= ~t1_pc~0 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse12 (not (<= 2 ~t1_st~0))) (.cse1 (not (= ~M_E~0 2))) (.cse14 (not .cse6)) (.cse9 (not (<= 2 ~m_st~0))) (.cse10 (not (= ~t1_pc~0 1))) (.cse15 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse11 (not (= ~m_pc~0 1))) (.cse5 (not .cse18)) (.cse16 (not (= ~M_E~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse1 .cse3 .cse4 .cse11 .cse12 .cse7 .cse8 .cse13) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse14 .cse13) (or .cse9 .cse10 .cse15 .cse3 .cse4 .cse11 .cse12 .cse16 .cse8 .cse13) (let ((.cse17 (+ ~local~0 1))) (or .cse10 (not (<= ~token~0 .cse17)) .cse1 (not (<= .cse17 ~token~0)) .cse18 (not .cse15) .cse4 .cse11 .cse14 .cse13)) (or .cse9 .cse10 .cse15 .cse3 .cse4 .cse11 .cse5 .cse16 .cse8 .cse13)))) [2020-10-24 02:45:32,984 INFO L270 CegarLoopResult]: At program point L136(lines 136 141) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~t1_pc~0 0))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~t1_st~0 0))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse5 (= ~m_st~0 0))) (and (or .cse0 .cse1 .cse2 (not (<= ~token~0 ~local~0)) .cse3 .cse4 .cse5 .cse6 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (not .cse5) (not (<= 2 ~E_1~0))))) [2020-10-24 02:45:32,984 INFO L277 CegarLoopResult]: At program point L135(lines 135 144) the Hoare annotation is: true [2020-10-24 02:45:32,985 INFO L270 CegarLoopResult]: At program point L135-2(lines 135 144) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~E_1~0 1))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (<= 2 ~t1_st~0))) (.cse6 (not (= ~E_M~0 ~M_E~0))) (.cse7 (not (<= ~local~0 ~token~0)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~m_pc~0 1)) .cse5 .cse6 .cse7))) [2020-10-24 02:45:32,985 INFO L270 CegarLoopResult]: At program point L289-1(lines 278 301) the Hoare annotation is: (let ((.cse12 (= ~E_M~0 ~M_E~0)) (.cse10 (not (= ~t1_st~0 0))) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse14 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_i~0 1))) (.cse7 (not (= 2 |old(~M_E~0)|))) (.cse13 (= ~M_E~0 2))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse2 .cse12 .cse13)) (or .cse0 (and .cse2 .cse12 .cse14) (not (= ~t1_pc~0 0)) .cse6 .cse3 .cse7 .cse9 .cse10 (not (= ~m_st~0 0))) (or (and .cse2 .cse13 .cse14) .cse1 .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9 .cse11) (or .cse0 .cse1 .cse3 .cse7 .cse13))) [2020-10-24 02:45:32,985 INFO L270 CegarLoopResult]: At program point L285(line 285) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse11 (not (= ~t1_st~0 0))) (.cse5 (not (<= 2 ~m_st~0))) (.cse7 (and .cse1 .cse3 (= ~E_M~0 ~M_E~0) .cse4)) (.cse12 (not (= ~t1_pc~0 1))) (.cse13 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (= 2 |old(~M_E~0)|))) (.cse14 (not (= ~m_pc~0 1))) (.cse10 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse15 (not (<= ~local~0 ~token~0)))) (and (let ((.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 (and .cse1 (= ~M_E~0 2) .cse2) (and .cse1 .cse3 .cse4 .cse2) .cse5 .cse6)) (or .cse0 .cse7 (not (= ~t1_pc~0 0)) .cse8 .cse6 .cse9 .cse10 .cse11 (not (= ~m_st~0 0))) (or .cse0 .cse5 .cse3 .cse6 .cse9) (or .cse5 .cse12 .cse7 .cse13 .cse8 .cse6 .cse9 .cse14 .cse10 .cse11 .cse15) (or .cse5 .cse7 .cse12 .cse13 .cse8 .cse6 .cse9 .cse14 (not (<= 2 ~t1_st~0)) .cse10 .cse15)))) [2020-10-24 02:45:32,985 INFO L270 CegarLoopResult]: At program point L279-1(lines 278 301) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse5 (not (<= 2 ~m_st~0))) (.cse12 (not (= ~t1_pc~0 1))) (.cse7 (and .cse1 .cse3 (= ~E_M~0 ~M_E~0) .cse4)) (.cse13 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (= 2 |old(~M_E~0)|))) (.cse14 (not (= ~m_pc~0 1))) (.cse10 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse11 (not (= ~t1_st~0 0))) (.cse15 (not (<= ~local~0 ~token~0)))) (and (let ((.cse2 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 (and .cse1 (= ~M_E~0 2) .cse2) (and .cse1 .cse3 .cse4 .cse2) .cse5 .cse6)) (or .cse0 .cse7 (not (= ~t1_pc~0 0)) .cse8 .cse6 .cse9 .cse10 .cse11 (not (= ~m_st~0 0))) (or .cse0 .cse5 .cse3 .cse6 .cse9) (or .cse5 .cse12 .cse7 .cse13 .cse8 .cse6 .cse9 .cse14 (not (<= 2 ~t1_st~0)) .cse10 .cse15) (or .cse5 .cse12 .cse7 .cse13 .cse8 .cse6 .cse9 .cse14 .cse10 .cse11 .cse15)))) [2020-10-24 02:45:32,986 INFO L270 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 275 302) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse10 (not (= ~t1_st~0 0))) (.cse4 (not (<= 2 ~m_st~0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse6 (and .cse1 .cse2 (= ~E_M~0 ~M_E~0) .cse3)) (.cse12 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse8 (not (= 2 |old(~M_E~0)|))) (.cse13 (not (= ~m_pc~0 1))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse14 (not (<= ~local~0 ~token~0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (= ~E_M~0 |old(~E_M~0)|)) .cse4 .cse5) (or .cse0 .cse6 (not (= ~t1_pc~0 0)) .cse7 .cse5 .cse8 .cse9 .cse10 (not (= ~m_st~0 0))) (or .cse4 .cse11 .cse6 .cse12 .cse7 .cse5 .cse8 .cse13 .cse9 .cse10 .cse14) (or .cse4 .cse11 .cse6 .cse12 .cse7 .cse5 .cse8 .cse13 (not (<= 2 ~t1_st~0)) .cse9 .cse14)))) [2020-10-24 02:45:32,986 INFO L270 CegarLoopResult]: At program point L294-1(lines 275 302) the Hoare annotation is: (let ((.cse10 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (= ~M_E~0 2)) (.cse13 (not (= ~m_pc~0 0))) (.cse12 (and .cse10 (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse8 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 (= ~E_M~0 ~M_E~0) .cse11)) (or .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse9) (or .cse13 .cse0 .cse4 .cse5 .cse11) (or .cse13 (not (= ~t1_pc~0 0)) .cse12 .cse3 .cse4 .cse5 .cse7 .cse8 (not (= ~m_st~0 0)))))) [2020-10-24 02:45:32,986 INFO L270 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: (let ((.cse9 (not (= ~t1_st~0 0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse2) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 (not (= ~t1_pc~0 0)) .cse5 .cse2 .cse6 .cse8 .cse9 (not (= ~m_st~0 0))) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse10) (or .cse0 .cse1 .cse2 .cse6 (= ~M_E~0 2)))) [2020-10-24 02:45:32,987 INFO L270 CegarLoopResult]: At program point L284-1(lines 278 301) the Hoare annotation is: (let ((.cse11 (not (= ~t1_st~0 0))) (.cse0 (not (= ~m_pc~0 0))) (.cse14 (= ~M_E~0 2)) (.cse1 (not (<= 2 ~m_st~0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse8 (not (= 2 |old(~M_E~0)|))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse12 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4) (or .cse1 .cse5 .cse6 .cse7 .cse4 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse2 .cse13 .cse14)) (or .cse0 (not (= ~t1_pc~0 0)) (and .cse2 .cse13 (= ~M_E~0 |old(~M_E~0)|)) .cse7 .cse4 .cse8 .cse10 .cse11 (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse4 .cse8 .cse14) (or .cse1 .cse5 (and .cse2 .cse13 .cse3) .cse6 .cse7 .cse4 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse12))) [2020-10-24 02:45:32,987 INFO L270 CegarLoopResult]: At program point L280(line 280) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse9 (not (= ~t1_st~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse1 .cse2) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse6) (or .cse0 (not (= ~t1_pc~0 0)) .cse5 .cse2 .cse6 .cse8 .cse9 (not (= ~m_st~0 0))) (or .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse10))) [2020-10-24 02:45:32,987 INFO L270 CegarLoopResult]: At program point reset_delta_eventsEXIT(lines 275 302) the Hoare annotation is: (let ((.cse10 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse11 (= ~M_E~0 2)) (.cse13 (not (= ~m_pc~0 0))) (.cse12 (and .cse10 (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse8 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 (= ~E_M~0 ~M_E~0) .cse11)) (or .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse9) (or .cse13 .cse0 .cse4 .cse5 .cse11) (or .cse13 (not (= ~t1_pc~0 0)) .cse12 .cse3 .cse4 .cse5 .cse7 .cse8 (not (= ~m_st~0 0)))))) [2020-10-24 02:45:32,987 INFO L270 CegarLoopResult]: At program point L295(line 295) the Hoare annotation is: (let ((.cse8 (not (= ~t1_st~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~m_pc~0 0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 (= ~E_1~0 |old(~E_1~0)|) .cse4) (or .cse10 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse7 .cse8 (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse9) (or .cse10 .cse0 .cse4 .cse5 (= ~M_E~0 2)))) [2020-10-24 02:45:32,988 INFO L270 CegarLoopResult]: At program point L162-1(lines 161 174) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2020-10-24 02:45:32,988 INFO L270 CegarLoopResult]: At program point init_threadsEXIT(lines 158 175) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2020-10-24 02:45:32,988 INFO L270 CegarLoopResult]: At program point init_threadsENTRY(lines 158 175) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2020-10-24 02:45:32,988 INFO L270 CegarLoopResult]: At program point L170(line 170) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2020-10-24 02:45:32,988 INFO L270 CegarLoopResult]: At program point L168(line 168) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2020-10-24 02:45:32,988 INFO L270 CegarLoopResult]: At program point L167-1(lines 158 175) the Hoare annotation is: (let ((.cse0 (= |old(~t1_st~0)| ~t1_st~0))) (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) .cse0) (and (<= 2 ~m_st~0) .cse0) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0)))) [2020-10-24 02:45:32,989 INFO L270 CegarLoopResult]: At program point L165(line 165) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2020-10-24 02:45:32,989 INFO L270 CegarLoopResult]: At program point L163(line 163) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= |old(~t1_st~0)| 0)) (not (= ~M_E~0 2)) (not (= |old(~m_st~0)| 0)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (and (= ~m_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)) (not (= ~E_M~0 ~M_E~0)) (not (<= 2 ~E_1~0))) [2020-10-24 02:45:32,989 INFO L270 CegarLoopResult]: At program point mainENTRY(lines 464 475) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (= |old(~t1_i~0)| 1)) [2020-10-24 02:45:32,989 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 464 475) the Hoare annotation is: true [2020-10-24 02:45:32,989 INFO L277 CegarLoopResult]: At program point L473(line 473) the Hoare annotation is: true [2020-10-24 02:45:32,989 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 464 475) the Hoare annotation is: true [2020-10-24 02:45:32,989 INFO L277 CegarLoopResult]: At program point L470(line 470) the Hoare annotation is: true [2020-10-24 02:45:32,990 INFO L270 CegarLoopResult]: At program point L469(line 469) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (= |old(~t1_i~0)| 1)) [2020-10-24 02:45:32,990 INFO L270 CegarLoopResult]: At program point L469-1(line 469) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~t1_i~0 1) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (= |old(~t1_i~0)| 1)) [2020-10-24 02:45:32,990 INFO L277 CegarLoopResult]: At program point errorEXIT(lines 8 15) the Hoare annotation is: true [2020-10-24 02:45:32,990 INFO L277 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-10-24 02:45:32,990 INFO L277 CegarLoopResult]: At program point errorENTRY(lines 8 15) the Hoare annotation is: true [2020-10-24 02:45:32,990 INFO L277 CegarLoopResult]: At program point errorFINAL(lines 8 15) the Hoare annotation is: true [2020-10-24 02:45:32,991 INFO L270 CegarLoopResult]: At program point masterEXIT(lines 32 75) the Hoare annotation is: (let ((.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (<= ~token~0 ~local~0)) (.cse7 (= ~m_pc~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse19 (= ~t1_i~0 1)) (.cse18 (= ~M_E~0 2)) (.cse17 (= ~t1_pc~0 1))) (let ((.cse11 (not (= |old(~m_pc~0)| 0))) (.cse12 (not .cse17)) (.cse0 (not .cse18)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not .cse19)) (.cse14 (and .cse5 .cse17 (= ~t1_st~0 0) .cse6 .cse18 .cse7 .cse19 .cse8 .cse9)) (.cse15 (and .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10)) (.cse4 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (or .cse12 .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse15 .cse4 .cse11) (let ((.cse16 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse12 .cse0 (not (<= |old(~token~0)| .cse16)) .cse13 .cse1 .cse2 .cse3 .cse14 .cse15 .cse4 (not (<= .cse16 |old(~token~0)|))))))) [2020-10-24 02:45:32,991 INFO L270 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (let ((.cse11 (= ~t1_st~0 0)) (.cse12 (<= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2)) (.cse13 (= ~m_pc~0 1)) (.cse16 (= ~t1_i~0 1)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse18 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse18)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (and .cse18 .cse11 .cse12 .cse17 .cse13 .cse16 .cse14 .cse15)) (.cse8 (and (= ~m_st~0 |old(~m_st~0)|) .cse18 .cse16 .cse17 .cse12 .cse13 .cse14 .cse15 (= |old(~t1_st~0)| ~t1_st~0))) (.cse1 (not .cse17)) (.cse5 (= |old(~m_st~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not .cse16)) (.cse9 (not (= ~E_M~0 ~M_E~0))) (.cse10 (not (= |old(~m_pc~0)| 0)))) (and (let ((.cse2 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse2)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= .cse2 |old(~token~0)|)))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) (and .cse11 .cse12 .cse13 .cse14 .cse15) .cse5 .cse6 .cse7 .cse9 .cse10)))) [2020-10-24 02:45:32,991 INFO L270 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not (= ~M_E~0 2))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse5 (and .cse10 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14)) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse8 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse9)) .cse2 (and .cse10 .cse11 .cse12 (= ~m_pc~0 1) .cse13 .cse14) .cse3 .cse4 .cse6 .cse7 (not (<= .cse9 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse6 .cse5 .cse7 .cse8)))) [2020-10-24 02:45:32,992 INFO L270 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (let ((.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse8)) .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-10-24 02:45:32,992 INFO L270 CegarLoopResult]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse4 (and .cse10 .cse11 (= ~m_pc~0 0) .cse12)) (.cse6 (not (= |old(~m_pc~0)| 0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse5 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse9 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse9)) .cse8 .cse1 .cse2 .cse3 (and .cse10 .cse11 (= ~m_pc~0 1) .cse12) .cse5 (not (<= .cse9 |old(~token~0)|))))))) [2020-10-24 02:45:32,992 INFO L270 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse8)) .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-10-24 02:45:32,992 INFO L270 CegarLoopResult]: At program point L40(lines 35 74) the Hoare annotation is: (let ((.cse7 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~E_M~0 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse8)) .cse2 .cse3 .cse4 .cse5 (let ((.cse9 (+ ~local~0 1))) (and (<= .cse9 ~token~0) (<= ~token~0 .cse9) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) .cse6 (not (<= .cse8 |old(~token~0)|)))))) [2020-10-24 02:45:32,993 INFO L270 CegarLoopResult]: At program point L69(lines 32 75) the Hoare annotation is: (let ((.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (<= ~token~0 ~local~0)) (.cse7 (= ~m_pc~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse19 (= ~t1_i~0 1)) (.cse18 (= ~M_E~0 2)) (.cse17 (= ~t1_pc~0 1))) (let ((.cse11 (not (= |old(~m_pc~0)| 0))) (.cse12 (not .cse17)) (.cse0 (not .cse18)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not .cse19)) (.cse14 (and .cse5 .cse17 (= ~t1_st~0 0) .cse6 .cse18 .cse7 .cse19 .cse8 .cse9)) (.cse15 (and .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10)) (.cse4 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (or .cse12 .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse15 .cse4 .cse11) (let ((.cse16 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse12 .cse0 (not (<= |old(~token~0)| .cse16)) .cse13 .cse1 .cse2 .cse3 .cse14 .cse15 .cse4 (not (<= .cse16 |old(~token~0)|))))))) [2020-10-24 02:45:32,993 INFO L270 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (let ((.cse7 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~E_M~0 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse8)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= .cse8 |old(~token~0)|)))))) [2020-10-24 02:45:32,993 INFO L270 CegarLoopResult]: At program point L61(lines 35 74) the Hoare annotation is: (let ((.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse8)) .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-10-24 02:45:32,994 INFO L270 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (let ((.cse16 (= ~t1_st~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse14 (= ~m_pc~0 0))) (let ((.cse4 (and .cse16 .cse10 .cse11 .cse12 .cse14)) (.cse6 (not (= |old(~m_pc~0)| 0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse5 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse15 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse15)) .cse8 .cse1 (and .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse16 .cse10 .cse11 .cse12) .cse2 .cse3 .cse5 (not (<= .cse15 |old(~token~0)|))))))) [2020-10-24 02:45:32,994 INFO L270 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse0 (and .cse10 .cse11 .cse12 (= ~m_pc~0 0) .cse13)) (.cse7 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (= |old(~m_st~0)| 0)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 (not (= ~t1_pc~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse1 (not (<= |old(~token~0)| .cse8)) .cse9 .cse2 .cse3 .cse4 (and .cse10 .cse11 (= ~m_pc~0 1) .cse12 .cse13) .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse0 .cse7 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2020-10-24 02:45:32,994 INFO L270 CegarLoopResult]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse16 (= ~t1_st~0 0)) (.cse2 (<= ~token~0 ~local~0)) (.cse3 (<= ~local~0 ~token~0)) (.cse5 (= ~m_pc~0 0))) (let ((.cse9 (and .cse16 .cse2 .cse3 .cse5)) (.cse14 (not (= |old(~m_pc~0)| 0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (not (= ~E_1~0 1))) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse10 (= |old(~m_st~0)| 0)) (.cse11 (not (<= 2 |old(~E_1~0)|))) (.cse12 (not (= ~t1_i~0 1))) (.cse13 (not (= ~E_M~0 ~M_E~0)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or (not (= |old(~t1_st~0)| 0)) .cse7 (not (= ~t1_pc~0 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse6 .cse7 (not (<= |old(~token~0)| .cse15)) .cse8 (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse10 .cse11 .cse12 (and .cse16 .cse2 .cse3) .cse13 (not (<= .cse15 |old(~token~0)|))))))) [2020-10-24 02:45:32,994 INFO L270 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse4 (and .cse10 .cse11 (= ~m_pc~0 0) .cse12)) (.cse6 (not (= |old(~m_pc~0)| 0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse5 (not (= ~E_M~0 ~M_E~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse9 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse9)) .cse8 .cse1 .cse2 .cse3 (and .cse10 .cse11 (= ~m_pc~0 1) .cse12) .cse5 (not (<= .cse9 |old(~token~0)|))))))) [2020-10-24 02:45:32,995 INFO L270 CegarLoopResult]: At program point masterENTRY(lines 32 75) the Hoare annotation is: (let ((.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= |old(~token~0)| ~token~0))) (let ((.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (= ~M_E~0 2))) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= |old(~m_st~0)| 0)) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (and (= ~local~0 |old(~local~0)|) .cse11 .cse12 .cse13 .cse14 .cse15)) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= |old(~m_pc~0)| 0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse7 .cse0 (not (<= |old(~token~0)| .cse8)) .cse9 .cse1 .cse2 .cse3 (let ((.cse10 (+ ~local~0 1))) (and (<= .cse10 ~token~0) (<= ~token~0 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15)) .cse5 (not (<= .cse8 |old(~token~0)|)))) (or .cse7 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2020-10-24 02:45:32,995 INFO L270 CegarLoopResult]: At program point L39(lines 39 43) the Hoare annotation is: (let ((.cse7 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~E_M~0 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse8 (+ |old(~local~0)| 1))) (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (not (<= |old(~token~0)| .cse8)) .cse2 .cse3 .cse4 .cse5 (let ((.cse9 (+ ~local~0 1))) (and (<= .cse9 ~token~0) (<= ~token~0 .cse9) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0))) .cse6 (not (<= .cse8 |old(~token~0)|)))))) [2020-10-24 02:45:32,995 INFO L270 CegarLoopResult]: At program point fire_time_eventsEXIT(lines 339 347) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~m_pc~0 1))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (= ~M_E~0 1)) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 .cse8))) [2020-10-24 02:45:32,995 INFO L270 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 339 347) the Hoare annotation is: (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~m_pc~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (<= 2 ~E_1~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse6 (= ~M_E~0 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 .cse4 .cse6))) [2020-10-24 02:45:32,996 INFO L270 CegarLoopResult]: At program point fire_time_eventsFINAL(lines 339 347) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~m_pc~0 1))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (= ~M_E~0 1)) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7 .cse8))) [2020-10-24 02:45:32,996 INFO L270 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-10-24 02:45:32,996 INFO L270 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-10-24 02:45:32,996 INFO L270 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-10-24 02:45:32,996 INFO L270 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-10-24 02:45:32,996 INFO L270 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2020-10-24 02:45:32,997 INFO L270 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-10-24 02:45:32,997 INFO L270 CegarLoopResult]: At program point L3-5(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-10-24 02:45:32,997 INFO L270 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2020-10-24 02:45:32,997 INFO L270 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= |old(~token~0)| ~token~0)) [2020-10-24 02:45:32,997 INFO L270 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= |old(~token~0)| ~token~0)) [2020-10-24 02:45:32,997 INFO L270 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (= ~t1_st~0 0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-10-24 02:45:32,997 INFO L270 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= ~t1_st~0 0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-10-24 02:45:32,998 INFO L270 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-10-24 02:45:32,998 INFO L270 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-10-24 02:45:32,998 INFO L270 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-10-24 02:45:32,998 INFO L270 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~m_i~0)| ~m_i~0) (= |old(~t1_st~0)| ~t1_st~0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-10-24 02:45:32,998 INFO L270 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~m_i~0)| ~m_i~0) (= ~m_pc~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-10-24 02:45:32,998 INFO L270 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~m_i~0)| ~m_i~0) (= ~m_pc~0 0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) [2020-10-24 02:45:32,998 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |old(#valid)| |#valid|) (= ~E_M~0 |old(~E_M~0)|) (= |#t~string5.base| |old(#t~string5.base)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~m_i~0 |old(~m_i~0)|)) [2020-10-24 02:45:32,999 INFO L270 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-10-24 02:45:32,999 INFO L270 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-10-24 02:45:32,999 INFO L270 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2020-10-24 02:45:32,999 INFO L270 CegarLoopResult]: At program point stop_simulationFINAL(lines 386 404) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (and (<= stop_simulation_~tmp~2 0) (<= 1 |stop_simulation_#res|) (<= 1 stop_simulation_~__retres2~0) (<= 0 stop_simulation_~tmp~2)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-10-24 02:45:32,999 INFO L270 CegarLoopResult]: At program point L401(lines 390 403) the Hoare annotation is: (or (and (<= stop_simulation_~tmp~2 0) (<= 1 stop_simulation_~__retres2~0) (<= 0 stop_simulation_~tmp~2)) (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-10-24 02:45:32,999 INFO L270 CegarLoopResult]: At program point L400(line 400) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (= ~E_M~0 1)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (and (<= stop_simulation_~tmp~2 0) (<= 0 stop_simulation_~tmp~2))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse8 .cse9))) [2020-10-24 02:45:32,999 INFO L270 CegarLoopResult]: At program point L395(line 395) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-10-24 02:45:32,999 INFO L270 CegarLoopResult]: At program point L394(lines 394 399) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (and (<= stop_simulation_~tmp~2 0) (<= 0 stop_simulation_~tmp~2)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-10-24 02:45:33,000 INFO L277 CegarLoopResult]: At program point L392(line 392) the Hoare annotation is: true [2020-10-24 02:45:33,000 INFO L270 CegarLoopResult]: At program point L392-1(line 392) the Hoare annotation is: (or (and (<= 0 |stop_simulation_#t~ret13|) (<= |stop_simulation_#t~ret13| 0)) (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-10-24 02:45:33,000 INFO L270 CegarLoopResult]: At program point L392-2(line 392) the Hoare annotation is: (or (and (<= 0 |stop_simulation_#t~ret13|) (<= |stop_simulation_#t~ret13| 0)) (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-10-24 02:45:33,000 INFO L270 CegarLoopResult]: At program point stop_simulationEXIT(lines 386 404) the Hoare annotation is: (or (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (and (<= stop_simulation_~tmp~2 0) (<= 1 |stop_simulation_#res|) (<= 1 stop_simulation_~__retres2~0) (<= 0 stop_simulation_~tmp~2)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-10-24 02:45:33,000 INFO L270 CegarLoopResult]: At program point L392-3(line 392) the Hoare annotation is: (or (and (<= stop_simulation_~tmp~2 0) (<= 0 |stop_simulation_#t~ret13|) (<= |stop_simulation_#t~ret13| 0) (<= 0 stop_simulation_~tmp~2)) (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (= ~M_E~0 2)) (= ~E_M~0 1) (not (<= ~token~0 ~local~0)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-10-24 02:45:33,000 INFO L277 CegarLoopResult]: At program point L388(line 388) the Hoare annotation is: true [2020-10-24 02:45:33,000 INFO L277 CegarLoopResult]: At program point stop_simulationENTRY(lines 386 404) the Hoare annotation is: true [2020-10-24 02:45:33,001 INFO L270 CegarLoopResult]: At program point L217(line 217) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse11 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse4 (= ~m_st~0 0)) (.cse3 (not (= eval_~tmp~0 0)))) (let ((.cse13 (not (= |old(~m_pc~0)| 0))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse7 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse14 (let ((.cse16 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse16) (<= .cse16 ~token~0) .cse11 .cse2 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse4 .cse3))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= |old(~token~0)| ~token~0))) (or .cse0 (and (= ~local~0 |old(~local~0)|) .cse1 .cse2 .cse3 .cse4 (= ~t1_pc~0 0) .cse5 (= |old(~t1_st~0)| ~t1_st~0) .cse6) .cse7 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse8 .cse9 (and .cse1 (or (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse10 .cse11 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse4 .cse5)) (and .cse10 .cse11 .cse4 .cse5 .cse6)) .cse3 (= ~E_M~0 |old(~E_M~0)|)) .cse13 .cse14)) (or .cse9 .cse13 .cse15) (or (not (= |old(~m_pc~0)| 1)) .cse0 (= |old(~E_M~0)| 1) .cse7 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse8 .cse9 .cse14 .cse15)))) [2020-10-24 02:45:33,001 INFO L270 CegarLoopResult]: At program point L213(line 213) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2020-10-24 02:45:33,001 INFO L270 CegarLoopResult]: At program point L205(line 205) the Hoare annotation is: (let ((.cse25 (= ~m_st~0 0)) (.cse5 (not (= |eval_#t~ret8| 0))) (.cse15 (= ~t1_st~0 0)) (.cse23 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~m_st~0)) (.cse24 (= ~t1_pc~0 1)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse19 (not (= eval_~tmp~0 0))) (.cse20 (<= ~local~0 ~token~0))) (let ((.cse26 (= ~m_pc~0 0)) (.cse11 (not (= |old(~m_pc~0)| 0))) (.cse0 (and .cse23 .cse14 .cse24 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse1 (not (= ~M_E~0 2))) (.cse10 (not (= ~t1_i~0 1))) (.cse2 (= ~local~0 |old(~local~0)|)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (not (= |old(~t1_st~0)| 0))) (.cse13 (and .cse14 .cse24 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse21 (not (<= 2 |old(~E_1~0)|))) (.cse22 (let ((.cse28 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse28) (<= .cse28 ~token~0) .cse24 .cse5 .cse6 .cse17 .cse18 .cse25 .cse19))) (.cse27 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse7 (= ~t1_pc~0 0)) (.cse9 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse6 .cse7 .cse8 .cse9) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) .cse10 .cse11 .cse12 .cse13 (not (= |old(~t1_pc~0)| 0)) (and .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse7 .cse20) .cse21 .cse22 (and .cse23 .cse24 .cse5 .cse4 .cse6 .cse25 .cse19 .cse26 .cse9))) (or .cse10 (and .cse14 .cse26) .cse11 .cse27) (or .cse0 .cse1 (not (= |old(~t1_pc~0)| 1)) .cse10 (and .cse2 .cse3 .cse24 .cse5 .cse4 .cse16 .cse17 .cse20 .cse8 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_pc~0)| 1)) .cse12 (= |old(~E_M~0)| 1) .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse21 .cse22 .cse27)))) [2020-10-24 02:45:33,002 INFO L270 CegarLoopResult]: At program point L205-1(line 205) the Hoare annotation is: (let ((.cse25 (= ~m_st~0 0)) (.cse5 (not (= |eval_#t~ret8| 0))) (.cse15 (= ~t1_st~0 0)) (.cse23 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~m_st~0)) (.cse24 (= ~t1_pc~0 1)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse19 (not (= eval_~tmp~0 0))) (.cse20 (<= ~local~0 ~token~0))) (let ((.cse26 (= ~m_pc~0 0)) (.cse11 (not (= |old(~m_pc~0)| 0))) (.cse0 (and .cse23 .cse14 .cse24 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse1 (not (= ~M_E~0 2))) (.cse10 (not (= ~t1_i~0 1))) (.cse2 (= ~local~0 |old(~local~0)|)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (not (= |old(~t1_st~0)| 0))) (.cse13 (and .cse14 .cse24 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20)) (.cse21 (not (<= 2 |old(~E_1~0)|))) (.cse22 (let ((.cse28 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse28) (<= .cse28 ~token~0) .cse24 .cse5 .cse6 .cse17 .cse18 .cse25 .cse19))) (.cse27 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse7 (= ~t1_pc~0 0)) (.cse9 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse6 .cse7 .cse8 .cse9) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) .cse10 .cse11 .cse12 .cse13 (not (= |old(~t1_pc~0)| 0)) (and .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse7 .cse20) .cse21 .cse22 (and .cse23 .cse24 .cse5 .cse4 .cse6 .cse25 .cse19 .cse26 .cse9))) (or .cse10 (and .cse14 .cse26) .cse11 .cse27) (or .cse0 .cse1 (not (= |old(~t1_pc~0)| 1)) .cse10 (and .cse2 .cse3 .cse24 .cse5 .cse4 .cse16 .cse17 .cse20 .cse8 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_pc~0)| 1)) .cse12 (= |old(~E_M~0)| 1) .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse21 .cse22 .cse27)))) [2020-10-24 02:45:33,002 INFO L270 CegarLoopResult]: At program point L205-2(line 205) the Hoare annotation is: (let ((.cse25 (= ~m_st~0 0)) (.cse3 (not (= |eval_#t~ret8| 0))) (.cse20 (= ~t1_st~0 0)) (.cse5 (not (= eval_~tmp~0 0))) (.cse26 (<= 2 ~t1_st~0)) (.cse17 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse21 (= ~E_M~0 ~M_E~0)) (.cse4 (<= ~token~0 ~local~0)) (.cse22 (= ~m_pc~0 1)) (.cse23 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (let ((.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~M_E~0 2))) (.cse10 (not (= ~t1_i~0 1))) (.cse19 (not (= |old(~m_pc~0)| 0))) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse12 (and .cse26 .cse17 .cse1 .cse21 .cse4 .cse22 .cse23 .cse6)) (.cse13 (and .cse17 .cse1 .cse3 .cse20 .cse21 .cse4 .cse22 .cse23 .cse5 .cse6)) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse15 (let ((.cse27 (+ ~local~0 1))) (and .cse26 (<= ~token~0 .cse27) (<= .cse27 ~token~0) .cse1 .cse3 .cse21 .cse22 .cse23 .cse25 .cse5))) (.cse7 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= ~E_M~0 |old(~E_M~0)|)) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= ~m_pc~0 0)) (.cse9 (= |old(~token~0)| ~token~0))) (and (or .cse0 (not (= |old(~t1_pc~0)| 1)) (and .cse1 (= ~m_st~0 |old(~m_st~0)|) .cse2 .cse3 (= ~m_pc~0 |old(~m_pc~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 (not (= |old(~m_pc~0)| 1)) .cse11 (= |old(~E_M~0)| 1) .cse12 .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse14 .cse15 .cse16) (or .cse10 (and .cse17 .cse18) .cse19 .cse16) (let ((.cse24 (= ~t1_pc~0 0))) (or .cse0 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) .cse10 .cse19 .cse11 .cse12 .cse13 (not (= |old(~t1_pc~0)| 0)) (and .cse17 .cse3 .cse20 .cse21 .cse4 .cse22 .cse23 .cse5 .cse24 .cse6) .cse14 .cse15 (and (= ~local~0 |old(~local~0)|) .cse3 .cse2 .cse5 .cse25 .cse24 .cse18 .cse7 .cse9 .cse8) (and .cse26 .cse1 .cse3 .cse2 .cse21 .cse25 .cse5 .cse18 .cse9)))))) [2020-10-24 02:45:33,002 INFO L270 CegarLoopResult]: At program point L226(lines 202 240) the Hoare annotation is: (let ((.cse7 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 0)) (.cse14 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (= ~t1_pc~0 1)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (= ~m_pc~0 1)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (not (= eval_~tmp~0 0))) (.cse13 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse14 .cse1 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse20 (let ((.cse24 (+ ~local~0 1))) (and .cse14 (<= ~token~0 .cse24) (<= .cse24 ~token~0) .cse15 .cse8 .cse10 .cse11 .cse17 .cse12))) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse18 (= |old(~token~0)| ~token~0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse22 (and .cse1 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse23 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~t1_pc~0 0) .cse13) (and .cse14 .cse15 .cse16 .cse8 .cse17 .cse12 .cse2 .cse18) (and (= ~local~0 |old(~local~0)|) .cse16 .cse19 .cse8 .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse18) .cse0 .cse3 .cse20 .cse21 .cse22 (not (= |old(~t1_pc~0)| 0)) .cse23) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 .cse20 (not (= |old(~m_pc~0)| 1)) (and .cse15 (= ~m_st~0 |old(~m_st~0)|) .cse16 .cse7 .cse19 .cse9 .cse13 (= ~E_M~0 |old(~E_M~0)|) .cse18) .cse21 (= |old(~E_M~0)| 1) .cse22 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse23 .cse4)))) [2020-10-24 02:45:33,002 INFO L270 CegarLoopResult]: At program point evalEXIT(lines 196 246) the Hoare annotation is: (let ((.cse1 (<= 2 ~m_st~0))) (let ((.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (= |old(~t1_st~0)| 0))) (.cse6 (not (= ~M_E~0 2))) (.cse5 (and (<= 2 ~t1_st~0) .cse1 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse2 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (and .cse1 (= ~m_pc~0 0)) .cse2 .cse3) (or (not (= |old(~m_pc~0)| 1)) .cse4 .cse5 (= |old(~E_M~0)| 1) .cse6 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse7 .cse0 .cse3) (or .cse4 .cse6 .cse5 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse7 .cse0 .cse2)))) [2020-10-24 02:45:33,003 INFO L270 CegarLoopResult]: At program point L218(line 218) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse11 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 ~M_E~0)) (.cse4 (not (= eval_~tmp~0 0))) (.cse6 (not (= ~m_st~0 0)))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse13 (let ((.cse16 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse16) (<= .cse16 ~token~0) .cse11 .cse3 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse4 .cse6))) (.cse9 (not (= ~t1_i~0 1))) (.cse14 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (let ((.cse7 (= |old(~token~0)| ~token~0)) (.cse5 (= ~m_pc~0 0)) (.cse2 (= ~E_1~0 |old(~E_1~0)|))) (or .cse0 .cse1 (and .cse2 (= ~t1_st~0 0) .cse3 .cse4 (= ~t1_pc~0 0) .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse8 .cse9 (and (or (and .cse10 .cse11 .cse5 .cse6 .cse7) (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse10 .cse11 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse5 .cse6))) .cse2 .cse4 (= ~E_M~0 |old(~E_M~0)|)) .cse13 .cse14)) (or (not (= |old(~m_pc~0)| 1)) .cse0 (= |old(~E_M~0)| 1) .cse1 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse8 .cse9 .cse13 .cse15) (or .cse9 .cse14 .cse15)))) [2020-10-24 02:45:33,003 INFO L270 CegarLoopResult]: At program point L214(line 214) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2020-10-24 02:45:33,003 INFO L270 CegarLoopResult]: At program point L214-1(line 214) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2020-10-24 02:45:33,003 INFO L270 CegarLoopResult]: At program point L214-2(line 214) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2020-10-24 02:45:33,004 INFO L270 CegarLoopResult]: At program point L231(line 231) the Hoare annotation is: (let ((.cse6 (= ~t1_i~0 1))) (let ((.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse5 (= ~E_M~0 ~M_E~0)) (.cse13 (not (<= 2 |old(~E_1~0)|))) (.cse14 (not .cse6)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= ~t1_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse12 (= ~m_pc~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse16 (not (= |old(~m_pc~0)| 0))) (.cse9 (not (= eval_~tmp~0 0))) (.cse11 (= ~E_M~0 |old(~E_M~0)|))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) .cse12) .cse13 .cse14 .cse15) (or (and .cse2 .cse4 (= ~m_pc~0 0)) .cse14 .cse16 .cse15) (let ((.cse17 (= ~t1_pc~0 0))) (or .cse0 .cse1 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse2 .cse4 .cse5 .cse7 .cse12 .cse8 .cse9 .cse17 .cse10) .cse13 .cse14 (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse12 .cse8 .cse9 .cse10 .cse11) .cse16 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) .cse9 .cse17 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= |old(~token~0)| ~token~0))))))) [2020-10-24 02:45:33,004 INFO L270 CegarLoopResult]: At program point L227(line 227) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2020-10-24 02:45:33,004 INFO L270 CegarLoopResult]: At program point evalENTRY(lines 196 246) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse7 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse12 (not (= ~M_E~0 2))) (.cse1 (= ~local~0 |old(~local~0)|)) (.cse3 (= ~E_1~0 |old(~E_1~0)|)) (.cse4 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse6 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~token~0)| ~token~0)) (.cse13 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse9 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10) (or (not (= |old(~m_pc~0)| 1)) .cse11 (and .cse2 .cse3 (= ~t1_st~0 0) .cse4 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse5 .cse7 .cse8) (= |old(~E_M~0)| 1) .cse12 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse13 .cse0 .cse10) (or .cse11 .cse12 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse1 .cse3 .cse4 (= ~E_M~0 ~M_E~0) (= ~m_st~0 0) (= ~t1_pc~0 0) .cse6 .cse8) .cse13 .cse0 .cse9))) [2020-10-24 02:45:33,005 INFO L270 CegarLoopResult]: At program point L215(lines 215 222) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (not (= eval_~tmp~0 0)))) (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (not (= |old(~m_pc~0)| 0))) (.cse6 (let ((.cse15 (+ ~local~0 1))) (and .cse12 (<= ~token~0 .cse15) (<= .cse15 ~token~0) .cse13 .cse14 (= ~m_pc~0 1) (<= 2 ~E_1~0) .cse9 .cse8)))) (and (or .cse0 .cse1 .cse2) (or (not (= |old(~m_pc~0)| 1)) .cse3 (= |old(~E_M~0)| 1) .cse4 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse0 .cse6 .cse2) (let ((.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 (= ~t1_pc~0 0) .cse10 (= |old(~t1_st~0)| ~t1_st~0) .cse11 (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse12 .cse13 .cse7 .cse14 .cse9 .cse8 .cse10 .cse11) .cse5 .cse0 .cse1 .cse6))))) [2020-10-24 02:45:33,005 INFO L270 CegarLoopResult]: At program point L207(lines 207 211) the Hoare annotation is: (let ((.cse13 (= ~t1_st~0 0)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (<= 2 ~t1_st~0)) (.cse20 (= ~t1_pc~0 1)) (.cse14 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~m_pc~0 1)) (.cse17 (<= 2 ~E_1~0)) (.cse8 (= ~m_st~0 0)) (.cse7 (not (= eval_~tmp~0 0)))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (= |old(~token~0)| ~token~0)) (.cse21 (let ((.cse26 (+ ~local~0 1))) (and .cse19 (<= ~token~0 .cse26) (<= .cse26 ~token~0) .cse20 .cse14 .cse16 .cse17 .cse8 .cse7))) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse23 (and .cse19 .cse1 .cse20 .cse14 .cse15 .cse16 .cse17 .cse18)) (.cse24 (and .cse1 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse18)) (.cse25 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse9 (= ~t1_pc~0 0))) (or .cse5 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse9 .cse2 .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse9 .cse18) (and .cse19 .cse20 .cse6 .cse14 .cse8 .cse7 .cse2 .cse11) .cse0 .cse3 .cse21 .cse22 .cse23 .cse24 (not (= |old(~t1_pc~0)| 0)) .cse25)) (or .cse5 (not (= |old(~t1_pc~0)| 1)) .cse0 (and .cse20 (= ~m_st~0 |old(~m_st~0)|) .cse6 (= ~m_pc~0 |old(~m_pc~0)|) .cse15 .cse7 .cse18 .cse10 .cse12 .cse11) .cse21 (not (= |old(~m_pc~0)| 1)) .cse22 (= |old(~E_M~0)| 1) .cse23 .cse24 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse25 .cse4)))) [2020-10-24 02:45:33,006 INFO L270 CegarLoopResult]: At program point L207-1(lines 202 240) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse20 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse21 (= ~t1_pc~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse8 (not (= eval_~tmp~0 0))) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse20 .cse1 .cse21 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (= |old(~token~0)| ~token~0)) (.cse22 (let ((.cse26 (+ ~local~0 1))) (and .cse20 (<= ~token~0 .cse26) (<= .cse26 ~token~0) .cse21 .cse15 .cse17 .cse18 .cse9 .cse8))) (.cse23 (not (= |old(~t1_st~0)| 0))) (.cse24 (and .cse1 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse25 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse10 (= ~t1_pc~0 0))) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse10 .cse19) (and .cse20 .cse21 .cse7 .cse15 .cse9 .cse8 .cse2 .cse12) .cse0 .cse3 .cse22 .cse23 .cse24 (not (= |old(~t1_pc~0)| 0)) .cse25)) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 (and .cse21 (= ~m_st~0 |old(~m_st~0)|) .cse7 (= ~m_pc~0 |old(~m_pc~0)|) .cse16 .cse8 .cse19 .cse11 .cse13 .cse12) .cse22 (not (= |old(~m_pc~0)| 1)) .cse23 (= |old(~E_M~0)| 1) .cse24 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse25 .cse4)))) [2020-10-24 02:45:33,006 INFO L270 CegarLoopResult]: At program point L203(line 203) the Hoare annotation is: (let ((.cse7 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 0)) (.cse14 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (= ~t1_pc~0 1)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (= ~m_pc~0 1)) (.cse11 (<= 2 ~E_1~0)) (.cse12 (not (= eval_~tmp~0 0))) (.cse13 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse14 .cse1 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse20 (let ((.cse24 (+ ~local~0 1))) (and .cse14 (<= ~token~0 .cse24) (<= .cse24 ~token~0) .cse15 .cse8 .cse10 .cse11 .cse17 .cse12))) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse18 (= |old(~token~0)| ~token~0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse22 (and .cse1 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (.cse23 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~t1_pc~0 0) .cse13) (and .cse14 .cse15 .cse16 .cse8 .cse17 .cse12 .cse2 .cse18) (and (= ~local~0 |old(~local~0)|) .cse16 .cse19 .cse8 .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse18) .cse0 .cse3 .cse20 .cse21 .cse22 (not (= |old(~t1_pc~0)| 0)) .cse23) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 .cse20 (not (= |old(~m_pc~0)| 1)) (and .cse15 (= ~m_st~0 |old(~m_st~0)|) .cse16 .cse7 .cse19 .cse9 .cse13 (= ~E_M~0 |old(~E_M~0)|) .cse18) .cse21 (= |old(~E_M~0)| 1) .cse22 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse23 .cse4)))) [2020-10-24 02:45:33,007 INFO L270 CegarLoopResult]: At program point L232(line 232) the Hoare annotation is: (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (not (= |old(~t1_st~0)| 0))) (.cse6 (not (= ~M_E~0 2))) (.cse17 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= ~m_st~0 0)) (.cse19 (= |old(~token~0)| ~token~0)) (.cse16 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse1 (<= 2 ~m_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse12 (<= 2 ~E_1~0)) (.cse11 (not (= ~t1_st~0 0))) (.cse13 (not (= eval_~tmp~0 0))) (.cse14 (<= ~local~0 ~token~0)) (.cse10 (= ~m_pc~0 1)) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse15 (= ~t1_pc~0 0))) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (not (= |old(~t1_pc~0)| 0)) (and .cse1 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14) .cse16 .cse0 (and .cse17 .cse8 .cse11 .cse18 .cse13 .cse15 .cse2 .cse19) (and .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse19) .cse3)) (let ((.cse20 (= ~E_M~0 |old(~E_M~0)|))) (or (not (= |old(~m_pc~0)| 1)) .cse5 .cse6 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse7 .cse17 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse20 .cse19) .cse16 .cse0 (and (or (and .cse1 .cse7 .cse9 .cse12 .cse11 .cse13 .cse14 .cse20) (and .cse1 .cse7 .cse8 .cse9 .cse12 .cse11 .cse13 .cse14)) .cse10) .cse4)))) [2020-10-24 02:45:33,007 INFO L270 CegarLoopResult]: At program point L228(line 228) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2020-10-24 02:45:33,007 INFO L270 CegarLoopResult]: At program point L228-1(line 228) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2020-10-24 02:45:33,008 INFO L270 CegarLoopResult]: At program point L228-2(line 228) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2020-10-24 02:45:33,008 INFO L270 CegarLoopResult]: At program point L212(lines 202 240) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse20 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~m_st~0)) (.cse21 (= ~t1_pc~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (= ~m_pc~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse8 (not (= eval_~tmp~0 0))) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse2 (= ~m_pc~0 0)) (.cse3 (not (= |old(~m_pc~0)| 0))) (.cse5 (and .cse20 .cse1 .cse21 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse6 (not (= ~M_E~0 2))) (.cse0 (not (= ~t1_i~0 1))) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (= |old(~token~0)| ~token~0)) (.cse22 (let ((.cse26 (+ ~local~0 1))) (and .cse20 (<= ~token~0 .cse26) (<= .cse26 ~token~0) .cse21 .cse15 .cse17 .cse18 .cse9 .cse8))) (.cse23 (not (= |old(~t1_st~0)| 0))) (.cse24 (and .cse1 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse19)) (.cse25 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (let ((.cse10 (= ~t1_pc~0 0))) (or .cse5 .cse6 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse15 .cse16 .cse17 .cse18 .cse8 .cse10 .cse19) (and .cse20 .cse21 .cse7 .cse15 .cse9 .cse8 .cse2 .cse12) .cse0 .cse3 .cse22 .cse23 .cse24 (not (= |old(~t1_pc~0)| 0)) .cse25)) (or .cse5 .cse6 (not (= |old(~t1_pc~0)| 1)) .cse0 (and .cse21 (= ~m_st~0 |old(~m_st~0)|) .cse7 (= ~m_pc~0 |old(~m_pc~0)|) .cse16 .cse8 .cse19 .cse11 .cse13 .cse12) .cse22 (not (= |old(~m_pc~0)| 1)) .cse23 (= |old(~E_M~0)| 1) .cse24 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse25 .cse4)))) [2020-10-24 02:45:33,008 INFO L270 CegarLoopResult]: At program point L241(lines 196 246) the Hoare annotation is: (let ((.cse1 (<= 2 ~m_st~0))) (let ((.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (= |old(~t1_st~0)| 0))) (.cse6 (not (= ~M_E~0 2))) (.cse5 (and (<= 2 ~t1_st~0) .cse1 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not (= ~t1_i~0 1))) (.cse2 (not (= |old(~m_pc~0)| 0)))) (and (or .cse0 (and .cse1 (= ~m_pc~0 0)) .cse2 .cse3) (or (not (= |old(~m_pc~0)| 1)) .cse4 .cse5 (= |old(~E_M~0)| 1) .cse6 (not (= |old(~t1_pc~0)| 1)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse7 .cse0 .cse3) (or .cse4 .cse6 .cse5 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) .cse7 .cse0 .cse2)))) [2020-10-24 02:45:33,009 INFO L270 CegarLoopResult]: At program point L229(lines 229 236) the Hoare annotation is: (let ((.cse16 (<= 2 ~m_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse17 (= ~t1_st~0 0)) (.cse18 (= ~E_M~0 ~M_E~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse19 (= ~m_pc~0 1)) (.cse20 (<= 2 ~E_1~0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse11 (<= ~local~0 ~token~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (and .cse16 .cse5 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse11)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse4 (not (= ~t1_i~0 1))) (.cse22 (not (= |old(~m_pc~0)| 0))) (.cse15 (not (<= 2 |old(~m_st~0)|)))) (and (or (not (= |old(~m_pc~0)| 1)) .cse0 .cse1 (= |old(~E_M~0)| 1) (not (= |old(~t1_pc~0)| 1)) .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (let ((.cse21 (= ~t1_pc~0 0))) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (not (= ~M_E~0 |old(~E_M~0)|)) (not (= |old(~t1_pc~0)| 0)) (and .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse10 .cse21 .cse11) .cse3 .cse4 .cse22 (and (= ~local~0 |old(~local~0)|) .cse6 .cse7 .cse8 .cse10 .cse21 .cse12 .cse13 .cse14))) (or (and .cse16 .cse17 (= ~m_pc~0 0)) .cse4 .cse22 .cse15)))) [2020-10-24 02:45:33,009 INFO L270 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 247 274) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse4 (not (<= 2 ~m_st~0))) (.cse6 (and .cse1 .cse2 (= ~E_M~0 ~M_E~0) .cse3)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse8 (not (= 2 |old(~M_E~0)|))) (.cse9 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (= ~E_M~0 |old(~E_M~0)|)) .cse4 .cse5) (or .cse0 .cse6 (not (= ~t1_pc~0 0)) .cse7 .cse5 .cse8 .cse9 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse4 (not (= ~t1_pc~0 1)) .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse5 .cse8 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse9 (not (<= ~local~0 ~token~0)))))) [2020-10-24 02:45:33,009 INFO L270 CegarLoopResult]: At program point L256-1(lines 250 273) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4) (or .cse0 .cse1 .cse4 .cse5 (= ~M_E~0 2)) (or .cse0 (not (= ~t1_pc~0 0)) (and .cse2 (= ~M_E~0 |old(~M_E~0)|) .cse3) .cse6 .cse4 .cse5 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (and .cse2 (= ~E_M~0 ~M_E~0) .cse3) (not (<= ~token~0 ~local~0)) .cse6 .cse4 .cse5 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0))))) [2020-10-24 02:45:33,010 INFO L270 CegarLoopResult]: At program point L252(line 252) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse3 (not (= 2 |old(~M_E~0)|))) (.cse5 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse1 .cse2) (or .cse0 .cse1 .cse2 .cse3) (or .cse0 (not (= ~t1_pc~0 0)) .cse4 .cse2 .cse3 .cse5 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse4 .cse2 .cse3 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse5 (not (<= ~local~0 ~token~0))))) [2020-10-24 02:45:33,010 INFO L270 CegarLoopResult]: At program point L267(line 267) the Hoare annotation is: (let ((.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse4 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 (= ~E_1~0 |old(~E_1~0)|) .cse2) (or .cse0 (not (= ~t1_pc~0 0)) .cse3 .cse2 .cse4 .cse5 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse3 .cse2 .cse4 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse5 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse2 .cse4 (= ~M_E~0 2)))) [2020-10-24 02:45:33,010 INFO L270 CegarLoopResult]: At program point L261-1(lines 250 273) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse4 (and .cse2 (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse4 .cse5 .cse3 .cse6 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse3 .cse6 (= ~M_E~0 2)) (or .cse0 (not (= ~t1_pc~0 0)) .cse4 .cse5 .cse3 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)))))) [2020-10-24 02:45:33,010 INFO L270 CegarLoopResult]: At program point L257(line 257) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~T1_E~0)| ~T1_E~0)) (.cse9 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse4 (and .cse2 .cse8 (= ~E_M~0 ~M_E~0) .cse9)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3) (or .cse0 .cse4 (not (= ~t1_pc~0 0)) .cse5 .cse3 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 .cse6 (and .cse8 .cse9)) (or .cse1 (not (= ~t1_pc~0 1)) .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse3 .cse6 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0)))))) [2020-10-24 02:45:33,011 INFO L270 CegarLoopResult]: At program point L251-1(lines 250 273) the Hoare annotation is: (let ((.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~T1_E~0)| ~T1_E~0)) (.cse9 (= ~M_E~0 |old(~M_E~0)|))) (let ((.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse4 (and .cse2 .cse8 (= ~E_M~0 ~M_E~0) .cse9)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse6 (not (= 2 |old(~M_E~0)|))) (.cse7 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3) (or .cse0 .cse4 (not (= ~t1_pc~0 0)) .cse5 .cse3 .cse6 .cse7 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 .cse6 (and .cse8 .cse9)) (or .cse1 (not (= ~t1_pc~0 1)) .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse3 .cse6 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse7 (not (<= ~local~0 ~token~0)))))) [2020-10-24 02:45:33,011 INFO L270 CegarLoopResult]: At program point fire_delta_eventsEXIT(lines 247 274) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse7 (not (= ~m_pc~0 0))) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse6 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 (not (= ~t1_pc~0 1)) (and .cse1 (= ~E_M~0 ~M_E~0) .cse2) (not (<= ~token~0 ~local~0)) .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse6 (not (<= ~local~0 ~token~0))) (or .cse7 .cse0 .cse4 .cse5 (= ~M_E~0 2)) (or .cse7 (not (= ~t1_pc~0 0)) (and .cse1 .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-10-24 02:45:33,011 INFO L270 CegarLoopResult]: At program point L266-1(lines 247 274) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse7 (not (= ~m_pc~0 0))) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= 2 |old(~M_E~0)|))) (.cse6 (not (= |old(~E_M~0)| |old(~M_E~0)|)))) (and (or .cse0 (not (= ~t1_pc~0 1)) (and .cse1 (= ~E_M~0 ~M_E~0) .cse2) (not (<= ~token~0 ~local~0)) .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse6 (not (<= ~local~0 ~token~0))) (or .cse7 .cse0 .cse4 .cse5 (= ~M_E~0 2)) (or .cse7 (not (= ~t1_pc~0 0)) (and .cse1 .cse2 (= ~E_M~0 |old(~E_M~0)|)) .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-10-24 02:45:33,012 INFO L270 CegarLoopResult]: At program point L262(line 262) the Hoare annotation is: (let ((.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= |old(~E_M~0)| |old(~M_E~0)|))) (.cse0 (not (= ~m_pc~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_i~0 1))) (.cse4 (not (= 2 |old(~M_E~0)|)))) (and (or .cse0 .cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse2) (or .cse0 (not (= ~t1_pc~0 0)) .cse3 .cse2 .cse4 .cse5 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse1 (not (= ~t1_pc~0 1)) (not (<= ~token~0 ~local~0)) .cse3 .cse2 .cse4 (not (= ~m_pc~0 1)) (not (<= 2 ~t1_st~0)) .cse5 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse2 .cse4 (= ~M_E~0 2)))) [2020-10-24 02:45:33,012 INFO L277 CegarLoopResult]: At program point update_channelsEXIT(lines 150 157) the Hoare annotation is: true [2020-10-24 02:45:33,012 INFO L277 CegarLoopResult]: At program point update_channelsFINAL(lines 150 157) the Hoare annotation is: true [2020-10-24 02:45:33,012 INFO L270 CegarLoopResult]: At program point L415(line 415) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 0)) (.cse1 (= |old(~t1_st~0)| ~t1_st~0))) (or (and (<= 2 ~m_st~0) (= ~M_E~0 2) .cse0 .cse1) (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and (= ~E_M~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) .cse0 .cse1 (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)))) [2020-10-24 02:45:33,012 INFO L277 CegarLoopResult]: At program point start_simulationEXIT(lines 405 463) the Hoare annotation is: true [2020-10-24 02:45:33,012 INFO L270 CegarLoopResult]: At program point L407(line 407) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2020-10-24 02:45:33,013 INFO L270 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-10-24 02:45:33,013 INFO L270 CegarLoopResult]: At program point L432-1(line 432) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-10-24 02:45:33,013 INFO L270 CegarLoopResult]: At program point L428(line 428) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-10-24 02:45:33,013 INFO L270 CegarLoopResult]: At program point L428-1(line 428) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-10-24 02:45:33,013 INFO L270 CegarLoopResult]: At program point L424(line 424) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse1 (= ~M_E~0 2)) (.cse2 (<= 2 ~E_1~0))) (or (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse4 .cse3) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse4 (= ~t1_pc~0 1) .cse0 (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) .cse1 (= ~m_pc~0 1) .cse2 (<= ~local~0 ~token~0)))) [2020-10-24 02:45:33,014 INFO L270 CegarLoopResult]: At program point L424-1(line 424) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (= ~E_M~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~m_pc~0 1) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-10-24 02:45:33,014 INFO L270 CegarLoopResult]: At program point L420-1(lines 417 457) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse1 (= ~M_E~0 2)) (.cse2 (<= 2 ~E_1~0))) (or (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse4 .cse3) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse4 (= ~t1_pc~0 1) .cse0 (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) .cse1 (= ~m_pc~0 1) .cse2 (<= ~local~0 ~token~0)))) [2020-10-24 02:45:33,014 INFO L270 CegarLoopResult]: At program point start_simulationENTRY(lines 405 463) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2020-10-24 02:45:33,014 INFO L270 CegarLoopResult]: At program point L416(line 416) the Hoare annotation is: (let ((.cse0 (= ~t1_st~0 0)) (.cse1 (= ~m_pc~0 0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and .cse0 (= ~E_M~0 ~M_E~0) (<= 2 ~E_1~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) .cse1 (= |old(~token~0)| ~token~0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (and (<= 2 ~m_st~0) .cse0 (= ~M_E~0 2) .cse1) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-10-24 02:45:33,015 INFO L270 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2020-10-24 02:45:33,015 INFO L270 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-10-24 02:45:33,015 INFO L270 CegarLoopResult]: At program point L408(line 408) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2020-10-24 02:45:33,015 INFO L270 CegarLoopResult]: At program point L437(line 437) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-10-24 02:45:33,015 INFO L270 CegarLoopResult]: At program point L437-1(line 437) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-10-24 02:45:33,016 INFO L270 CegarLoopResult]: At program point L437-2(line 437) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-10-24 02:45:33,016 INFO L270 CegarLoopResult]: At program point L433(line 433) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-10-24 02:45:33,016 INFO L277 CegarLoopResult]: At program point L458(lines 405 463) the Hoare annotation is: true [2020-10-24 02:45:33,016 INFO L270 CegarLoopResult]: At program point L421(line 421) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse4 (<= 2 ~m_st~0)) (.cse0 (= ~t1_st~0 0)) (.cse1 (= ~M_E~0 2)) (.cse2 (<= 2 ~E_1~0))) (or (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse4 .cse3) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse4 (= ~t1_pc~0 1) .cse0 (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) .cse1 (= ~m_pc~0 1) .cse2 (<= ~local~0 ~token~0)))) [2020-10-24 02:45:33,017 INFO L270 CegarLoopResult]: At program point L450(line 450) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |start_simulation_#t~ret15| 0))) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-10-24 02:45:33,017 INFO L270 CegarLoopResult]: At program point L450-1(line 450) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |start_simulation_#t~ret15| 0))) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-10-24 02:45:33,017 INFO L270 CegarLoopResult]: At program point L450-2(line 450) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (and (not (= start_simulation_~tmp___0~1 0)) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |start_simulation_#t~ret15| 0))) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-10-24 02:45:33,017 INFO L270 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2020-10-24 02:45:33,018 INFO L270 CegarLoopResult]: At program point L413-1(line 413) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 ~M_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~t1_pc~0 0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0))) [2020-10-24 02:45:33,018 INFO L270 CegarLoopResult]: At program point L442(line 442) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-10-24 02:45:33,018 INFO L270 CegarLoopResult]: At program point L442-1(line 442) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse7 (= ~M_E~0 1))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)))) [2020-10-24 02:45:33,018 INFO L270 CegarLoopResult]: At program point L434(line 434) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-10-24 02:45:33,019 INFO L270 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (= ~M_E~0 |old(~M_E~0)|)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= ~m_pc~0 0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~E_M~0 ~M_E~0) .cse2 (= ~m_st~0 0) (= ~t1_pc~0 0) .cse3 .cse4 (= |old(~token~0)| ~token~0)) (not (= |old(~m_pc~0)| 0)) (and (<= 2 ~m_st~0) .cse0 .cse1 .cse2 .cse4 .cse3 (= ~E_M~0 |old(~E_M~0)|)))) [2020-10-24 02:45:33,019 INFO L270 CegarLoopResult]: At program point L443(line 443) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse7 (= ~M_E~0 1))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)))) [2020-10-24 02:45:33,019 INFO L270 CegarLoopResult]: At program point L439(lines 439 448) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 ~M_E~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse0 (<= 2 ~m_st~0))) (or (not (= |old(~t1_st~0)| 0)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (not (= |old(~m_pc~0)| 0)))) [2020-10-24 02:45:33,019 INFO L270 CegarLoopResult]: At program point L439-1(lines 439 448) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-10-24 02:45:33,019 INFO L270 CegarLoopResult]: At program point L452(lines 452 456) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 1)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (not (= |old(~t1_st~0)| 0)) (not (= |old(~m_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (not (= ~t1_i~0 1)) (not (= 2 |old(~M_E~0)|)) (and .cse0 (= ~m_pc~0 0)) (not (= |old(~E_M~0)| |old(~M_E~0)|)) (and (not (= start_simulation_~tmp___0~1 0)) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~m_pc~0)| 0)) (and .cse0 .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-10-24 02:45:33,020 INFO L270 CegarLoopResult]: At program point L127(lines 115 129) the Hoare annotation is: (let ((.cse5 (= ~t1_st~0 0)) (.cse19 (= ~m_st~0 0))) (let ((.cse11 (= ~E_M~0 1)) (.cse16 (not (= ~M_E~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (not .cse19)) (.cse9 (not (<= 2 ~E_1~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse18 (not (<= 2 ~t1_st~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse21 (not (= ~m_pc~0 0))) (.cse13 (and (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse3 (not (= ~M_E~0 2))) (.cse22 (not (= ~t1_pc~0 0))) (.cse14 (not (<= ~token~0 ~local~0))) (.cse7 (not (= ~t1_i~0 1))) (.cse15 (not .cse5)) (.cse20 (not (= ~E_M~0 ~M_E~0))) (.cse17 (not (<= ~local~0 ~token~0)))) (and (or (<= 1 is_master_triggered_~__retres1~0) (let ((.cse12 (+ ~local~0 1))) (let ((.cse2 (not (<= ~token~0 .cse12))) (.cse4 (not (<= .cse12 ~token~0))) (.cse6 (not .cse11))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9))))) (or .cse0 .cse1 .cse13 .cse11 .cse14 .cse7 .cse8 .cse15 .cse16 .cse17 .cse9) (or .cse0 .cse1 .cse13 .cse11 .cse14 .cse7 .cse8 .cse18 .cse16 .cse17 .cse9) (or .cse1 .cse13 .cse3 .cse14 .cse7 .cse8 .cse18 .cse19 .cse20 .cse17) (or .cse21 .cse13 .cse3 .cse22 .cse7 .cse15 .cse20 .cse10 .cse9) (or .cse21 .cse1 .cse3 .cse13 .cse14 .cse7 .cse18 .cse19 .cse20 .cse17) (or .cse21 .cse0 .cse13 .cse7) (or .cse21 .cse13 .cse3 .cse22 .cse14 .cse7 .cse15 .cse19 .cse20 .cse17)))) [2020-10-24 02:45:33,020 INFO L270 CegarLoopResult]: At program point L118(line 118) the Hoare annotation is: (let ((.cse2 (not (= ~t1_pc~0 0))) (.cse1 (not (= ~M_E~0 2))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse6 (= ~m_st~0 0)) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse0 (not (= ~m_pc~0 0))) (.cse12 (not (<= 2 ~m_st~0))) (.cse9 (not (= ~t1_pc~0 1))) (.cse13 (= ~E_M~0 1)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~t1_i~0 1))) (.cse14 (not (= ~m_pc~0 1))) (.cse5 (not (= ~t1_st~0 0))) (.cse15 (not (= ~M_E~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse1 .cse3 .cse4 .cse10 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 (not .cse6) .cse11) (or .cse12 .cse9 .cse13 .cse3 .cse4 .cse14 .cse10 .cse15 .cse8 .cse11) (or .cse9 .cse1 .cse3 .cse4 .cse14 .cse10 .cse6 .cse7 .cse8) (or .cse0 .cse12 .cse4) (or .cse12 .cse9 .cse13 .cse3 .cse4 .cse14 .cse5 .cse15 .cse8 .cse11))) [2020-10-24 02:45:33,020 INFO L270 CegarLoopResult]: At program point L117(lines 117 122) the Hoare annotation is: (let ((.cse3 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse1 (not (= ~M_E~0 2))) (.cse2 (not (= ~t1_pc~0 0))) (.cse5 (not (= ~t1_st~0 0))) (.cse7 (not (= ~E_M~0 ~M_E~0))) (.cse6 (= ~m_st~0 0)) (.cse0 (not (= ~m_pc~0 0))) (.cse4 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 (not (= ~t1_pc~0 1)) .cse1 .cse3 .cse4 (not (<= 2 ~t1_st~0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 (not .cse6) (not (<= 2 ~E_1~0))) (or .cse0 (not (<= 2 ~m_st~0)) .cse4))) [2020-10-24 02:45:33,020 INFO L270 CegarLoopResult]: At program point is_master_triggeredFINAL(lines 112 130) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 0)) (.cse14 (= ~m_st~0 0))) (let ((.cse8 (not (= ~M_E~0 1))) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse3 (= ~E_M~0 1)) (.cse20 (not .cse14)) (.cse10 (not (<= 2 ~E_1~0))) (.cse22 (not (= ~t1_pc~0 0))) (.cse7 (not .cse18)) (.cse12 (not (= ~m_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse13 (not (= ~M_E~0 2))) (.cse2 (and (<= 0 |is_master_triggered_#res|) (<= |is_master_triggered_#res| 0) (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse15 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse8 .cse9 .cse10) (or .cse12 .cse0 .cse2 .cse5) (or .cse1 .cse13 .cse2 .cse4 .cse5 .cse6 .cse11 .cse14 .cse15 .cse9) (or (let ((.cse21 (+ ~local~0 1))) (let ((.cse16 (not (<= ~token~0 .cse21))) (.cse17 (not (<= .cse21 ~token~0))) (.cse19 (not .cse3))) (and (or .cse0 .cse1 .cse16 .cse13 .cse17 .cse18 .cse19 .cse5 .cse6 .cse10) (or .cse1 .cse16 .cse13 .cse17 .cse18 .cse19 .cse5 .cse6 .cse20 .cse10)))) (and (<= 1 |is_master_triggered_#res|) (<= 1 is_master_triggered_~__retres1~0))) (or .cse12 .cse13 .cse22 .cse2 .cse5 .cse7 .cse15 .cse20 .cse10) (or .cse12 .cse13 .cse22 .cse2 .cse4 .cse5 .cse7 .cse14 .cse15 .cse9) (or .cse12 .cse1 .cse13 .cse2 .cse4 .cse5 .cse11 .cse14 .cse15 .cse9)))) [2020-10-24 02:45:33,020 INFO L277 CegarLoopResult]: At program point L116(lines 116 125) the Hoare annotation is: true [2020-10-24 02:45:33,020 INFO L270 CegarLoopResult]: At program point L116-2(lines 116 125) the Hoare annotation is: (let ((.cse9 (+ ~local~0 1))) (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (not (<= ~token~0 .cse9))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (<= .cse9 ~token~0))) (.cse4 (= ~t1_st~0 0)) (.cse5 (not (= ~E_M~0 1))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or (not (<= 2 ~m_st~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_st~0 0)) .cse8)))) [2020-10-24 02:45:33,021 INFO L270 CegarLoopResult]: At program point is_master_triggeredEXIT(lines 112 130) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 0)) (.cse14 (= ~m_st~0 0))) (let ((.cse8 (not (= ~M_E~0 1))) (.cse0 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse3 (= ~E_M~0 1)) (.cse20 (not .cse14)) (.cse10 (not (<= 2 ~E_1~0))) (.cse22 (not (= ~t1_pc~0 0))) (.cse7 (not .cse18)) (.cse12 (not (= ~m_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse13 (not (= ~M_E~0 2))) (.cse2 (and (<= 0 |is_master_triggered_#res|) (<= |is_master_triggered_#res| 0) (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse15 (not (= ~E_M~0 ~M_E~0))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse8 .cse9 .cse10) (or .cse12 .cse0 .cse2 .cse5) (or .cse1 .cse13 .cse2 .cse4 .cse5 .cse6 .cse11 .cse14 .cse15 .cse9) (or (let ((.cse21 (+ ~local~0 1))) (let ((.cse16 (not (<= ~token~0 .cse21))) (.cse17 (not (<= .cse21 ~token~0))) (.cse19 (not .cse3))) (and (or .cse0 .cse1 .cse16 .cse13 .cse17 .cse18 .cse19 .cse5 .cse6 .cse10) (or .cse1 .cse16 .cse13 .cse17 .cse18 .cse19 .cse5 .cse6 .cse20 .cse10)))) (and (<= 1 |is_master_triggered_#res|) (<= 1 is_master_triggered_~__retres1~0))) (or .cse12 .cse13 .cse22 .cse2 .cse5 .cse7 .cse15 .cse20 .cse10) (or .cse12 .cse13 .cse22 .cse2 .cse4 .cse5 .cse7 .cse14 .cse15 .cse9) (or .cse12 .cse1 .cse13 .cse2 .cse4 .cse5 .cse11 .cse14 .cse15 .cse9)))) [2020-10-24 02:45:33,021 INFO L277 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 112 130) the Hoare annotation is: true [2020-10-24 02:45:33,021 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 02:45:33,021 INFO L270 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~E_M~0 ~M_E~0) (not (= ~t1_i~0 1)) (= ~M_E~0 2) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~t1_pc~0 0) (= ~m_pc~0 0)) [2020-10-24 02:45:33,021 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 02:45:33,021 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 02:45:33,021 INFO L270 CegarLoopResult]: At program point L353(line 353) the Hoare annotation is: (let ((.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2020-10-24 02:45:33,021 INFO L270 CegarLoopResult]: At program point reset_time_eventsEXIT(lines 348 375) the Hoare annotation is: (let ((.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= ~M_E~0 2) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2020-10-24 02:45:33,022 INFO L270 CegarLoopResult]: At program point L368(line 368) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= |old(~M_E~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse8) (or (not (= ~m_pc~0 0)) .cse0 (= ~E_1~0 |old(~E_1~0)|) .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) .cse7 .cse8))) [2020-10-24 02:45:33,022 INFO L270 CegarLoopResult]: At program point L362-1(lines 351 374) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse3 (and .cse1 (= ~M_E~0 2) (= ~E_M~0 |old(~E_M~0)|))) (.cse0 (not (<= 2 ~m_st~0))) (.cse4 (= |old(~E_M~0)| 1)) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2) (or .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 (not (<= 2 ~t1_st~0)) .cse9 .cse10) (or .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 (not (= ~t1_st~0 0)) .cse9 .cse10)))) [2020-10-24 02:45:33,022 INFO L270 CegarLoopResult]: At program point L358(line 358) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse0 (and .cse1 (= ~M_E~0 2) .cse2)) (.cse3 (not (<= 2 ~m_st~0))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and .cse1 (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) .cse2) .cse3 .cse4) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse11) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11)))) [2020-10-24 02:45:33,022 INFO L270 CegarLoopResult]: At program point L352-1(lines 351 374) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse0 (and .cse1 (= ~M_E~0 2) .cse2)) (.cse3 (not (<= 2 ~m_st~0))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and .cse1 (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) .cse2) .cse3 .cse4) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse11) (or .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse4 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11)))) [2020-10-24 02:45:33,022 INFO L270 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 348 375) the Hoare annotation is: (let ((.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse2 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 .cse1 .cse2) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2020-10-24 02:45:33,023 INFO L270 CegarLoopResult]: At program point L367-1(lines 348 375) the Hoare annotation is: (let ((.cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= ~M_E~0 2) (= ~E_M~0 |old(~E_M~0)|))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= |old(~M_E~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8 .cse9))) [2020-10-24 02:45:33,023 INFO L270 CegarLoopResult]: At program point L363(line 363) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse1 (not (= ~t1_i~0 1))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse1) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse1 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse8) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse1 .cse6 (not (= ~t1_st~0 0)) .cse7 .cse8))) [2020-10-24 02:45:33,023 INFO L270 CegarLoopResult]: At program point L357-1(lines 351 374) the Hoare annotation is: (let ((.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse2 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse4 (and .cse1 (= ~M_E~0 2) .cse2)) (.cse0 (not (<= 2 ~m_st~0))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not (= |old(~M_E~0)| 1)))) (and (or (not (= ~m_pc~0 0)) .cse0 (and .cse1 .cse2) .cse3) (or .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse3 .cse9 (not (<= 2 ~t1_st~0)) .cse10 .cse11) (or .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse3 .cse9 (not (= ~t1_st~0 0)) .cse10 .cse11)))) [2020-10-24 02:45:33,023 INFO L270 CegarLoopResult]: At program point init_modelFINAL(lines 376 385) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (= ~t1_i~0 1) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2020-10-24 02:45:33,023 INFO L270 CegarLoopResult]: At program point L381(line 381) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (not (= ~t1_i~0 1)) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2020-10-24 02:45:33,023 INFO L270 CegarLoopResult]: At program point init_modelEXIT(lines 376 385) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (= ~t1_i~0 1) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2020-10-24 02:45:33,023 INFO L270 CegarLoopResult]: At program point init_modelENTRY(lines 376 385) the Hoare annotation is: (or (not (= ~m_pc~0 0)) (not (= ~M_E~0 2)) (not (= ~t1_pc~0 0)) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~m_i~0)| ~m_i~0)) (not (= ~t1_st~0 0)) (not (= ~E_M~0 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~t1_i~0)| 1)) [2020-10-24 02:45:33,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:45:33 BoogieIcfgContainer [2020-10-24 02:45:33,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 02:45:33,138 INFO L168 Benchmark]: Toolchain (without parser) took 279400.33 ms. Allocated memory was 156.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 132.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 883.2 MB. Max. memory is 8.0 GB. [2020-10-24 02:45:33,139 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 156.2 MB. Free memory is still 131.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 02:45:33,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.74 ms. Allocated memory is still 156.2 MB. Free memory was 131.7 MB in the beginning and 119.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-24 02:45:33,140 INFO L168 Benchmark]: Boogie Preprocessor took 60.58 ms. Allocated memory is still 156.2 MB. Free memory was 119.2 MB in the beginning and 117.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 02:45:33,142 INFO L168 Benchmark]: RCFGBuilder took 965.61 ms. Allocated memory is still 156.2 MB. Free memory was 117.1 MB in the beginning and 110.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 12.2 MB. Max. memory is 8.0 GB. [2020-10-24 02:45:33,143 INFO L168 Benchmark]: TraceAbstraction took 277966.38 ms. Allocated memory was 156.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 110.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 860.4 MB. Max. memory is 8.0 GB. [2020-10-24 02:45:33,148 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 156.2 MB. Free memory is still 131.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 387.74 ms. Allocated memory is still 156.2 MB. Free memory was 131.7 MB in the beginning and 119.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 60.58 ms. Allocated memory is still 156.2 MB. Free memory was 119.2 MB in the beginning and 117.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 965.61 ms. Allocated memory is still 156.2 MB. Free memory was 117.1 MB in the beginning and 110.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 12.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 277966.38 ms. Allocated memory was 156.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 110.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 860.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 115]: Loop Invariant Derived loop invariant: (((((((1 <= __retres1 || ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(m_st == 0)) || !(2 <= E_1)))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1))) && (((((((((!(t1_pc == 1) || (0 <= __retres1 && __retres1 <= 0)) || !(M_E == 2)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && ((((((((!(m_pc == 0) || (0 <= __retres1 && __retres1 <= 0)) || !(M_E == 2)) || !(t1_pc == 0)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && (((!(m_pc == 0) || !(2 <= m_st)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_i == 1))) && (((((((((!(m_pc == 0) || (0 <= __retres1 && __retres1 <= 0)) || !(M_E == 2)) || !(t1_pc == 0)) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || !(t1_i == 1)) || !(2 <= t1_st)) || 1 <= __retres1) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1)) && (((((((((((__retres1 <= 0 && 0 <= __retres1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || !(t1_i == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(local <= token)) || !(2 <= E_1))) && ((((((((((!(t1_pc == 1) || !(M_E == 2)) || !(token <= local + 1)) || !(local + 1 <= token)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || 1 <= __retres1) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(M_E == 2)) || !(t1_pc == 0)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(E_M == M_E)) || !(local <= token)) || !(2 <= E_1)) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((!(t1_i == 1) || (2 <= m_st && m_pc == 0)) || !(\old(m_pc) == 0)) || !(2 <= \old(m_st))) && (((((((((((((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || ((((((((2 <= m_st && t1_st == 0) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && t1_pc == 0) && local <= token)) || (((((((2 <= t1_st && t1_pc == 1) && E_1 == \old(E_1)) && E_M == M_E) && m_st == 0) && !(tmp == 0)) && m_pc == 0) && \old(token) == token)) || (((((((local == \old(local) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && E_M == M_E) && m_st == 0) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && \old(token) == token)) || !(t1_i == 1)) || !(\old(m_pc) == 0)) || ((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && E_M == M_E) && m_pc == 1) && 2 <= E_1) && m_st == 0) && !(tmp == 0))) || !(\old(t1_st) == 0)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token)) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1)))) && (((((((((((((((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(t1_i == 1)) || ((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && E_M == M_E) && m_pc == 1) && 2 <= E_1) && m_st == 0) && !(tmp == 0))) || !(\old(m_pc) == 1)) || ((((((((t1_pc == 1 && m_st == \old(m_st)) && E_1 == \old(E_1)) && t1_st == 0) && m_pc == \old(m_pc)) && token <= local) && local <= token) && E_M == \old(E_M)) && \old(token) == token)) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(2 <= \old(m_st))) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((((!(m_pc == 0) || 2 <= m_st) || !(t1_i == 1)) || !(2 <= \old(m_st))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || ((((2 <= t1_st && t1_pc == 1) && E_M == M_E) && m_st == 0) && \old(token) == token)) || !(2 <= E_1))) && ((((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && \old(token) == token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || (((((2 <= t1_st && t1_pc == 1) && \old(token) + 1 <= token) && E_M == M_E) && token <= \old(token) + 1) && m_st == 0)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((!(m_pc == 0) || ((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(t1_i == 1)) || !(2 <= \old(m_st))) && (((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((!(m_pc == 0) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || !(2 <= E_1))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || ((((m_st == \old(m_st) && t1_pc == 1) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: (((((((((!(\old(t1_st) == 0) || (((((((t1_st == 0 && M_E == 2) && 2 <= E_1) && m_st == 0) && t1_pc == 0) && m_pc == 0) && \old(token) == token) && E_M == \old(E_M))) || !(\old(m_st) == 0)) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || (2 <= m_st && m_pc == 0)) || !(\old(E_M) == \old(M_E))) || !(\old(m_pc) == 0)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && !(E_M == 1)) && token <= local) && M_E == 2) && m_pc == 1) && 2 <= E_1) && local <= token) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((!(t1_i == 1) || (2 <= m_st && m_pc == 0)) || !(\old(m_pc) == 0)) || !(2 <= \old(m_st))) && ((((((((((!(\old(m_pc) == 1) || !(\old(t1_st) == 0)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && ((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(\old(m_pc) == 0)) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (((((((((((tmp <= 0 && 1 <= __retres2) && 0 <= tmp) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) && (((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || !(\old(m_pc) == 0))) && ((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((local + 1 <= token && token <= local + 1) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token))) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) && ((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token)))) && ((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(E_M == M_E)) || !(\old(m_pc) == 0)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((!(t1_pc == 1) || !(M_E == 2)) || 1 <= __retres1) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(local <= token)) && ((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || 1 <= __retres1) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((((((((((!(m_pc == 0) || ((((E_M == M_E && m_st == 0) && t1_pc == 0) && \old(t1_st) == t1_st) && \old(token) == token)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || !(2 <= E_1)) && ((((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || ((((m_st == \old(m_st) && E_M == M_E) && t1_pc == 0) && \old(t1_st) == t1_st) && \old(token) == token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((!(m_pc == 0) || !(t1_i == 1)) || !(2 <= \old(m_st))) || (2 <= m_st && (t1_st == 0 || \old(t1_st) == t1_st)))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || (((((t1_pc == 1 && \old(token) + 1 <= token) && (t1_st == 0 || \old(t1_st) == t1_st)) && token <= \old(token) + 1) && E_M == M_E) && m_st == 0)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || (((((2 <= m_st && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(m_pc) == 0)) && (((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((2 <= m_st && t1_pc == 1) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(\old(m_pc) == 0))) && (((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((2 <= m_st && t1_pc == 1) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token))) - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 76]: Procedure Contract for transmit1 Derived contract for procedure transmit1: (((((!(m_pc == 0) || 2 <= m_st) || !(t1_i == 1)) || !(2 <= \old(m_st))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(t1_i == 1)) || ((((2 <= t1_st && t1_pc == 1) && E_M == M_E) && m_st == 0) && \old(token) == token)) || !(2 <= E_1))) && ((((((((((!(\old(token) <= local) || !(M_E == 2)) || !(M_E == \old(E_M))) || \old(t1_st) == 0) || !(\old(t1_pc) == 0)) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && \old(token) == token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(\old(token) <= local) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) || (((((2 <= t1_st && t1_pc == 1) && \old(token) + 1 <= token) && E_M == M_E) && token <= \old(token) + 1) && m_st == 0)) - ProcedureContractResult [Line: 303]: Procedure Contract for activate_threads Derived contract for procedure activate_threads: (((((((((((t1_st == 0 && m_st == 0) && 1 <= tmp) || ((m_st == 0 && \old(t1_st) == t1_st) && 1 <= tmp)) || ((((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)))) && ((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(t1_pc == 0)) || !(t1_i == 1)) || !(E_M == M_E)) || (((tmp <= 0 && 0 < tmp + 1) && m_st == 0) && \old(t1_st) == t1_st)) || !(2 <= E_1))) && (((((((((((!(t1_pc == 1) || !(2 <= \old(t1_st))) || E_M == 1) || (((2 <= m_st && t1_st == 0) && tmp <= 0) && 0 < tmp + 1)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(M_E == 1)) || !(local <= token)) || !(2 <= \old(m_st))) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(2 <= E_1))) && (((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(t1_pc == 0)) || !(token <= local)) || \old(m_st) == 0) || !(t1_i == 1)) || !(E_M == M_E)) || !(local <= token)) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st))) && ((((!(m_pc == 0) || (((2 <= m_st && t1_st == 0) && tmp <= 0) && 0 < tmp + 1)) || !(t1_i == 1)) || !(2 <= \old(m_st))) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st))) && ((((((((((2 <= m_st || !(t1_pc == 1)) || !(M_E == 2)) || !(2 <= \old(t1_st))) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(E_M == M_E)) || !(local <= token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((!(\old(t1_st) == 0) || !(t1_pc == 1)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(M_E == 1)) || !(local <= token)) || !(2 <= \old(m_st))) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(2 <= E_1))) && (((((((((((((!(M_E == 2) || ((((m_st == \old(m_st) && !(E_1 == 1)) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(t1_i == 1)) || !(m_pc == 1)) || !(local <= token)) || (((!(E_1 == 1) && t1_st == 0) && tmp <= 0) && 0 < tmp + 1)) || !(t1_pc == 1)) || ((!(E_1 == 1) && t1_st == 0) && m_st == 0)) || !(2 <= \old(t1_st))) || !(token <= local)) || ((t1_st == 0 && m_st == 0) && 1 <= tmp___0)) || \old(m_st) == 0) || (((t1_st == 0 && tmp <= 0) && 1 <= tmp___0) && 0 < tmp + 1)) || !(E_M == M_E))) && (((((((((((!(m_pc == 0) || ((((!(E_1 == 1) && t1_st == 0) && tmp <= 0) && 0 < tmp + 1) && !(m_st == 0))) || !(t1_pc == 1)) || !(M_E == 2)) || ((((m_st == \old(m_st) && !(E_1 == 1)) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) || !(2 <= \old(t1_st))) || !(token <= local)) || \old(m_st) == 0) || !(t1_i == 1)) || !(E_M == M_E)) || !(local <= token)) || ((((t1_st == 0 && tmp <= 0) && 1 <= tmp___0) && 0 < tmp + 1) && !(m_st == 0))) - ProcedureContractResult [Line: 328]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify: ((((((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(t1_pc == 0)) || !(token <= local)) || \old(m_st) == 0) || !(t1_i == 1)) || (m_st == \old(m_st) && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(local <= token)) && ((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || !(2 <= \old(t1_st))) || !(token <= local)) || ((m_st == \old(m_st) && !(E_1 == 1)) && \old(t1_st) == t1_st)) || \old(m_st) == 0) || (t1_st == 0 && !(m_st == 0))) || !(t1_i == 1)) || !(E_M == M_E)) || !(local <= token))) && (((t1_st == 0 && m_st == 0) || (m_st == 0 && \old(t1_st) == t1_st)) || ((((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(local + 1 <= token)) || \old(t1_st) == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1))))) && ((((!(m_pc == 0) || (2 <= m_st && t1_st == 0)) || !(t1_i == 1)) || (m_st == \old(m_st) && \old(t1_st) == t1_st)) || !(2 <= \old(m_st)))) && ((((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || t1_st == 0) || !(token <= local)) || ((m_st == \old(m_st) && !(E_1 == 1)) && \old(t1_st) == t1_st)) || \old(m_st) == 0) || !(t1_i == 1)) || !(m_pc == 1)) || !(E_M == M_E)) || !(local <= token)) - ProcedureContractResult [Line: 176]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread: ((((((((((((((!(2 <= m_st) || !(M_E == 2)) || !(t1_pc == 0)) || !(token <= local)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(local <= token)) || !(2 <= E_1)) && ((((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && 0 <= __retres1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1))) && ((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1)) - ProcedureContractResult [Line: 131]: Procedure Contract for is_transmit1_triggered Derived contract for procedure is_transmit1_triggered: (((((((((!(t1_pc == 1) || !(M_E == 2)) || (1 <= __retres1 && 1 <= \result)) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(E_M == M_E)) || !(local <= token)) && ((((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || (1 <= __retres1 && 1 <= \result)) || !(E_1 == 1)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) - ProcedureContractResult [Line: 275]: Procedure Contract for reset_delta_events Derived contract for procedure reset_delta_events: ((((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(m_pc == 1)) || !(\old(E_M) == \old(M_E))) || !(t1_st == 0)) || !(local <= token)) || ((E_1 == \old(E_1) && E_M == M_E) && M_E == 2)) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local)) || ((E_1 == \old(E_1) && M_E == \old(M_E)) && E_M == \old(E_M))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(m_pc == 1)) || !(2 <= t1_st)) || !(\old(E_M) == \old(M_E))) || !(local <= token))) && ((((!(m_pc == 0) || !(2 <= m_st)) || !(t1_i == 1)) || !(2 == \old(M_E))) || M_E == 2)) && ((((((((!(m_pc == 0) || !(t1_pc == 0)) || ((E_1 == \old(E_1) && M_E == \old(M_E)) && E_M == \old(E_M))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(\old(E_M) == \old(M_E))) || !(t1_st == 0)) || !(m_st == 0)) - ProcedureContractResult [Line: 158]: Procedure Contract for init_threads Derived contract for procedure init_threads: ((((((((!(m_pc == 0) || !(\old(t1_st) == 0)) || !(M_E == 2)) || !(\old(m_st) == 0)) || !(t1_pc == 0)) || !(t1_i == 1)) || (m_st == 0 && \old(t1_st) == t1_st)) || (2 <= m_st && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(2 <= E_1) - ProcedureContractResult [Line: 464]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for error Derived contract for procedure error: 1 - ProcedureContractResult [Line: 32]: Procedure Contract for master Derived contract for procedure master: (((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || !(t1_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(E_M == M_E)) || (((((2 <= m_st && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(\old(m_pc) == 0)) && (((((((((!(t1_pc == 1) || !(M_E == 2)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((2 <= m_st && t1_pc == 1) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(\old(m_pc) == 0))) && (((((((((((!(\old(m_pc) == 1) || !(t1_pc == 1)) || !(M_E == 2)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || \old(m_st) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || ((((((((2 <= m_st && t1_pc == 1) && t1_st == 0) && token <= local) && M_E == 2) && m_pc == 1) && t1_i == 1) && 2 <= E_1) && local <= token)) || ((((((2 <= m_st && t1_pc == 1) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token) && \old(t1_st) == t1_st)) || !(E_M == M_E)) || !(\old(local) + 1 <= \old(token))) - ProcedureContractResult [Line: 339]: Procedure Contract for fire_time_events Derived contract for procedure fire_time_events: (((((((((!(2 <= m_st) || !(t1_pc == 1)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || M_E == 1) || !(2 <= E_1)) && (((((((((!(2 <= m_st) || !(t1_pc == 1)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(local <= token)) || M_E == 1) || !(2 <= E_1)) - ProcedureContractResult [Line: 196]: Procedure Contract for eval Derived contract for procedure eval: ((((!(t1_i == 1) || (2 <= m_st && m_pc == 0)) || !(\old(m_pc) == 0)) || !(2 <= \old(m_st))) && ((((((((((!(\old(m_pc) == 1) || !(\old(t1_st) == 0)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || \old(E_M) == 1) || !(M_E == 2)) || !(\old(t1_pc) == 1)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st)))) && ((((((((!(\old(t1_st) == 0) || !(M_E == 2)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == M_E) && token <= local) && m_pc == 1) && 2 <= E_1) && local <= token)) || !(\old(m_st) == 0)) || !(M_E == \old(E_M))) || !(\old(t1_pc) == 0)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(\old(m_pc) == 0)) - ProcedureContractResult [Line: 386]: Procedure Contract for stop_simulation Derived contract for procedure stop_simulation: (((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(M_E == 2)) || E_M == 1) || !(token <= local)) || (((tmp <= 0 && 1 <= \result) && 1 <= __retres2) && 0 <= tmp)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(2 <= E_1) - ProcedureContractResult [Line: 150]: Procedure Contract for update_channels Derived contract for procedure update_channels: 1 - ProcedureContractResult [Line: 247]: Procedure Contract for fire_delta_events Derived contract for procedure fire_delta_events: (((((((((((!(2 <= m_st) || !(t1_pc == 1)) || ((E_1 == \old(E_1) && E_M == M_E) && M_E == \old(M_E))) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(m_pc == 1)) || !(2 <= t1_st)) || !(\old(E_M) == \old(M_E))) || !(local <= token)) && ((((!(m_pc == 0) || !(2 <= m_st)) || !(t1_i == 1)) || !(2 == \old(M_E))) || M_E == 2)) && ((((((((!(m_pc == 0) || !(t1_pc == 0)) || ((E_1 == \old(E_1) && M_E == \old(M_E)) && E_M == \old(E_M))) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 == \old(M_E))) || !(\old(E_M) == \old(M_E))) || !(t1_st == 0)) || !(m_st == 0)) - ProcedureContractResult [Line: 405]: Procedure Contract for start_simulation Derived contract for procedure start_simulation: 1 - ProcedureContractResult [Line: 112]: Procedure Contract for is_master_triggered Derived contract for procedure is_master_triggered: ((((((((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1)) && ((((((((((!(2 <= m_st) || !(t1_pc == 1)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(M_E == 1)) || !(local <= token)) || !(2 <= E_1))) && (((!(m_pc == 0) || !(2 <= m_st)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(t1_i == 1))) && (((((((((!(t1_pc == 1) || !(M_E == 2)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && (((((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= E_1)) && (((((((((!(t1_pc == 1) || !(token <= local + 1)) || !(M_E == 2)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(m_pc == 1)) || !(m_st == 0)) || !(2 <= E_1))) || (1 <= \result && 1 <= __retres1))) && ((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(t1_i == 1)) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || m_st == 0) || !(E_M == M_E)) || !(local <= token))) && (((((((((!(m_pc == 0) || !(t1_pc == 1)) || !(M_E == 2)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || m_st == 0) || !(E_M == M_E)) || !(local <= token)) - ProcedureContractResult [Line: 348]: Procedure Contract for reset_time_events Derived contract for procedure reset_time_events: ((((((((((((E_1 == \old(E_1) && M_E == 2) && E_M == \old(E_M)) || !(2 <= m_st)) || \old(E_M) == 1) || !(t1_pc == 1)) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(m_pc == 1)) || !(2 <= t1_st)) || !(local <= token)) || !(\old(M_E) == 1)) && ((((((((((((E_1 == \old(E_1) && M_E == 2) && E_M == \old(E_M)) || !(2 <= m_st)) || \old(E_M) == 1) || !(t1_pc == 1)) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(m_pc == 1)) || !(t1_st == 0)) || !(local <= token)) || !(\old(M_E) == 1)) - ProcedureContractResult [Line: 376]: Procedure Contract for init_model Derived contract for procedure init_model: (((((((!(m_pc == 0) || !(M_E == 2)) || !(t1_pc == 0)) || t1_i == 1) || !(t1_st == 0)) || !(E_M == M_E)) || !(m_st == 0)) || !(2 <= E_1)) || \old(t1_i) == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 230 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 104.4s, OverallIterations: 16, TraceHistogramMax: 8, AutomataDifference: 85.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 173.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4485 SDtfs, 25968 SDslu, 2704 SDs, 0 SdLazy, 30712 SolverSat, 9201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1761 GetRequests, 1107 SyntacticMatches, 2 SemanticMatches, 652 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10451 ImplicationChecksByTransitivity, 22.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6221occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 9419 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 230 LocationsWithAnnotation, 42878 PreInvPairs, 45429 NumberOfFragments, 33090 HoareAnnotationTreeSize, 42878 FomulaSimplifications, 7361043788 FormulaSimplificationTreeSizeReduction, 39.7s HoareSimplificationTime, 230 FomulaSimplificationsInter, 3334021 FormulaSimplificationTreeSizeReductionInter, 132.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 4648 NumberOfCodeBlocks, 4648 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4632 ConstructedInterpolants, 0 QuantifiedInterpolants, 2989738 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 3701/3844 InterpolantCoveringCapability, 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...