/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --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.1.25-72570d3 [2020-08-22 23:15:45,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 23:15:45,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 23:15:45,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 23:15:45,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 23:15:45,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 23:15:45,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 23:15:45,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 23:15:45,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 23:15:45,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 23:15:45,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 23:15:45,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 23:15:45,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 23:15:45,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 23:15:45,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 23:15:45,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 23:15:45,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 23:15:45,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 23:15:45,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 23:15:45,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 23:15:45,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 23:15:45,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 23:15:45,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 23:15:45,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 23:15:45,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 23:15:45,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 23:15:45,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 23:15:45,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 23:15:45,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 23:15:45,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 23:15:45,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 23:15:45,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 23:15:45,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 23:15:45,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 23:15:45,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 23:15:45,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 23:15:45,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 23:15:45,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 23:15:45,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 23:15:45,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 23:15:45,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 23:15:45,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 23:15:45,729 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 23:15:45,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 23:15:45,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 23:15:45,731 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 23:15:45,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 23:15:45,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 23:15:45,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 23:15:45,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 23:15:45,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 23:15:45,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 23:15:45,734 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 23:15:45,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 23:15:45,734 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 23:15:45,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 23:15:45,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 23:15:45,735 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 23:15:45,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 23:15:45,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 23:15:45,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 23:15:45,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 23:15:45,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 23:15:45,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 23:15:45,737 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08-22 23:15:46,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 23:15:46,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 23:15:46,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 23:15:46,079 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 23:15:46,079 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 23:15:46,080 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-08-22 23:15:46,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ce70fdf/b1f2196b199c4b5c94ed7b09a2529ca0/FLAG4d10531c9 [2020-08-22 23:15:46,607 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 23:15:46,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-08-22 23:15:46,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ce70fdf/b1f2196b199c4b5c94ed7b09a2529ca0/FLAG4d10531c9 [2020-08-22 23:15:46,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ce70fdf/b1f2196b199c4b5c94ed7b09a2529ca0 [2020-08-22 23:15:46,986 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 23:15:46,988 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 23:15:46,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 23:15:46,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 23:15:46,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 23:15:46,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 11:15:46" (1/1) ... [2020-08-22 23:15:47,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639ec9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:47, skipping insertion in model container [2020-08-22 23:15:47,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 11:15:46" (1/1) ... [2020-08-22 23:15:47,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 23:15:47,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 23:15:47,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 23:15:47,275 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 23:15:47,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 23:15:47,436 INFO L208 MainTranslator]: Completed translation [2020-08-22 23:15:47,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:47 WrapperNode [2020-08-22 23:15:47,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 23:15:47,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 23:15:47,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 23:15:47,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 23:15:47,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:47" (1/1) ... [2020-08-22 23:15:47,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:47" (1/1) ... [2020-08-22 23:15:47,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:47" (1/1) ... [2020-08-22 23:15:47,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:47" (1/1) ... [2020-08-22 23:15:47,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:47" (1/1) ... [2020-08-22 23:15:47,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:47" (1/1) ... [2020-08-22 23:15:47,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:47" (1/1) ... [2020-08-22 23:15:47,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 23:15:47,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 23:15:47,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 23:15:47,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 23:15:47,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:47" (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-08-22 23:15:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 23:15:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 23:15:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-08-22 23:15:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-08-22 23:15:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-08-22 23:15:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-08-22 23:15:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-08-22 23:15:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-08-22 23:15:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-08-22 23:15:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-08-22 23:15:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-08-22 23:15:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-08-22 23:15:47,552 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-08-22 23:15:47,552 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-08-22 23:15:47,552 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-08-22 23:15:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-08-22 23:15:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-08-22 23:15:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-08-22 23:15:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-08-22 23:15:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-08-22 23:15:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 23:15:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 23:15:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-08-22 23:15:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-08-22 23:15:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-08-22 23:15:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-08-22 23:15:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 23:15:47,555 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-08-22 23:15:47,555 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-08-22 23:15:47,555 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-08-22 23:15:47,555 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-08-22 23:15:47,555 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-08-22 23:15:47,556 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-08-22 23:15:47,556 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-08-22 23:15:47,557 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-08-22 23:15:47,557 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-08-22 23:15:47,557 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-08-22 23:15:47,557 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-08-22 23:15:47,557 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-08-22 23:15:47,557 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-08-22 23:15:47,557 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-08-22 23:15:47,558 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 23:15:47,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 23:15:47,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 23:15:48,140 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 23:15:48,140 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-08-22 23:15:48,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 11:15:48 BoogieIcfgContainer [2020-08-22 23:15:48,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 23:15:48,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 23:15:48,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 23:15:48,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 23:15:48,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 11:15:46" (1/3) ... [2020-08-22 23:15:48,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa3c2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 11:15:48, skipping insertion in model container [2020-08-22 23:15:48,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:47" (2/3) ... [2020-08-22 23:15:48,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa3c2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 11:15:48, skipping insertion in model container [2020-08-22 23:15:48,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 11:15:48" (3/3) ... [2020-08-22 23:15:48,160 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-08-22 23:15:48,170 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 23:15:48,179 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 23:15:48,194 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 23:15:48,217 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 23:15:48,217 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 23:15:48,218 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 23:15:48,218 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 23:15:48,218 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 23:15:48,218 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 23:15:48,218 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 23:15:48,218 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 23:15:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states. [2020-08-22 23:15:48,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-08-22 23:15:48,266 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:15:48,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:15:48,270 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:15:48,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:15:48,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1066956110, now seen corresponding path program 1 times [2020-08-22 23:15:48,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:15:48,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1857439789] [2020-08-22 23:15:48,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:15:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:48,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:48,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:15:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:48,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:15:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:48,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:15:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:48,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:15:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:48,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:15:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:48,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:48,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:15:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:48,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:15:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:48,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:15:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 23:15:48,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1857439789] [2020-08-22 23:15:48,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:15:48,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 23:15:48,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764260860] [2020-08-22 23:15:48,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 23:15:48,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:15:48,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 23:15:48,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 23:15:48,916 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 7 states. [2020-08-22 23:15:51,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:15:51,145 INFO L93 Difference]: Finished difference Result 774 states and 1050 transitions. [2020-08-22 23:15:51,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-22 23:15:51,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2020-08-22 23:15:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:15:51,181 INFO L225 Difference]: With dead ends: 774 [2020-08-22 23:15:51,181 INFO L226 Difference]: Without dead ends: 573 [2020-08-22 23:15:51,188 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-08-22 23:15:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-08-22 23:15:51,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 419. [2020-08-22 23:15:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-08-22 23:15:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 521 transitions. [2020-08-22 23:15:51,345 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 521 transitions. Word has length 107 [2020-08-22 23:15:51,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:15:51,347 INFO L479 AbstractCegarLoop]: Abstraction has 419 states and 521 transitions. [2020-08-22 23:15:51,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 23:15:51,347 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 521 transitions. [2020-08-22 23:15:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-08-22 23:15:51,355 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:15:51,355 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:15:51,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 23:15:51,356 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:15:51,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:15:51,356 INFO L82 PathProgramCache]: Analyzing trace with hash -517401199, now seen corresponding path program 1 times [2020-08-22 23:15:51,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:15:51,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [304678396] [2020-08-22 23:15:51,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:15:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:15:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:15:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:15:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:15:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:15:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:15:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:15:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:15:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:15:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 23:15:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:15:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-08-22 23:15:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-08-22 23:15:51,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [304678396] [2020-08-22 23:15:51,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:15:51,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 23:15:51,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749227458] [2020-08-22 23:15:51,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 23:15:51,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:15:51,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 23:15:51,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-08-22 23:15:51,773 INFO L87 Difference]: Start difference. First operand 419 states and 521 transitions. Second operand 9 states. [2020-08-22 23:15:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:15:55,017 INFO L93 Difference]: Finished difference Result 1504 states and 2005 transitions. [2020-08-22 23:15:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 23:15:55,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2020-08-22 23:15:55,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:15:55,029 INFO L225 Difference]: With dead ends: 1504 [2020-08-22 23:15:55,029 INFO L226 Difference]: Without dead ends: 1125 [2020-08-22 23:15:55,034 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2020-08-22 23:15:55,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2020-08-22 23:15:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 835. [2020-08-22 23:15:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2020-08-22 23:15:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1076 transitions. [2020-08-22 23:15:55,173 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1076 transitions. Word has length 170 [2020-08-22 23:15:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:15:55,174 INFO L479 AbstractCegarLoop]: Abstraction has 835 states and 1076 transitions. [2020-08-22 23:15:55,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 23:15:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1076 transitions. [2020-08-22 23:15:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-08-22 23:15:55,182 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:15:55,183 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:15:55,183 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 23:15:55,183 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:15:55,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:15:55,184 INFO L82 PathProgramCache]: Analyzing trace with hash 878280969, now seen corresponding path program 1 times [2020-08-22 23:15:55,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:15:55,184 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [398929652] [2020-08-22 23:15:55,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:15:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:15:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:15:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:15:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:15:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:15:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:15:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:15:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:15:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-08-22 23:15:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:15:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:15:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-08-22 23:15:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-08-22 23:15:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 23:15:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:15:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2020-08-22 23:15:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:15:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:15:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2020-08-22 23:15:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2020-08-22 23:15:55,605 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [398929652] [2020-08-22 23:15:55,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:15:55,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 23:15:55,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838457861] [2020-08-22 23:15:55,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 23:15:55,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:15:55,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 23:15:55,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:15:55,608 INFO L87 Difference]: Start difference. First operand 835 states and 1076 transitions. Second operand 10 states. [2020-08-22 23:15:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:15:57,463 INFO L93 Difference]: Finished difference Result 1955 states and 2544 transitions. [2020-08-22 23:15:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 23:15:57,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 283 [2020-08-22 23:15:57,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:15:57,478 INFO L225 Difference]: With dead ends: 1955 [2020-08-22 23:15:57,479 INFO L226 Difference]: Without dead ends: 1158 [2020-08-22 23:15:57,493 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2020-08-22 23:15:57,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2020-08-22 23:15:57,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 826. [2020-08-22 23:15:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2020-08-22 23:15:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1061 transitions. [2020-08-22 23:15:57,634 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1061 transitions. Word has length 283 [2020-08-22 23:15:57,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:15:57,634 INFO L479 AbstractCegarLoop]: Abstraction has 826 states and 1061 transitions. [2020-08-22 23:15:57,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 23:15:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1061 transitions. [2020-08-22 23:15:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-08-22 23:15:57,642 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:15:57,643 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:15:57,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 23:15:57,644 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:15:57,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:15:57,644 INFO L82 PathProgramCache]: Analyzing trace with hash 214480794, now seen corresponding path program 1 times [2020-08-22 23:15:57,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:15:57,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1354564332] [2020-08-22 23:15:57,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:15:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:15:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:15:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:15:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:15:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:15:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:15:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:15:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:15:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:15:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 23:15:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:15:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-08-22 23:15:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:15:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:15:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-08-22 23:15:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 29 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-08-22 23:15:58,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1354564332] [2020-08-22 23:15:58,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:15:58,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 23:15:58,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614398047] [2020-08-22 23:15:58,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 23:15:58,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:15:58,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 23:15:58,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-08-22 23:15:58,009 INFO L87 Difference]: Start difference. First operand 826 states and 1061 transitions. Second operand 12 states. [2020-08-22 23:16:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:00,365 INFO L93 Difference]: Finished difference Result 1962 states and 2598 transitions. [2020-08-22 23:16:00,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-22 23:16:00,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 220 [2020-08-22 23:16:00,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:00,377 INFO L225 Difference]: With dead ends: 1962 [2020-08-22 23:16:00,377 INFO L226 Difference]: Without dead ends: 941 [2020-08-22 23:16:00,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2020-08-22 23:16:00,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2020-08-22 23:16:00,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 679. [2020-08-22 23:16:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2020-08-22 23:16:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 841 transitions. [2020-08-22 23:16:00,545 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 841 transitions. Word has length 220 [2020-08-22 23:16:00,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:00,547 INFO L479 AbstractCegarLoop]: Abstraction has 679 states and 841 transitions. [2020-08-22 23:16:00,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 23:16:00,547 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 841 transitions. [2020-08-22 23:16:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-08-22 23:16:00,553 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:00,553 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:00,554 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 23:16:00,554 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:00,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:00,554 INFO L82 PathProgramCache]: Analyzing trace with hash 144736441, now seen corresponding path program 2 times [2020-08-22 23:16:00,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:00,555 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2044815069] [2020-08-22 23:16:00,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:16:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:16:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 23:16:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-08-22 23:16:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:16:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-08-22 23:16:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-08-22 23:16:00,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2044815069] [2020-08-22 23:16:00,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:16:00,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 23:16:00,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885069152] [2020-08-22 23:16:00,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 23:16:00,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:00,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 23:16:00,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:16:00,880 INFO L87 Difference]: Start difference. First operand 679 states and 841 transitions. Second operand 10 states. [2020-08-22 23:16:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:03,733 INFO L93 Difference]: Finished difference Result 2297 states and 3039 transitions. [2020-08-22 23:16:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 23:16:03,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 219 [2020-08-22 23:16:03,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:03,747 INFO L225 Difference]: With dead ends: 2297 [2020-08-22 23:16:03,747 INFO L226 Difference]: Without dead ends: 1656 [2020-08-22 23:16:03,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2020-08-22 23:16:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2020-08-22 23:16:03,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1256. [2020-08-22 23:16:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2020-08-22 23:16:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1532 transitions. [2020-08-22 23:16:03,945 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1532 transitions. Word has length 219 [2020-08-22 23:16:03,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:03,946 INFO L479 AbstractCegarLoop]: Abstraction has 1256 states and 1532 transitions. [2020-08-22 23:16:03,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 23:16:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1532 transitions. [2020-08-22 23:16:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-08-22 23:16:03,953 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:03,953 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:03,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 23:16:03,954 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:03,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:03,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2140706519, now seen corresponding path program 1 times [2020-08-22 23:16:03,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:03,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1366303183] [2020-08-22 23:16:03,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:16:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 23:16:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-08-22 23:16:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-08-22 23:16:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 23:16:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-08-22 23:16:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:16:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2020-08-22 23:16:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2020-08-22 23:16:04,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1366303183] [2020-08-22 23:16:04,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:16:04,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-22 23:16:04,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7964021] [2020-08-22 23:16:04,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 23:16:04,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:04,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 23:16:04,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-08-22 23:16:04,212 INFO L87 Difference]: Start difference. First operand 1256 states and 1532 transitions. Second operand 9 states. [2020-08-22 23:16:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:06,486 INFO L93 Difference]: Finished difference Result 2884 states and 3650 transitions. [2020-08-22 23:16:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 23:16:06,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 248 [2020-08-22 23:16:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:06,497 INFO L225 Difference]: With dead ends: 2884 [2020-08-22 23:16:06,497 INFO L226 Difference]: Without dead ends: 1667 [2020-08-22 23:16:06,503 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2020-08-22 23:16:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2020-08-22 23:16:06,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1256. [2020-08-22 23:16:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2020-08-22 23:16:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1520 transitions. [2020-08-22 23:16:06,694 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1520 transitions. Word has length 248 [2020-08-22 23:16:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:06,694 INFO L479 AbstractCegarLoop]: Abstraction has 1256 states and 1520 transitions. [2020-08-22 23:16:06,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 23:16:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1520 transitions. [2020-08-22 23:16:06,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-08-22 23:16:06,700 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:06,701 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:06,701 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 23:16:06,701 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:06,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:06,702 INFO L82 PathProgramCache]: Analyzing trace with hash -469744976, now seen corresponding path program 1 times [2020-08-22 23:16:06,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:06,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [954467056] [2020-08-22 23:16:06,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:16:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:16:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 23:16:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-08-22 23:16:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-08-22 23:16:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-08-22 23:16:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:16:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:06,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2020-08-22 23:16:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-08-22 23:16:07,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [954467056] [2020-08-22 23:16:07,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:16:07,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 23:16:07,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510665575] [2020-08-22 23:16:07,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 23:16:07,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:07,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 23:16:07,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:16:07,011 INFO L87 Difference]: Start difference. First operand 1256 states and 1520 transitions. Second operand 10 states. [2020-08-22 23:16:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:10,193 INFO L93 Difference]: Finished difference Result 4318 states and 5461 transitions. [2020-08-22 23:16:10,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-08-22 23:16:10,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 248 [2020-08-22 23:16:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:10,219 INFO L225 Difference]: With dead ends: 4318 [2020-08-22 23:16:10,219 INFO L226 Difference]: Without dead ends: 3101 [2020-08-22 23:16:10,227 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=816, Unknown=0, NotChecked=0, Total=1056 [2020-08-22 23:16:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2020-08-22 23:16:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 2364. [2020-08-22 23:16:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2020-08-22 23:16:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 2885 transitions. [2020-08-22 23:16:10,565 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 2885 transitions. Word has length 248 [2020-08-22 23:16:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:10,565 INFO L479 AbstractCegarLoop]: Abstraction has 2364 states and 2885 transitions. [2020-08-22 23:16:10,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 23:16:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 2885 transitions. [2020-08-22 23:16:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-08-22 23:16:10,582 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:10,582 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:10,583 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 23:16:10,583 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:10,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:10,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1876608160, now seen corresponding path program 1 times [2020-08-22 23:16:10,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:10,585 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [494070050] [2020-08-22 23:16:10,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:16:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 23:16:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-08-22 23:16:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-08-22 23:16:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 23:16:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2020-08-22 23:16:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:16:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2020-08-22 23:16:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:10,970 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-08-22 23:16:10,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [494070050] [2020-08-22 23:16:10,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:16:10,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-22 23:16:10,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518524657] [2020-08-22 23:16:10,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 23:16:10,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:10,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 23:16:10,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-08-22 23:16:10,973 INFO L87 Difference]: Start difference. First operand 2364 states and 2885 transitions. Second operand 14 states. [2020-08-22 23:16:14,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:14,981 INFO L93 Difference]: Finished difference Result 5265 states and 6747 transitions. [2020-08-22 23:16:14,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-22 23:16:14,981 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 254 [2020-08-22 23:16:14,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:14,996 INFO L225 Difference]: With dead ends: 5265 [2020-08-22 23:16:14,997 INFO L226 Difference]: Without dead ends: 2941 [2020-08-22 23:16:15,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=442, Invalid=1628, Unknown=0, NotChecked=0, Total=2070 [2020-08-22 23:16:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-08-22 23:16:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2370. [2020-08-22 23:16:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2020-08-22 23:16:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 2841 transitions. [2020-08-22 23:16:15,277 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 2841 transitions. Word has length 254 [2020-08-22 23:16:15,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:15,278 INFO L479 AbstractCegarLoop]: Abstraction has 2370 states and 2841 transitions. [2020-08-22 23:16:15,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 23:16:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 2841 transitions. [2020-08-22 23:16:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-08-22 23:16:15,287 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:15,287 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:15,288 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 23:16:15,288 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:15,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:15,288 INFO L82 PathProgramCache]: Analyzing trace with hash 405313859, now seen corresponding path program 1 times [2020-08-22 23:16:15,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:15,289 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [341055443] [2020-08-22 23:16:15,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:16:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 23:16:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-08-22 23:16:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-08-22 23:16:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 23:16:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2020-08-22 23:16:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:16:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2020-08-22 23:16:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-08-22 23:16:15,656 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [341055443] [2020-08-22 23:16:15,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:16:15,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 23:16:15,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169599425] [2020-08-22 23:16:15,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 23:16:15,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:15,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 23:16:15,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-08-22 23:16:15,664 INFO L87 Difference]: Start difference. First operand 2370 states and 2841 transitions. Second operand 12 states. [2020-08-22 23:16:20,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:20,656 INFO L93 Difference]: Finished difference Result 7778 states and 9559 transitions. [2020-08-22 23:16:20,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-08-22 23:16:20,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 254 [2020-08-22 23:16:20,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:20,700 INFO L225 Difference]: With dead ends: 7778 [2020-08-22 23:16:20,701 INFO L226 Difference]: Without dead ends: 5452 [2020-08-22 23:16:20,713 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=332, Invalid=1308, Unknown=0, NotChecked=0, Total=1640 [2020-08-22 23:16:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2020-08-22 23:16:21,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4339. [2020-08-22 23:16:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4339 states. [2020-08-22 23:16:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 5251 transitions. [2020-08-22 23:16:21,993 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 5251 transitions. Word has length 254 [2020-08-22 23:16:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:21,998 INFO L479 AbstractCegarLoop]: Abstraction has 4339 states and 5251 transitions. [2020-08-22 23:16:21,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 23:16:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 5251 transitions. [2020-08-22 23:16:22,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2020-08-22 23:16:22,012 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:22,013 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:22,013 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 23:16:22,014 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:22,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1642237702, now seen corresponding path program 1 times [2020-08-22 23:16:22,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:22,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [222464487] [2020-08-22 23:16:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 23:16:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 23:16:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 23:16:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-08-22 23:16:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-08-22 23:16:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2020-08-22 23:16:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-08-22 23:16:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2020-08-22 23:16:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2020-08-22 23:16:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-08-22 23:16:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2020-08-22 23:16:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2020-08-22 23:16:22,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [222464487] [2020-08-22 23:16:22,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:16:22,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 23:16:22,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647955228] [2020-08-22 23:16:22,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 23:16:22,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:22,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 23:16:22,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:16:22,638 INFO L87 Difference]: Start difference. First operand 4339 states and 5251 transitions. Second operand 10 states. [2020-08-22 23:16:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:26,486 INFO L93 Difference]: Finished difference Result 9119 states and 11220 transitions. [2020-08-22 23:16:26,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-22 23:16:26,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 270 [2020-08-22 23:16:26,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:26,510 INFO L225 Difference]: With dead ends: 9119 [2020-08-22 23:16:26,511 INFO L226 Difference]: Without dead ends: 5371 [2020-08-22 23:16:26,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2020-08-22 23:16:26,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5371 states. [2020-08-22 23:16:27,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5371 to 4359. [2020-08-22 23:16:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4359 states. [2020-08-22 23:16:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 5213 transitions. [2020-08-22 23:16:27,238 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 5213 transitions. Word has length 270 [2020-08-22 23:16:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:27,238 INFO L479 AbstractCegarLoop]: Abstraction has 4359 states and 5213 transitions. [2020-08-22 23:16:27,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 23:16:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 5213 transitions. [2020-08-22 23:16:27,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2020-08-22 23:16:27,247 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:27,247 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:27,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 23:16:27,248 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:27,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:27,248 INFO L82 PathProgramCache]: Analyzing trace with hash -957347782, now seen corresponding path program 1 times [2020-08-22 23:16:27,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:27,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [690755008] [2020-08-22 23:16:27,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 23:16:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 23:16:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 23:16:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-08-22 23:16:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-08-22 23:16:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2020-08-22 23:16:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-08-22 23:16:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2020-08-22 23:16:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2020-08-22 23:16:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2020-08-22 23:16:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2020-08-22 23:16:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-08-22 23:16:27,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [690755008] [2020-08-22 23:16:27,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:16:27,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 23:16:27,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409521889] [2020-08-22 23:16:27,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 23:16:27,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:27,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 23:16:27,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:16:27,497 INFO L87 Difference]: Start difference. First operand 4359 states and 5213 transitions. Second operand 10 states. [2020-08-22 23:16:29,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:29,485 INFO L93 Difference]: Finished difference Result 8953 states and 10781 transitions. [2020-08-22 23:16:29,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 23:16:29,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 270 [2020-08-22 23:16:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:29,511 INFO L225 Difference]: With dead ends: 8953 [2020-08-22 23:16:29,512 INFO L226 Difference]: Without dead ends: 4631 [2020-08-22 23:16:29,525 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2020-08-22 23:16:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2020-08-22 23:16:30,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 3789. [2020-08-22 23:16:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3789 states. [2020-08-22 23:16:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3789 states to 3789 states and 4529 transitions. [2020-08-22 23:16:30,163 INFO L78 Accepts]: Start accepts. Automaton has 3789 states and 4529 transitions. Word has length 270 [2020-08-22 23:16:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:30,164 INFO L479 AbstractCegarLoop]: Abstraction has 3789 states and 4529 transitions. [2020-08-22 23:16:30,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 23:16:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3789 states and 4529 transitions. [2020-08-22 23:16:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2020-08-22 23:16:30,170 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:30,170 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:30,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 23:16:30,171 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:30,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:30,171 INFO L82 PathProgramCache]: Analyzing trace with hash 353572077, now seen corresponding path program 1 times [2020-08-22 23:16:30,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:30,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1649750640] [2020-08-22 23:16:30,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 23:16:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 23:16:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 23:16:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 23:16:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-08-22 23:16:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2020-08-22 23:16:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2020-08-22 23:16:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2020-08-22 23:16:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2020-08-22 23:16:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2020-08-22 23:16:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2020-08-22 23:16:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-08-22 23:16:30,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1649750640] [2020-08-22 23:16:30,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:16:30,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 23:16:30,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510584340] [2020-08-22 23:16:30,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 23:16:30,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:30,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 23:16:30,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-08-22 23:16:30,446 INFO L87 Difference]: Start difference. First operand 3789 states and 4529 transitions. Second operand 12 states. [2020-08-22 23:16:32,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:32,647 INFO L93 Difference]: Finished difference Result 7142 states and 8522 transitions. [2020-08-22 23:16:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-22 23:16:32,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 275 [2020-08-22 23:16:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:32,664 INFO L225 Difference]: With dead ends: 7142 [2020-08-22 23:16:32,664 INFO L226 Difference]: Without dead ends: 3391 [2020-08-22 23:16:32,678 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2020-08-22 23:16:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2020-08-22 23:16:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 2619. [2020-08-22 23:16:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2619 states. [2020-08-22 23:16:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 3026 transitions. [2020-08-22 23:16:33,028 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 3026 transitions. Word has length 275 [2020-08-22 23:16:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:33,028 INFO L479 AbstractCegarLoop]: Abstraction has 2619 states and 3026 transitions. [2020-08-22 23:16:33,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 23:16:33,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3026 transitions. [2020-08-22 23:16:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2020-08-22 23:16:33,032 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:33,033 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:33,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 23:16:33,033 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:33,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1238866457, now seen corresponding path program 1 times [2020-08-22 23:16:33,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:33,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1557793312] [2020-08-22 23:16:33,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 23:16:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 23:16:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 23:16:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 23:16:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-08-22 23:16:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-08-22 23:16:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-08-22 23:16:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2020-08-22 23:16:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2020-08-22 23:16:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-08-22 23:16:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2020-08-22 23:16:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2020-08-22 23:16:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-08-22 23:16:33,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1557793312] [2020-08-22 23:16:33,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:16:33,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-22 23:16:33,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278386275] [2020-08-22 23:16:33,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 23:16:33,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:33,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 23:16:33,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-08-22 23:16:33,369 INFO L87 Difference]: Start difference. First operand 2619 states and 3026 transitions. Second operand 13 states. [2020-08-22 23:16:35,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:35,842 INFO L93 Difference]: Finished difference Result 5583 states and 6704 transitions. [2020-08-22 23:16:35,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-08-22 23:16:35,843 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 284 [2020-08-22 23:16:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:35,856 INFO L225 Difference]: With dead ends: 5583 [2020-08-22 23:16:35,856 INFO L226 Difference]: Without dead ends: 3045 [2020-08-22 23:16:35,866 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2020-08-22 23:16:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2020-08-22 23:16:36,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 2562. [2020-08-22 23:16:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2562 states. [2020-08-22 23:16:36,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 2887 transitions. [2020-08-22 23:16:36,206 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 2887 transitions. Word has length 284 [2020-08-22 23:16:36,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:36,207 INFO L479 AbstractCegarLoop]: Abstraction has 2562 states and 2887 transitions. [2020-08-22 23:16:36,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 23:16:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 2887 transitions. [2020-08-22 23:16:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-22 23:16:36,211 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:36,211 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:36,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 23:16:36,211 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:36,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:36,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1211508846, now seen corresponding path program 1 times [2020-08-22 23:16:36,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:36,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [88804489] [2020-08-22 23:16:36,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 23:16:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-22 23:16:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 23:16:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-08-22 23:16:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-08-22 23:16:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2020-08-22 23:16:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2020-08-22 23:16:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2020-08-22 23:16:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2020-08-22 23:16:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2020-08-22 23:16:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2020-08-22 23:16:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2020-08-22 23:16:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-08-22 23:16:36,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [88804489] [2020-08-22 23:16:36,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:16:36,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-22 23:16:36,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196815152] [2020-08-22 23:16:36,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 23:16:36,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:36,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 23:16:36,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-08-22 23:16:36,946 INFO L87 Difference]: Start difference. First operand 2562 states and 2887 transitions. Second operand 13 states. [2020-08-22 23:16:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:38,512 INFO L93 Difference]: Finished difference Result 3787 states and 4293 transitions. [2020-08-22 23:16:38,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 23:16:38,512 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 286 [2020-08-22 23:16:38,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:38,518 INFO L225 Difference]: With dead ends: 3787 [2020-08-22 23:16:38,519 INFO L226 Difference]: Without dead ends: 1308 [2020-08-22 23:16:38,525 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2020-08-22 23:16:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2020-08-22 23:16:38,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1120. [2020-08-22 23:16:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2020-08-22 23:16:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1240 transitions. [2020-08-22 23:16:38,737 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1240 transitions. Word has length 286 [2020-08-22 23:16:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:38,738 INFO L479 AbstractCegarLoop]: Abstraction has 1120 states and 1240 transitions. [2020-08-22 23:16:38,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 23:16:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1240 transitions. [2020-08-22 23:16:38,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2020-08-22 23:16:38,742 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:38,743 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:38,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-22 23:16:38,743 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:38,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:38,743 INFO L82 PathProgramCache]: Analyzing trace with hash -537431486, now seen corresponding path program 1 times [2020-08-22 23:16:38,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:38,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [875549226] [2020-08-22 23:16:38,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 23:16:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:16:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 23:16:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-08-22 23:16:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 23:16:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-08-22 23:16:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:16:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:38,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:16:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-08-22 23:16:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2020-08-22 23:16:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2020-08-22 23:16:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2020-08-22 23:16:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:16:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2020-08-22 23:16:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2020-08-22 23:16:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2020-08-22 23:16:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2020-08-22 23:16:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2020-08-22 23:16:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:16:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2020-08-22 23:16:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 108 proven. 37 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2020-08-22 23:16:39,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [875549226] [2020-08-22 23:16:39,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:16:39,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-08-22 23:16:39,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644376203] [2020-08-22 23:16:39,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 23:16:39,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:39,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 23:16:39,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-08-22 23:16:39,173 INFO L87 Difference]: Start difference. First operand 1120 states and 1240 transitions. Second operand 14 states. [2020-08-22 23:16:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:41,481 INFO L93 Difference]: Finished difference Result 1600 states and 1784 transitions. [2020-08-22 23:16:41,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 23:16:41,481 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 421 [2020-08-22 23:16:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:41,484 INFO L225 Difference]: With dead ends: 1600 [2020-08-22 23:16:41,484 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 23:16:41,489 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=295, Invalid=761, Unknown=0, NotChecked=0, Total=1056 [2020-08-22 23:16:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 23:16:41,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 23:16:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 23:16:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 23:16:41,490 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 421 [2020-08-22 23:16:41,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:41,491 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 23:16:41,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 23:16:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 23:16:41,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 23:16:41,491 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-22 23:16:41,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 23:16:41,767 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2020-08-22 23:16:41,913 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2020-08-22 23:16:42,139 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2020-08-22 23:16:42,274 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2020-08-22 23:16:44,308 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2020-08-22 23:16:44,432 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2020-08-22 23:16:45,596 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2020-08-22 23:16:45,722 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2020-08-22 23:16:45,889 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2020-08-22 23:16:46,003 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 73 [2020-08-22 23:16:48,176 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 142 [2020-08-22 23:16:48,340 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 142 [2020-08-22 23:16:49,452 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2020-08-22 23:16:49,618 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2020-08-22 23:16:50,582 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2020-08-22 23:16:50,753 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2020-08-22 23:16:51,159 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 100 [2020-08-22 23:16:52,535 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2020-08-22 23:16:52,691 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2020-08-22 23:16:58,079 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2020-08-22 23:16:58,207 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 73 [2020-08-22 23:16:59,570 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2020-08-22 23:16:59,696 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2020-08-22 23:16:59,859 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2020-08-22 23:16:59,975 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 73 [2020-08-22 23:17:02,794 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2020-08-22 23:17:02,922 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 73 [2020-08-22 23:17:04,296 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2020-08-22 23:17:04,587 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-08-22 23:17:05,225 WARN L193 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2020-08-22 23:17:05,564 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2020-08-22 23:17:05,736 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2020-08-22 23:17:06,169 WARN L193 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-08-22 23:17:07,334 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2020-08-22 23:17:08,426 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2020-08-22 23:17:08,628 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-08-22 23:17:09,048 WARN L193 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2020-08-22 23:17:09,687 WARN L193 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 79 [2020-08-22 23:17:10,075 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2020-08-22 23:17:10,619 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 47 [2020-08-22 23:17:11,152 WARN L193 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2020-08-22 23:17:11,449 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2020-08-22 23:17:11,723 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2020-08-22 23:17:12,025 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2020-08-22 23:17:12,273 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-08-22 23:17:12,425 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-08-22 23:17:13,069 WARN L193 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-08-22 23:17:13,455 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2020-08-22 23:17:14,020 WARN L193 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 45 [2020-08-22 23:17:15,117 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2020-08-22 23:17:15,453 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2020-08-22 23:17:16,056 WARN L193 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 58 [2020-08-22 23:17:17,073 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2020-08-22 23:17:18,146 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2020-08-22 23:17:18,576 WARN L193 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2020-08-22 23:17:19,601 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 128 DAG size of output: 72 [2020-08-22 23:17:20,060 WARN L193 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2020-08-22 23:17:20,491 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2020-08-22 23:17:21,412 WARN L193 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 92 [2020-08-22 23:17:21,851 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2020-08-22 23:17:22,186 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-08-22 23:17:22,479 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2020-08-22 23:17:22,654 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2020-08-22 23:17:22,800 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-08-22 23:17:22,991 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-08-22 23:17:23,138 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-08-22 23:17:23,504 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-08-22 23:17:24,053 WARN L193 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2020-08-22 23:17:24,346 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2020-08-22 23:17:24,777 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 44 [2020-08-22 23:17:25,775 WARN L193 SmtUtils]: Spent 916.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2020-08-22 23:17:25,903 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2020-08-22 23:17:26,695 WARN L193 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2020-08-22 23:17:26,878 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-08-22 23:17:27,135 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2020-08-22 23:17:27,488 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-08-22 23:17:28,011 WARN L193 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2020-08-22 23:17:29,270 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2020-08-22 23:17:29,678 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2020-08-22 23:17:30,266 WARN L193 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2020-08-22 23:17:30,577 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2020-08-22 23:17:30,810 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2020-08-22 23:17:31,174 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2020-08-22 23:17:32,297 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2020-08-22 23:17:32,602 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2020-08-22 23:17:33,871 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2020-08-22 23:17:34,390 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 44 [2020-08-22 23:17:34,796 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2020-08-22 23:17:35,359 WARN L193 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 62 [2020-08-22 23:17:35,558 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-08-22 23:17:35,715 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-08-22 23:17:36,258 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2020-08-22 23:17:36,453 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 40 [2020-08-22 23:17:36,706 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2020-08-22 23:17:37,348 WARN L193 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2020-08-22 23:17:37,807 WARN L193 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2020-08-22 23:17:38,097 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2020-08-22 23:17:38,370 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2020-08-22 23:17:38,724 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-08-22 23:17:40,007 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 116 DAG size of output: 95 [2020-08-22 23:17:40,319 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2020-08-22 23:17:41,374 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2020-08-22 23:17:42,110 WARN L193 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2020-08-22 23:17:42,533 WARN L193 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 45 [2020-08-22 23:17:43,124 WARN L193 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2020-08-22 23:17:43,401 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-08-22 23:17:43,786 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-08-22 23:17:44,405 WARN L193 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-08-22 23:17:44,834 WARN L193 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-08-22 23:17:45,265 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-08-22 23:17:45,975 WARN L193 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2020-08-22 23:17:46,301 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2020-08-22 23:17:46,566 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2020-08-22 23:17:46,843 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-08-22 23:17:47,013 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-08-22 23:17:47,615 WARN L193 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2020-08-22 23:17:48,698 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 134 DAG size of output: 72 [2020-08-22 23:17:48,854 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-08-22 23:17:49,321 WARN L193 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2020-08-22 23:17:49,933 WARN L193 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2020-08-22 23:17:50,189 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2020-08-22 23:17:50,298 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2020-08-22 23:17:50,529 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2020-08-22 23:17:50,638 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-08-22 23:17:50,892 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2020-08-22 23:17:51,344 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 40 [2020-08-22 23:17:51,875 WARN L193 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2020-08-22 23:17:52,248 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2020-08-22 23:17:52,614 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-08-22 23:17:52,830 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 34 [2020-08-22 23:17:53,114 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2020-08-22 23:17:53,385 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2020-08-22 23:17:53,532 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 34 [2020-08-22 23:17:53,857 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2020-08-22 23:17:54,112 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-08-22 23:17:54,761 WARN L193 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 64 [2020-08-22 23:17:55,275 WARN L193 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 45 [2020-08-22 23:17:55,428 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-08-22 23:17:55,770 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-08-22 23:17:56,025 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2020-08-22 23:17:57,140 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2020-08-22 23:17:57,834 WARN L193 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2020-08-22 23:17:58,531 WARN L193 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2020-08-22 23:17:58,886 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2020-08-22 23:18:00,219 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 116 DAG size of output: 95 [2020-08-22 23:18:00,928 WARN L193 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2020-08-22 23:18:02,068 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2020-08-22 23:18:02,459 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2020-08-22 23:18:02,656 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-08-22 23:18:02,816 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 38 [2020-08-22 23:18:03,385 WARN L193 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2020-08-22 23:18:03,616 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-08-22 23:18:03,952 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2020-08-22 23:18:04,437 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2020-08-22 23:18:04,618 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-08-22 23:18:04,938 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 40 [2020-08-22 23:18:05,128 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2020-08-22 23:18:05,325 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2020-08-22 23:18:05,729 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2020-08-22 23:18:06,302 WARN L193 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2020-08-22 23:18:06,606 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2020-08-22 23:18:07,203 WARN L193 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 67 [2020-08-22 23:18:07,558 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2020-08-22 23:18:07,875 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2020-08-22 23:18:07,883 INFO L264 CegarLoopResult]: At program point immediate_notifyEXIT(lines 326 336) the Hoare annotation is: (let ((.cse8 (= ~m_pc~0 1)) (.cse2 (= ~t1_pc~0 1)) (.cse14 (= ~m_i~0 1))) (let ((.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not .cse14)) (.cse12 (not .cse2)) (.cse1 (= |old(~t1_st~0)| 0)) (.cse10 (and (<= 2 ~m_st~0) (not .cse8) .cse14)) (.cse3 (= ~E_M~0 1)) (.cse7 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse8 .cse11) (or .cse0 .cse12 (not (<= 2 |old(~t1_st~0)|)) .cse3 .cse4 .cse5 (= ~t1_st~0 0) .cse7 .cse6 .cse9) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse12 (not (<= ~token~0 .cse13)) (not (<= .cse13 ~token~0)) .cse1 .cse10 (not .cse3) .cse7 (= ~m_st~0 0) .cse11 (not (<= 2 ~E_1~0))))))) [2020-08-22 23:18:07,884 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse12 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (= ~t1_pc~0 1))) (let ((.cse6 (= ~E_M~0 0)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse2 (= ~m_pc~0 1)) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse4 (not .cse11)) (.cse10 (= |old(~t1_st~0)| 0)) (.cse5 (= ~E_M~0 1)) (.cse8 (not (= ~t1_i~0 1))) (.cse1 (and .cse12 (= |old(~t1_st~0)| ~t1_st~0))) (.cse3 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse1 .cse9) (or .cse0 (not .cse10) .cse11 .cse5 .cse6 .cse7 .cse8 .cse2 (and .cse12 (= ~t1_st~0 0)) .cse9) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse4 (not (<= ~token~0 .cse13)) (not (<= .cse13 ~token~0)) .cse10 (not .cse5) .cse8 .cse1 .cse3 (not (<= 2 ~E_1~0))))))) [2020-08-22 23:18:07,886 INFO L264 CegarLoopResult]: At program point immediate_notifyFINAL(lines 326 336) the Hoare annotation is: (let ((.cse8 (= ~m_pc~0 1)) (.cse2 (= ~t1_pc~0 1)) (.cse14 (= ~m_i~0 1))) (let ((.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not .cse14)) (.cse12 (not .cse2)) (.cse1 (= |old(~t1_st~0)| 0)) (.cse10 (and (<= 2 ~m_st~0) (not .cse8) .cse14)) (.cse3 (= ~E_M~0 1)) (.cse7 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse8 .cse11) (or .cse0 .cse12 (not (<= 2 |old(~t1_st~0)|)) .cse3 .cse4 .cse5 (= ~t1_st~0 0) .cse7 .cse6 .cse9) (let ((.cse13 (+ ~local~0 1))) (or .cse0 .cse12 (not (<= ~token~0 .cse13)) (not (<= .cse13 ~token~0)) .cse1 .cse10 (not .cse3) .cse7 (= ~m_st~0 0) .cse11 (not (<= 2 ~E_1~0))))))) [2020-08-22 23:18:07,886 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse2 (= ~m_pc~0 1)) (.cse18 (= ~m_i~0 1))) (let ((.cse4 (not (<= |old(~token~0)| ~local~0))) (.cse1 (and (<= 2 ~m_st~0) (not .cse2) .cse18)) (.cse10 (not (<= ~local~0 |old(~token~0)|))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not .cse18)) (.cse12 (= ~m_st~0 0)) (.cse14 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse17 (= |old(~token~0)| ~token~0)) (.cse5 (= |old(~E_M~0)| 1)) (.cse7 (= |old(~E_M~0)| 0)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse6 (= |old(~t1_pc~0)| 1)) (.cse9 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 (not .cse6) .cse7 .cse8 .cse1 .cse9 .cse10 (let ((.cse11 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (<= .cse11 ~token~0) (not (= ~E_M~0 1)) (<= ~token~0 .cse11) .cse12)) .cse3 .cse13) (or .cse0 .cse4 .cse5 .cse7 .cse8 (and (= ~m_st~0 |old(~m_st~0)|) .cse14 .cse15 .cse16 .cse17) .cse1 .cse6 .cse10 .cse9 .cse3 .cse13) (or .cse0 (and .cse12 .cse14 .cse15 .cse16 .cse17) .cse5 .cse7 (not (= |old(~m_st~0)| 0)) .cse8 .cse6 .cse9 .cse2 .cse13)))) [2020-08-22 23:18:07,886 INFO L264 CegarLoopResult]: At program point L81(lines 81 85) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 1)) (.cse4 (= |old(~token~0)| ~token~0)) (.cse0 (not (= ~m_i~0 1))) (.cse8 (= |old(~E_M~0)| 1)) (.cse9 (= |old(~E_M~0)| 0)) (.cse10 (= |old(~t1_st~0)| 0)) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (not (= ~t1_pc~0 0))) (.cse2 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (not (= ~t1_i~0 1))) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7) (or .cse0 .cse8 .cse9 (not (= |old(~m_st~0)| 0)) .cse10 (= |old(~t1_pc~0)| 1) .cse11 .cse6 (and .cse12 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5) .cse13) (or .cse0 (not (<= |old(~token~0)| ~local~0)) .cse8 .cse9 .cse10 (and .cse1 .cse12 (<= ~token~0 ~local~0) .cse2 (<= ~local~0 ~token~0) .cse3 .cse5) (not (<= ~local~0 |old(~token~0)|)) .cse11 .cse7 .cse13))) [2020-08-22 23:18:07,887 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse8 (= |old(~E_M~0)| 1)) (.cse9 (= |old(~E_M~0)| 0)) (.cse10 (= |old(~t1_st~0)| 0)) (.cse2 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= |old(~token~0)| ~token~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (not (= ~t1_i~0 1))) (.cse6 (= ~m_pc~0 1)) (.cse12 (not (<= 2 ~E_1~0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7) (or (and .cse1 (<= ~token~0 ~local~0) .cse2 (<= ~local~0 ~token~0) .cse3 .cse5) .cse0 (not (<= |old(~token~0)| ~local~0)) .cse8 .cse9 .cse10 (not (<= ~local~0 |old(~token~0)|)) .cse11 .cse7 .cse12) (or .cse0 .cse8 .cse9 (not (= |old(~m_st~0)| 0)) .cse10 (and (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5) (= |old(~t1_pc~0)| 1) .cse11 .cse6 .cse12))) [2020-08-22 23:18:07,887 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (let ((.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse6 (not (<= ~local~0 |old(~token~0)|))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (= |old(~t1_st~0)| 0)) (.cse5 (= |old(~t1_pc~0)| 1)) (.cse7 (not (= ~t1_i~0 1))) (.cse9 (not (<= 2 ~E_1~0))) (.cse0 (not (= ~m_i~0 1))) (.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse14 (= ~m_pc~0 1)) (.cse8 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (let ((.cse11 (+ |old(~token~0)| 1))) (and .cse10 (= ~t1_pc~0 1) (<= .cse11 ~token~0) (<= ~token~0 .cse11) .cse12 .cse13)) .cse9) (or .cse0 .cse2 .cse3 (not (= |old(~m_st~0)| 0)) .cse4 .cse5 .cse7 .cse14 .cse9) (or .cse0 (and .cse10 .cse12 .cse13) .cse14 .cse8))) [2020-08-22 23:18:07,887 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse15 (= ~m_pc~0 1)) (.cse18 (= ~m_i~0 1))) (let ((.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse5 (and (<= 2 ~m_st~0) (not .cse15) .cse18)) (.cse7 (not (<= ~local~0 |old(~token~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not .cse18)) (.cse10 (= ~t1_pc~0 1)) (.cse17 (= ~m_st~0 0)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (= |old(~t1_st~0)| 0)) (.cse6 (= |old(~t1_pc~0)| 1)) (.cse8 (not (= ~t1_i~0 1))) (.cse14 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and (= ~m_st~0 |old(~m_st~0)|) .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse0 .cse5 .cse15 .cse9) (or .cse0 .cse1 .cse2 (not .cse6) .cse3 .cse4 .cse5 .cse8 .cse7 (let ((.cse16 (+ |old(~token~0)| 1))) (and .cse10 (not (= ~E_M~0 0)) (<= .cse16 ~token~0) (not (= ~E_M~0 1)) (<= ~token~0 .cse16) .cse17)) .cse9 .cse14) (or .cse0 (and .cse10 .cse17 .cse11 .cse13 .cse12) .cse2 .cse3 (not (= |old(~m_st~0)| 0)) .cse4 .cse6 .cse8 .cse15 .cse14)))) [2020-08-22 23:18:07,887 INFO L264 CegarLoopResult]: At program point L90(line 90) the Hoare annotation is: (let ((.cse2 (= ~m_pc~0 1)) (.cse18 (= ~m_i~0 1))) (let ((.cse4 (not (<= |old(~token~0)| ~local~0))) (.cse1 (and (<= 2 ~m_st~0) (not .cse2) .cse18)) (.cse10 (not (<= ~local~0 |old(~token~0)|))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not .cse18)) (.cse12 (= ~m_st~0 0)) (.cse14 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~E_M~0 |old(~E_M~0)|)) (.cse17 (= |old(~token~0)| ~token~0)) (.cse5 (= |old(~E_M~0)| 1)) (.cse7 (= |old(~E_M~0)| 0)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse6 (= |old(~t1_pc~0)| 1)) (.cse9 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 (not .cse6) .cse7 .cse8 .cse1 .cse9 .cse10 (let ((.cse11 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (<= .cse11 ~token~0) (not (= ~E_M~0 1)) (<= ~token~0 .cse11) .cse12)) .cse3 .cse13) (or .cse0 .cse4 .cse5 .cse7 .cse8 (and (= ~m_st~0 |old(~m_st~0)|) .cse14 .cse15 .cse16 .cse17) .cse1 .cse6 .cse10 .cse9 .cse3 .cse13) (or .cse0 (and .cse12 .cse14 .cse15 .cse16 .cse17) .cse5 .cse7 (not (= |old(~m_st~0)| 0)) .cse8 .cse6 .cse9 .cse2 .cse13)))) [2020-08-22 23:18:07,888 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (= ~E_M~0 |old(~E_M~0)|)) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse8 (not (<= ~local~0 |old(~token~0)|))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (= |old(~t1_st~0)| 0)) (.cse13 (= |old(~t1_pc~0)| 1)) (.cse9 (not (= ~t1_i~0 1))) (.cse12 (= ~m_pc~0 1)) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 (and .cse2 (= ~t1_pc~0 1) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (and .cse2 (= |old(~t1_pc~0)| ~t1_pc~0) .cse3 (= |old(~token~0)| ~token~0) .cse4) .cse12 .cse10) (or .cse0 .cse1 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse5 .cse6 (not (= |old(~m_st~0)| 0)) .cse7 .cse13 .cse9 .cse12 .cse11))) [2020-08-22 23:18:07,890 INFO L264 CegarLoopResult]: At program point transmit1EXIT(lines 74 109) the Hoare annotation is: (let ((.cse6 (<= 2 ~m_st~0)) (.cse16 (= ~m_pc~0 1)) (.cse19 (= ~m_i~0 1))) (let ((.cse8 (= ~E_M~0 |old(~E_M~0)|)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse0 (not .cse19)) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse11 (= |old(~t1_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (= |old(~t1_st~0)| 0)) (.cse10 (and .cse6 (not .cse16) .cse19)) (.cse13 (not (= ~t1_i~0 1))) (.cse12 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse17 (= ~m_st~0 0)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse10 .cse16 .cse14) (or .cse0 .cse2 .cse3 (not (= |old(~m_st~0)| 0)) (and .cse5 .cse7 .cse17 .cse8 .cse9) .cse4 .cse11 .cse13 .cse16 .cse15) (or .cse0 .cse1 .cse2 (not .cse11) .cse3 .cse4 .cse10 .cse13 .cse12 (let ((.cse18 (+ |old(~token~0)| 1))) (and .cse5 .cse7 (not (= ~E_M~0 0)) (<= .cse18 ~token~0) (not (= ~E_M~0 1)) (<= ~token~0 .cse18) .cse17)) .cse14 .cse15)))) [2020-08-22 23:18:07,891 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse6 (<= 2 ~m_st~0)) (.cse16 (= ~m_pc~0 1)) (.cse19 (= ~m_i~0 1))) (let ((.cse8 (= ~E_M~0 |old(~E_M~0)|)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse0 (not .cse19)) (.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse11 (= |old(~t1_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (= |old(~t1_st~0)| 0)) (.cse10 (and .cse6 (not .cse16) .cse19)) (.cse13 (not (= ~t1_i~0 1))) (.cse12 (not (<= ~local~0 |old(~token~0)|))) (.cse5 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse17 (= ~m_st~0 0)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse15 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse10 .cse16 .cse14) (or .cse0 .cse2 .cse3 (not (= |old(~m_st~0)| 0)) (and .cse5 .cse7 .cse17 .cse8 .cse9) .cse4 .cse11 .cse13 .cse16 .cse15) (or .cse0 .cse1 .cse2 (not .cse11) .cse3 .cse4 .cse10 .cse13 .cse12 (let ((.cse18 (+ |old(~token~0)| 1))) (and .cse5 .cse7 (not (= ~E_M~0 0)) (<= .cse18 ~token~0) (not (= ~E_M~0 1)) (<= ~token~0 .cse18) .cse17)) .cse14 .cse15)))) [2020-08-22 23:18:07,891 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (not (<= |old(~token~0)| ~local~0))) (.cse9 (not (<= ~local~0 |old(~token~0)|))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse6 (= |old(~E_M~0)| 1)) (.cse7 (= |old(~E_M~0)| 0)) (.cse8 (= |old(~t1_st~0)| 0)) (.cse13 (= |old(~t1_pc~0)| 1)) (.cse10 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1)) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4) (or .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse4 .cse11 (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse1 (= ~t1_pc~0 1) (= ~E_M~0 1) (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse2))) (or .cse0 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse4 .cse11) (or .cse0 .cse6 .cse7 (not (= |old(~m_st~0)| 0)) .cse8 .cse13 .cse10 .cse3 .cse11))) [2020-08-22 23:18:07,891 INFO L264 CegarLoopResult]: At program point L99-1(line 99) the Hoare annotation is: (let ((.cse11 (= ~m_pc~0 1)) (.cse13 (= ~m_i~0 1))) (let ((.cse1 (not (<= |old(~token~0)| ~local~0))) (.cse5 (and (<= 2 ~m_st~0) (not .cse11) .cse13)) (.cse7 (not (<= ~local~0 |old(~token~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not .cse13)) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse4 (= |old(~t1_st~0)| 0)) (.cse6 (= |old(~t1_pc~0)| 1)) (.cse8 (not (= ~t1_i~0 1))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse5 .cse11 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 (let ((.cse12 (+ |old(~token~0)| 1))) (and (= ~t1_pc~0 1) (= ~E_M~0 1) (<= .cse12 ~token~0) (<= ~token~0 .cse12) (= ~m_st~0 0))) .cse9 .cse10) (or .cse0 .cse2 .cse3 (not (= |old(~m_st~0)| 0)) .cse4 .cse6 .cse8 .cse11 .cse10)))) [2020-08-22 23:18:07,892 INFO L264 CegarLoopResult]: At program point L318(line 318) the Hoare annotation is: (let ((.cse23 (= |old(~t1_st~0)| 0)) (.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= ~m_pc~0 1)) (.cse19 (= ~m_i~0 1)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~t1_pc~0 1)) (.cse8 (<= activate_threads_~tmp~1 0)) (.cse10 (< 0 (+ activate_threads_~tmp~1 1)))) (let ((.cse18 (not (<= 2 |old(~t1_st~0)|))) (.cse20 (and .cse8 .cse10)) (.cse14 (not .cse5)) (.cse9 (= ~m_st~0 0)) (.cse2 (and (<= 2 ~m_st~0) .cse21 .cse8 (not .cse1) .cse10 .cse19 .cse11)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse13 (not (<= 2 ~E_1~0))) (.cse0 (not .cse19)) (.cse4 (not .cse23)) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse15 (not (<= ~token~0 ~local~0))) (.cse12 (not (= ~t1_i~0 1))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse17 (and .cse21 .cse8 .cse10 .cse11))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 (not (= |old(~m_st~0)| 0)) .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11) .cse12 .cse1 .cse13) (or .cse0 .cse4 .cse14 .cse7 .cse6 .cse15 .cse12 .cse16 .cse3 .cse13 .cse17) (or .cse0 .cse14 .cse18 .cse6 .cse7 .cse15 .cse12 .cse16 (and (or (and .cse5 .cse19 .cse9) .cse20) .cse21 .cse11)) (or .cse0 .cse14 .cse18 .cse6 .cse7 .cse15 .cse12 .cse1 .cse20 .cse16) (let ((.cse22 (+ ~local~0 1))) (or .cse0 .cse14 (not (<= ~token~0 .cse22)) (not (<= .cse22 ~token~0)) .cse23 (and .cse5 .cse19 .cse9 (<= 1 activate_threads_~tmp~1)) (not .cse6) .cse12 .cse2 .cse3 .cse13)) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse15 .cse12 .cse1 .cse16 .cse17)))) [2020-08-22 23:18:07,894 INFO L264 CegarLoopResult]: At program point L317(lines 317 321) the Hoare annotation is: (let ((.cse16 (= |old(~t1_st~0)| 0)) (.cse20 (= ~t1_pc~0 1)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse1 (= ~m_pc~0 1)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse23 (= ~m_i~0 1)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse2 (and (<= 2 ~m_st~0) .cse11 .cse21 (not .cse1) .cse22 .cse23 .cse14)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (and .cse21 .cse22)) (.cse4 (not .cse20)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 ~E_1~0))) (.cse12 (= ~m_st~0 0)) (.cse0 (not .cse23)) (.cse18 (not .cse16)) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse19 (and .cse11 .cse21 .cse22 .cse14))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 (or .cse12 .cse13) .cse14)) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse4 (not (<= ~token~0 .cse15)) (and (not (= ~t1_st~0 0)) .cse12 (<= 1 activate_threads_~tmp~1)) (not (<= .cse15 ~token~0)) .cse16 (not .cse6) .cse9 .cse2 .cse3 .cse17)) (or .cse0 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse1 .cse13 .cse10) (or .cse0 .cse18 .cse4 .cse7 .cse6 .cse8 .cse9 .cse10 .cse3 .cse19 .cse17) (or .cse0 .cse18 .cse20 (not (= |old(~m_st~0)| 0)) .cse6 .cse7 .cse9 .cse1 .cse17 (and .cse21 .cse22 .cse12 .cse14)) (or .cse0 .cse18 .cse20 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse19)))) [2020-08-22 23:18:07,894 INFO L264 CegarLoopResult]: At program point L315(line 315) the Hoare annotation is: (let ((.cse16 (= |old(~t1_st~0)| 0)) (.cse20 (= ~t1_pc~0 1)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse1 (= ~m_pc~0 1)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse23 (= ~m_i~0 1)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse2 (and (<= 2 ~m_st~0) .cse11 .cse21 (not .cse1) .cse22 .cse23 .cse14)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (and .cse21 .cse22)) (.cse4 (not .cse20)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 ~E_1~0))) (.cse12 (= ~m_st~0 0)) (.cse0 (not .cse23)) (.cse18 (not .cse16)) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse19 (and .cse11 .cse21 .cse22 .cse14))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 (or .cse12 .cse13) .cse14)) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse4 (not (<= ~token~0 .cse15)) (and (not (= ~t1_st~0 0)) .cse12 (<= 1 activate_threads_~tmp~1)) (not (<= .cse15 ~token~0)) .cse16 (not .cse6) .cse9 .cse2 .cse3 .cse17)) (or .cse0 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse1 .cse13 .cse10) (or .cse0 .cse18 .cse4 .cse7 .cse6 .cse8 .cse9 .cse10 .cse3 .cse19 .cse17) (or .cse0 .cse18 .cse20 (not (= |old(~m_st~0)| 0)) .cse6 .cse7 .cse9 .cse1 .cse17 (and .cse21 .cse22 .cse12 .cse14)) (or .cse0 .cse18 .cse20 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse19)))) [2020-08-22 23:18:07,894 INFO L264 CegarLoopResult]: At program point L317-2(lines 301 325) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= |old(~t1_st~0)| 0)) (.cse21 (<= 2 ~m_st~0)) (.cse20 (= ~m_pc~0 1)) (.cse25 (= ~m_i~0 1)) (.cse22 (= ~t1_pc~0 1)) (.cse23 (<= activate_threads_~tmp~1 0)) (.cse24 (< 0 (+ activate_threads_~tmp~1 1)))) (let ((.cse12 (and .cse23 .cse24)) (.cse1 (not .cse22)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (and .cse21 .cse23 (not .cse20) .cse25 .cse24)) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 ~E_1~0))) (.cse11 (= ~m_st~0 0)) (.cse0 (not .cse25)) (.cse13 (not .cse19)) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse16 (and .cse9 .cse23 .cse24 .cse10))) (and (let ((.cse7 (or .cse11 .cse12))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= ~t1_st~0 0) .cse7) .cse8 (and .cse9 .cse7 .cse10))) (or .cse0 .cse13 .cse1 .cse14 .cse4 .cse3 .cse5 .cse6 .cse8 .cse15 .cse16 .cse17) (let ((.cse18 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse18)) .cse14 (not (<= .cse18 ~token~0)) .cse19 (and .cse11 (<= 1 activate_threads_~tmp~1)) (not .cse3) .cse6 .cse15 .cse17)) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse20 .cse12 .cse8) (or .cse21 .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse8 .cse15 .cse17) (or .cse0 .cse14 .cse20 .cse15) (or .cse0 .cse13 .cse22 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse6 .cse20 .cse17 (and .cse23 .cse24 .cse11 .cse10)) (or .cse0 .cse13 .cse22 .cse3 .cse4 .cse5 .cse6 .cse20 .cse8 .cse16)))) [2020-08-22 23:18:07,895 INFO L264 CegarLoopResult]: At program point L315-1(line 315) the Hoare annotation is: (let ((.cse16 (= |old(~t1_st~0)| 0)) (.cse20 (= ~t1_pc~0 1)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse1 (= ~m_pc~0 1)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse23 (= ~m_i~0 1)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse2 (and (<= 2 ~m_st~0) .cse11 .cse21 (not .cse1) .cse22 .cse23 .cse14)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (and .cse21 .cse22)) (.cse4 (not .cse20)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 ~E_1~0))) (.cse12 (= ~m_st~0 0)) (.cse0 (not .cse23)) (.cse18 (not .cse16)) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse19 (and .cse11 .cse21 .cse22 .cse14))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 (or .cse12 .cse13) .cse14)) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse4 (not (<= ~token~0 .cse15)) (and (not (= ~t1_st~0 0)) .cse12 (<= 1 activate_threads_~tmp~1)) (not (<= .cse15 ~token~0)) .cse16 (not .cse6) .cse9 .cse2 .cse3 .cse17)) (or .cse0 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse1 .cse13 .cse10) (or .cse0 .cse18 .cse4 .cse7 .cse6 .cse8 .cse9 .cse10 .cse3 .cse19 .cse17) (or .cse0 .cse18 .cse20 (not (= |old(~m_st~0)| 0)) .cse6 .cse7 .cse9 .cse1 .cse17 (and .cse21 .cse22 .cse12 .cse14)) (or .cse0 .cse18 .cse20 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse19)))) [2020-08-22 23:18:07,896 INFO L264 CegarLoopResult]: At program point L315-2(line 315) the Hoare annotation is: (let ((.cse16 (= |old(~t1_st~0)| 0)) (.cse20 (= ~t1_pc~0 1)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse1 (= ~m_pc~0 1)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse23 (= ~m_i~0 1)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse2 (and (<= 2 ~m_st~0) .cse11 .cse21 (not .cse1) .cse22 .cse23 .cse14)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (and .cse21 .cse22)) (.cse4 (not .cse20)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 ~E_1~0))) (.cse12 (= ~m_st~0 0)) (.cse0 (not .cse23)) (.cse18 (not .cse16)) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse19 (and .cse11 .cse21 .cse22 .cse14))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 (or .cse12 .cse13) .cse14)) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse4 (not (<= ~token~0 .cse15)) (and (not (= ~t1_st~0 0)) .cse12 (<= 1 activate_threads_~tmp~1)) (not (<= .cse15 ~token~0)) .cse16 (not .cse6) .cse9 .cse2 .cse3 .cse17)) (or .cse0 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse1 .cse13 .cse10) (or .cse0 .cse18 .cse4 .cse7 .cse6 .cse8 .cse9 .cse10 .cse3 .cse19 .cse17) (or .cse0 .cse18 .cse20 (not (= |old(~m_st~0)| 0)) .cse6 .cse7 .cse9 .cse1 .cse17 (and .cse21 .cse22 .cse12 .cse14)) (or .cse0 .cse18 .cse20 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse19)))) [2020-08-22 23:18:07,897 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1)) (.cse13 (= |old(~t1_st~0)| 0))) (let ((.cse1 (not .cse13)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse7 (= ~m_pc~0 1)) (.cse0 (not (= ~m_i~0 1))) (.cse9 (not .cse2)) (.cse3 (= ~E_M~0 1)) (.cse6 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 (not (<= 2 |old(~t1_st~0)|)) .cse3 .cse4 .cse5 .cse6 .cse8) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse6 .cse7 .cse10) (or .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse8 .cse11 .cse10) (or .cse0 .cse7 .cse11) (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse9 (not (<= ~token~0 .cse12)) (not (<= .cse12 ~token~0)) (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0) (<= 1 activate_threads_~tmp~1)) .cse13 (not .cse3) .cse6 .cse11 .cse10))))) [2020-08-22 23:18:07,897 INFO L264 CegarLoopResult]: At program point L309(lines 309 313) the Hoare annotation is: (let ((.cse20 (= ~t1_st~0 0)) (.cse15 (= ~t1_pc~0 1)) (.cse18 (= |old(~t1_st~0)| 0)) (.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (<= activate_threads_~tmp~1 0)) (.cse2 (= ~m_pc~0 1)) (.cse12 (< 0 (+ activate_threads_~tmp~1 1))) (.cse21 (= ~m_i~0 1)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse1 (and .cse10 .cse11 (not .cse2) .cse12 .cse21 .cse13)) (.cse0 (not .cse21)) (.cse14 (not .cse18)) (.cse4 (not .cse15)) (.cse6 (= ~E_M~0 0)) (.cse5 (= ~E_M~0 1)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse16 (and .cse10 .cse20 .cse11 .cse12)) (.cse19 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12 .cse13)) (or .cse0 .cse14 .cse15 .cse5 .cse6 .cse7 .cse8 .cse2 .cse9 .cse16) (let ((.cse17 (+ ~local~0 1))) (or .cse0 .cse4 (not (<= ~token~0 .cse17)) (not (<= .cse17 ~token~0)) (and .cse10 .cse13 (<= 1 activate_threads_~tmp~1)) .cse18 .cse1 (not .cse5) .cse8 .cse3 .cse19)) (or .cse0 .cse14 (and .cse20 .cse11 .cse12 (= ~m_st~0 0)) .cse15 (not (= |old(~m_st~0)| 0)) .cse5 .cse6 .cse8 .cse2 .cse19) (or .cse0 .cse14 .cse4 .cse6 .cse5 .cse7 .cse8 .cse9 .cse3 .cse16 .cse19)))) [2020-08-22 23:18:07,897 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1)) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= ~t1_st~0 0)) (.cse16 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not .cse16)) (.cse6 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse2 (= ~m_pc~0 1)) (.cse10 (and .cse17 .cse14)) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (not .cse13)) (.cse7 (= ~E_M~0 1)) (.cse9 (not (= ~t1_i~0 1))) (.cse1 (and .cse17 (= |old(~t1_st~0)| ~t1_st~0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse3 .cse12) (or .cse0 .cse4 .cse13 (not (= |old(~m_st~0)| 0)) .cse7 .cse6 (and .cse14 (= ~m_st~0 0)) .cse9 .cse2 .cse12) (or .cse0 .cse5 (not (<= 2 |old(~t1_st~0)|)) .cse7 .cse6 .cse8 .cse9 .cse1 .cse11) (or .cse0 .cse4 .cse13 .cse7 .cse6 .cse8 .cse9 .cse2 .cse10 .cse11) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse5 (not (<= ~token~0 .cse15)) (not (<= .cse15 ~token~0)) .cse16 (not .cse7) .cse9 .cse1 .cse3 .cse12))))) [2020-08-22 23:18:07,901 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse16 (= |old(~t1_st~0)| 0)) (.cse20 (= ~t1_pc~0 1)) (.cse11 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (<= activate_threads_~tmp~1 0)) (.cse1 (= ~m_pc~0 1)) (.cse22 (< 0 (+ activate_threads_~tmp~1 1))) (.cse23 (= ~m_i~0 1)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse2 (and (<= 2 ~m_st~0) .cse11 .cse21 (not .cse1) .cse22 .cse23 .cse14)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse13 (and .cse21 .cse22)) (.cse4 (not .cse20)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 ~E_1~0))) (.cse12 (= ~m_st~0 0)) (.cse0 (not .cse23)) (.cse18 (not .cse16)) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse19 (and .cse11 .cse21 .cse22 .cse14))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 (or .cse12 .cse13) .cse14)) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse4 (not (<= ~token~0 .cse15)) (and (not (= ~t1_st~0 0)) .cse12 (<= 1 activate_threads_~tmp~1)) (not (<= .cse15 ~token~0)) .cse16 (not .cse6) .cse9 .cse2 .cse3 .cse17)) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse13) (or .cse0 .cse18 .cse4 .cse7 .cse6 .cse8 .cse9 .cse10 .cse3 .cse19 .cse17) (or .cse0 .cse18 .cse20 (not (= |old(~m_st~0)| 0)) .cse6 .cse7 .cse9 .cse1 .cse17 (and .cse21 .cse22 .cse12 .cse14)) (or .cse0 .cse18 .cse20 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse19)))) [2020-08-22 23:18:07,901 INFO L264 CegarLoopResult]: At program point L307-1(line 307) the Hoare annotation is: (let ((.cse7 (= ~m_pc~0 1)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~m_i~0 1)) (.cse2 (= ~t1_pc~0 1)) (.cse15 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (<= |activate_threads_#t~ret4| 0)) (.cse11 (= ~t1_st~0 0)) (.cse12 (<= 0 |activate_threads_#t~ret4|)) (.cse20 (= |old(~t1_st~0)| 0))) (let ((.cse1 (not .cse20)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse8 (and .cse15 .cse10 .cse11 .cse12)) (.cse9 (not (<= ~local~0 ~token~0))) (.cse14 (not .cse2)) (.cse3 (= ~E_M~0 1)) (.cse6 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~E_1~0))) (.cse0 (not .cse21)) (.cse18 (and .cse15 .cse10 .cse12 (not .cse7) .cse21 .cse16)) (.cse17 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse6 .cse7 (and .cse10 .cse11 .cse12 (= ~m_st~0 0)) .cse13) (or .cse0 .cse14 (and .cse15 .cse10 .cse12 .cse16) (not (<= 2 |old(~t1_st~0)|)) .cse3 .cse4 .cse5 .cse6 .cse9) (or .cse0 .cse1 .cse14 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse17 .cse13) (let ((.cse19 (+ ~local~0 1))) (or .cse0 .cse18 .cse14 (not (<= ~token~0 .cse19)) (and (<= 1 |activate_threads_#t~ret4|) .cse15 .cse16) (not (<= .cse19 ~token~0)) .cse20 (not .cse3) .cse6 .cse17 .cse13)) (or .cse0 .cse18 .cse7 .cse17)))) [2020-08-22 23:18:07,902 INFO L264 CegarLoopResult]: At program point L307-2(line 307) the Hoare annotation is: (let ((.cse7 (= ~m_pc~0 1)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~m_i~0 1)) (.cse2 (= ~t1_pc~0 1)) (.cse15 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (<= |activate_threads_#t~ret4| 0)) (.cse11 (= ~t1_st~0 0)) (.cse12 (<= 0 |activate_threads_#t~ret4|)) (.cse20 (= |old(~t1_st~0)| 0))) (let ((.cse1 (not .cse20)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse8 (and .cse15 .cse10 .cse11 .cse12)) (.cse9 (not (<= ~local~0 ~token~0))) (.cse14 (not .cse2)) (.cse3 (= ~E_M~0 1)) (.cse6 (not (= ~t1_i~0 1))) (.cse13 (not (<= 2 ~E_1~0))) (.cse0 (not .cse21)) (.cse18 (and .cse15 .cse10 .cse12 (not .cse7) .cse21 .cse16)) (.cse17 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse6 .cse7 (and .cse10 .cse11 .cse12 (= ~m_st~0 0)) .cse13) (or .cse0 .cse14 (and .cse15 .cse10 .cse12 .cse16) (not (<= 2 |old(~t1_st~0)|)) .cse3 .cse4 .cse5 .cse6 .cse9) (or .cse0 .cse1 .cse14 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse17 .cse13) (let ((.cse19 (+ ~local~0 1))) (or .cse0 .cse18 .cse14 (not (<= ~token~0 .cse19)) (and (<= 1 |activate_threads_#t~ret4|) .cse15 .cse16) (not (<= .cse19 ~token~0)) .cse20 (not .cse3) .cse6 .cse17 .cse13)) (or .cse0 .cse18 .cse7 .cse17)))) [2020-08-22 23:18:07,902 INFO L264 CegarLoopResult]: At program point L307-3(line 307) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 1)) (.cse23 (= ~m_i~0 1)) (.cse20 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~m_st~0 |old(~m_st~0)|)) (.cse7 (<= |activate_threads_#t~ret4| 0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (<= activate_threads_~tmp~1 0)) (.cse10 (<= 0 |activate_threads_#t~ret4|)) (.cse11 (< 0 (+ activate_threads_~tmp~1 1))) (.cse22 (= |old(~t1_st~0)| 0)) (.cse2 (= ~t1_pc~0 1))) (let ((.cse12 (not (<= 2 ~E_1~0))) (.cse13 (not .cse2)) (.cse1 (not .cse22)) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse14 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse15 (not (<= ~local~0 ~token~0))) (.cse17 (and .cse19 .cse7 .cse8 .cse9 .cse10 .cse11)) (.cse18 (and .cse19 .cse7 .cse9 .cse10 (not .cse6) .cse11 .cse23 .cse20)) (.cse0 (not .cse23)) (.cse16 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_st~0 0)) .cse12) (or .cse0 .cse1 .cse13 .cse4 .cse3 .cse14 .cse5 .cse15 .cse16 .cse17 .cse12) (let ((.cse21 (+ ~local~0 1))) (or .cse18 .cse0 .cse13 (and (<= 1 |activate_threads_#t~ret4|) .cse19 .cse20 (<= 1 activate_threads_~tmp~1)) (not (<= ~token~0 .cse21)) (not (<= .cse21 ~token~0)) .cse22 (not .cse3) .cse5 .cse16 .cse12)) (or .cse0 .cse13 (not (<= 2 |old(~t1_st~0)|)) .cse3 .cse4 .cse14 (and .cse19 .cse7 .cse9 .cse10 .cse11 .cse20) .cse5 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15 .cse17) (or .cse18 .cse0 .cse6 .cse16)))) [2020-08-22 23:18:07,903 INFO L264 CegarLoopResult]: At program point L303(line 303) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1)) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= ~t1_st~0 0)) (.cse16 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not .cse16)) (.cse6 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse2 (= ~m_pc~0 1)) (.cse10 (and .cse17 .cse14)) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (not .cse13)) (.cse7 (= ~E_M~0 1)) (.cse9 (not (= ~t1_i~0 1))) (.cse1 (and .cse17 (= |old(~t1_st~0)| ~t1_st~0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse3 .cse12) (or .cse0 .cse4 .cse13 (not (= |old(~m_st~0)| 0)) .cse7 .cse6 (and .cse14 (= ~m_st~0 0)) .cse9 .cse2 .cse12) (or .cse0 .cse5 (not (<= 2 |old(~t1_st~0)|)) .cse7 .cse6 .cse8 .cse9 .cse1 .cse11) (or .cse0 .cse4 .cse13 .cse7 .cse6 .cse8 .cse9 .cse2 .cse10 .cse11) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse5 (not (<= ~token~0 .cse15)) (not (<= .cse15 ~token~0)) .cse16 (not .cse7) .cse9 .cse1 .cse3 .cse12))))) [2020-08-22 23:18:07,903 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1)) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= ~t1_st~0 0)) (.cse16 (= |old(~t1_st~0)| 0))) (let ((.cse4 (not .cse16)) (.cse6 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse2 (= ~m_pc~0 1)) (.cse10 (and .cse17 .cse14)) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (not .cse13)) (.cse7 (= ~E_M~0 1)) (.cse9 (not (= ~t1_i~0 1))) (.cse1 (and .cse17 (= |old(~t1_st~0)| ~t1_st~0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse3 .cse12) (or .cse0 .cse4 .cse13 (not (= |old(~m_st~0)| 0)) .cse7 .cse6 (and .cse14 (= ~m_st~0 0)) .cse9 .cse2 .cse12) (or .cse0 .cse5 (not (<= 2 |old(~t1_st~0)|)) .cse7 .cse6 .cse8 .cse9 .cse1 .cse11) (or .cse0 .cse4 .cse13 .cse7 .cse6 .cse8 .cse9 .cse2 .cse10 .cse11) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse5 (not (<= ~token~0 .cse15)) (not (<= .cse15 ~token~0)) .cse16 (not .cse7) .cse9 .cse1 .cse3 .cse12))))) [2020-08-22 23:18:07,903 INFO L264 CegarLoopResult]: At program point activate_threadsEXIT(lines 301 325) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= |old(~t1_st~0)| 0)) (.cse21 (<= 2 ~m_st~0)) (.cse20 (= ~m_pc~0 1)) (.cse25 (= ~m_i~0 1)) (.cse22 (= ~t1_pc~0 1)) (.cse23 (<= activate_threads_~tmp~1 0)) (.cse24 (< 0 (+ activate_threads_~tmp~1 1)))) (let ((.cse12 (and .cse23 .cse24)) (.cse1 (not .cse22)) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (and .cse21 .cse23 (not .cse20) .cse25 .cse24)) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse17 (not (<= 2 ~E_1~0))) (.cse11 (= ~m_st~0 0)) (.cse0 (not .cse25)) (.cse13 (not .cse19)) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse16 (and .cse9 .cse23 .cse24 .cse10))) (and (let ((.cse7 (or .cse11 .cse12))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= ~t1_st~0 0) .cse7) .cse8 (and .cse9 .cse7 .cse10))) (or .cse0 .cse13 .cse1 .cse14 .cse4 .cse3 .cse5 .cse6 .cse8 .cse15 .cse16 .cse17) (let ((.cse18 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse18)) .cse14 (not (<= .cse18 ~token~0)) .cse19 (and .cse11 (<= 1 activate_threads_~tmp~1)) (not .cse3) .cse6 .cse15 .cse17)) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse20 .cse12 .cse8) (or .cse21 .cse0 .cse1 .cse2 .cse4 .cse3 .cse5 .cse6 .cse8 .cse15 .cse17) (or .cse0 .cse14 .cse20 .cse15) (or .cse0 .cse13 .cse22 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 .cse6 .cse20 .cse17 (and .cse23 .cse24 .cse11 .cse10)) (or .cse0 .cse13 .cse22 .cse3 .cse4 .cse5 .cse6 .cse20 .cse8 .cse16)))) [2020-08-22 23:18:07,904 INFO L264 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse12)) (.cse6 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (= ~m_pc~0 1)) (.cse11 (not (= ~t1_st~0 0))) (.cse7 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse10)) (not (<= .cse10 ~token~0)) .cse3 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9)) (or .cse0 (not (<= 2 ~m_st~0)) .cse3 .cse2 (not (<= ~token~0 ~local~0)) .cse4 .cse11 .cse7 (not (<= ~local~0 ~token~0)) .cse9) (or .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse11 .cse7 .cse8 .cse9)))) [2020-08-22 23:18:07,904 INFO L264 CegarLoopResult]: At program point exists_runnable_threadEXIT(lines 174 193) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse12)) (.cse7 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse4 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse5 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse6 (not (= ~t1_i~0 1))) (.cse11 (= ~m_pc~0 1)) (.cse10 (not (= ~t1_st~0 0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (let ((.cse2 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse2)) (not (<= .cse2 ~token~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (or .cse0 (not (<= 2 ~m_st~0)) .cse4 .cse3 (not (<= ~token~0 ~local~0)) .cse5 .cse6 .cse10 (not (<= ~local~0 ~token~0)) .cse9) (or .cse0 .cse1 .cse4 .cse3 .cse5 .cse6 .cse11 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse4 .cse3 .cse5 .cse6 .cse11 .cse10 .cse8 .cse9)))) [2020-08-22 23:18:07,904 INFO L264 CegarLoopResult]: At program point L189(line 189) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse11)) (.cse6 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (= ~m_pc~0 1)) (.cse9 (not (= ~t1_st~0 0))) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 (not (<= 2 ~m_st~0)) .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse9 (not (<= ~local~0 ~token~0)) .cse8) (let ((.cse10 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse10)) (not (<= .cse10 ~token~0)) .cse3 .cse2 .cse4 .cse6 .cse7 .cse8)) (or .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse9 .cse7 .cse8)))) [2020-08-22 23:18:07,904 INFO L264 CegarLoopResult]: At program point L183(line 183) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse10)) (.cse6 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (= ~m_pc~0 1)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 (not (<= 2 ~m_st~0)) .cse1 .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse6 (not (<= ~local~0 ~token~0)) .cse8) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse9)) (not (<= .cse9 ~token~0)) .cse3 .cse2 .cse4 .cse6 .cse7 .cse8)) (or .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse7 .cse8)))) [2020-08-22 23:18:07,905 INFO L264 CegarLoopResult]: At program point L182(lines 182 187) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse10)) (.cse6 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (= ~m_pc~0 1)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse9)) (not (<= .cse9 ~token~0)) .cse3 .cse2 .cse4 .cse6 .cse7 .cse8)) (or .cse0 .cse10 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse7 .cse8)))) [2020-08-22 23:18:07,905 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-08-22 23:18:07,905 INFO L264 CegarLoopResult]: At program point L179(line 179) the Hoare annotation is: (let ((.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse7 (not (<= 2 ~E_1~0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) .cse6 .cse7) (or .cse0 .cse1 (not (= ~t1_pc~0 1)) .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6 .cse7) (or .cse0 .cse1 (= ~m_pc~0 1)))) [2020-08-22 23:18:07,906 INFO L271 CegarLoopResult]: At program point L178(lines 178 188) the Hoare annotation is: true [2020-08-22 23:18:07,908 INFO L264 CegarLoopResult]: At program point exists_runnable_threadFINAL(lines 174 193) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse12)) (.cse7 (not (<= 2 ~t1_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse4 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse5 (and (<= 1 |exists_runnable_thread_#res|) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse6 (not (= ~t1_i~0 1))) (.cse11 (= ~m_pc~0 1)) (.cse10 (not (= ~t1_st~0 0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (let ((.cse2 (+ ~local~0 1))) (or .cse0 .cse1 (not (<= ~token~0 .cse2)) (not (<= .cse2 ~token~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (or .cse0 (not (<= 2 ~m_st~0)) .cse4 .cse3 (not (<= ~token~0 ~local~0)) .cse5 .cse6 .cse10 (not (<= ~local~0 ~token~0)) .cse9) (or .cse0 .cse1 .cse4 .cse3 .cse5 .cse6 .cse11 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse4 .cse3 .cse5 .cse6 .cse11 .cse10 .cse8 .cse9)))) [2020-08-22 23:18:07,908 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredFINAL(lines 129 147) the Hoare annotation is: true [2020-08-22 23:18:07,908 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-08-22 23:18:07,908 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredEXIT(lines 129 147) the Hoare annotation is: true [2020-08-22 23:18:07,908 INFO L271 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: true [2020-08-22 23:18:07,908 INFO L264 CegarLoopResult]: At program point L135(line 135) the Hoare annotation is: (let ((.cse10 (= ~t1_st~0 0)) (.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not .cse12)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse6 (not (= ~t1_i~0 1))) (.cse13 (= ~m_pc~0 1)) (.cse14 (not .cse10)) (.cse11 (not (= ~m_st~0 0))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse8) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse2 (not (<= ~token~0 .cse9)) (not (<= .cse9 ~token~0)) .cse10 (not .cse3) .cse6 .cse11 .cse8)) (or .cse0 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse14 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8) (or .cse0 .cse12 .cse3 .cse4 .cse6 .cse13 .cse14 .cse11 .cse8)))) [2020-08-22 23:18:07,908 INFO L264 CegarLoopResult]: At program point L134(lines 134 139) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (= ~m_pc~0 1)) (.cse6 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= ~token~0 ~local~0)) .cse4 .cse5 .cse6 (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0))))) [2020-08-22 23:18:07,909 INFO L271 CegarLoopResult]: At program point L133(lines 133 142) the Hoare annotation is: true [2020-08-22 23:18:07,909 INFO L271 CegarLoopResult]: At program point L133-2(lines 133 142) the Hoare annotation is: true [2020-08-22 23:18:07,909 INFO L264 CegarLoopResult]: At program point L287-1(lines 276 299) the Hoare annotation is: (let ((.cse10 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not .cse13)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (and .cse10 (= ~E_M~0 |old(~E_M~0)|))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse11 (= ~m_pc~0 1)) (.cse12 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9) (or .cse0 .cse1 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9) (or .cse0 .cse3 .cse13 .cse4 .cse5 .cse7 .cse8 .cse11 .cse12 (not (= ~m_st~0 0)))))) [2020-08-22 23:18:07,909 INFO L264 CegarLoopResult]: At program point L283(line 283) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse4 (not .cse12)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1)) (.cse10 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse11) (or .cse0 .cse5 .cse12 .cse6 .cse2 .cse8 .cse9 .cse3 .cse10 (not (= ~m_st~0 0)))))) [2020-08-22 23:18:07,909 INFO L264 CegarLoopResult]: At program point L277-1(lines 276 299) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse4 (not .cse12)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1)) (.cse10 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse11) (or .cse0 .cse5 .cse12 .cse6 .cse2 .cse8 .cse9 .cse3 .cse10 (not (= ~m_st~0 0)))))) [2020-08-22 23:18:07,910 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse3 (= ~m_pc~0 1)) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse1 (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)|))) (.cse4 (not .cse11)) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse12 (not (= ~t1_st~0 0))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse10) (or .cse0 .cse1 .cse5 .cse11 .cse6 .cse8 .cse9 .cse3 .cse12 (not (= ~m_st~0 0))) (or .cse0 .cse2 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10)))) [2020-08-22 23:18:07,910 INFO L264 CegarLoopResult]: At program point L292-1(lines 273 300) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse7 (not (= ~t1_st~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse8 (not (<= 2 ~m_st~0))) (.cse9 (not .cse2)) (.cse1 (= |old(~E_M~0)| 1)) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (= |old(~E_M~0)| 0)) (.cse10 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse11 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 1) .cse7 (not (= ~m_st~0 0))) (or .cse0 .cse8 .cse9 .cse1 .cse4 .cse3 .cse10 .cse5 .cse6 .cse7 .cse11) (or .cse0 .cse8 .cse9 .cse1 .cse3 .cse4 .cse10 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse11)))) [2020-08-22 23:18:07,910 INFO L264 CegarLoopResult]: At program point L288(line 288) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse2 (= ~m_pc~0 1)) (.cse9 (not (= ~t1_st~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (not .cse11)) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse2) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse3 .cse11 .cse5 .cse7 .cse8 .cse2 .cse9 (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse10)))) [2020-08-22 23:18:07,910 INFO L264 CegarLoopResult]: At program point L282-1(lines 276 299) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse4 (not .cse12)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1)) (.cse10 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse11) (or .cse0 .cse5 .cse12 .cse6 .cse2 .cse8 .cse9 .cse3 .cse10 (not (= ~m_st~0 0)))))) [2020-08-22 23:18:07,912 INFO L264 CegarLoopResult]: At program point L278(line 278) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse3 (= ~m_pc~0 1)) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse1 (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)|))) (.cse4 (not .cse11)) (.cse5 (= |old(~E_M~0)| 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse12 (not (= ~t1_st~0 0))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse10) (or .cse0 .cse1 .cse5 .cse11 .cse6 .cse8 .cse9 .cse3 .cse12 (not (= ~m_st~0 0))) (or .cse0 .cse2 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10)))) [2020-08-22 23:18:07,912 INFO L264 CegarLoopResult]: At program point reset_delta_eventsEXIT(lines 273 300) the Hoare annotation is: (let ((.cse2 (= ~t1_pc~0 1))) (let ((.cse7 (not (= ~t1_st~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse8 (not (<= 2 ~m_st~0))) (.cse9 (not .cse2)) (.cse1 (= |old(~E_M~0)| 1)) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (= |old(~E_M~0)| 0)) (.cse10 (not (<= ~token~0 ~local~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse11 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 1) .cse7 (not (= ~m_st~0 0))) (or .cse0 .cse8 .cse9 .cse1 .cse4 .cse3 .cse10 .cse5 .cse6 .cse7 .cse11) (or .cse0 .cse8 .cse9 .cse1 .cse3 .cse4 .cse10 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse11)))) [2020-08-22 23:18:07,912 INFO L264 CegarLoopResult]: At program point L293(line 293) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse2 (= ~m_pc~0 1)) (.cse9 (not (= ~t1_st~0 0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (not .cse11)) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse10 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 (= ~E_1~0 |old(~E_1~0)|) .cse2) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse3 .cse11 .cse5 .cse7 .cse8 .cse2 .cse9 (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse10)))) [2020-08-22 23:18:07,912 INFO L264 CegarLoopResult]: At program point L161(line 161) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-08-22 23:18:07,912 INFO L264 CegarLoopResult]: At program point L160-1(lines 159 172) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-08-22 23:18:07,913 INFO L264 CegarLoopResult]: At program point init_threadsEXIT(lines 156 173) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-08-22 23:18:07,913 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-08-22 23:18:07,913 INFO L264 CegarLoopResult]: At program point L168(line 168) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-08-22 23:18:07,913 INFO L264 CegarLoopResult]: At program point L166(line 166) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-08-22 23:18:07,913 INFO L264 CegarLoopResult]: At program point L165-1(lines 156 173) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (and (= ~t1_st~0 0) (= ~m_st~0 0)) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-08-22 23:18:07,913 INFO L264 CegarLoopResult]: At program point L163(line 163) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= ~t1_pc~0 1) (not (= |old(~m_st~0)| 0)) (= ~E_M~0 1) (= ~E_M~0 0) (not (= ~t1_i~0 1)) (= ~m_pc~0 1) (not (<= 2 ~E_1~0))) [2020-08-22 23:18:07,914 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~m_i~0)| ~m_i~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (= |old(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-08-22 23:18:07,914 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 462 473) the Hoare annotation is: true [2020-08-22 23:18:07,914 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 462 473) the Hoare annotation is: true [2020-08-22 23:18:07,915 INFO L271 CegarLoopResult]: At program point L471(line 471) the Hoare annotation is: true [2020-08-22 23:18:07,915 INFO L271 CegarLoopResult]: At program point L468(line 468) the Hoare annotation is: true [2020-08-22 23:18:07,915 INFO L264 CegarLoopResult]: At program point L467(line 467) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~m_i~0)| ~m_i~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (= |old(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-08-22 23:18:07,915 INFO L264 CegarLoopResult]: At program point L467-1(line 467) the Hoare annotation is: (or (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~t1_i~0 1) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~m_i~0 1) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (= |old(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-08-22 23:18:07,915 INFO L271 CegarLoopResult]: At program point errorEXIT(lines 6 13) the Hoare annotation is: true [2020-08-22 23:18:07,916 INFO L271 CegarLoopResult]: At program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: true [2020-08-22 23:18:07,917 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-08-22 23:18:07,917 INFO L271 CegarLoopResult]: At program point errorFINAL(lines 6 13) the Hoare annotation is: true [2020-08-22 23:18:07,918 INFO L264 CegarLoopResult]: At program point masterEXIT(lines 30 73) the Hoare annotation is: (let ((.cse5 (= ~E_M~0 1)) (.cse6 (= ~E_M~0 0))) (let ((.cse13 (= ~t1_st~0 0)) (.cse12 (<= 2 ~m_st~0)) (.cse19 (not .cse6)) (.cse20 (not .cse5)) (.cse14 (<= ~token~0 ~local~0)) (.cse17 (= ~t1_i~0 1)) (.cse15 (<= 2 ~E_1~0)) (.cse18 (= ~m_i~0 1)) (.cse16 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse11)) (.cse2 (and (<= 2 ~t1_st~0) .cse12 .cse11 .cse19 .cse20 .cse14 .cse17 .cse15 .cse18 .cse16)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (and .cse12 .cse11 .cse19 .cse13 .cse20 .cse14 .cse17 .cse15 .cse18 .cse16)) (.cse0 (not .cse18)) (.cse3 (= |old(~m_pc~0)| 1)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not .cse17))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse10)) .cse4 .cse6 .cse5 .cse7 .cse8 .cse9 (not (<= .cse10 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse11 .cse3 (and .cse12 .cse13 .cse14 .cse15 .cse16) .cse5 .cse6 .cse7 .cse8))))) [2020-08-22 23:18:07,918 INFO L264 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: (let ((.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0))) (let ((.cse12 (= ~t1_st~0 0)) (.cse11 (= ~t1_pc~0 1)) (.cse18 (not .cse7)) (.cse19 (not .cse6)) (.cse13 (<= ~token~0 ~local~0)) (.cse16 (= ~t1_i~0 1)) (.cse14 (<= 2 ~E_1~0)) (.cse17 (= ~m_i~0 1)) (.cse15 (<= ~local~0 ~token~0))) (let ((.cse0 (and (<= 2 ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) .cse11 .cse18 .cse19 .cse13 .cse16 .cse14 .cse17 .cse15 (= |old(~t1_st~0)| ~t1_st~0))) (.cse3 (not .cse11)) (.cse2 (and .cse11 .cse18 .cse12 .cse19 .cse16 .cse13 .cse14 .cse17 .cse15)) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (not .cse17)) (.cse4 (= |old(~m_pc~0)| 1)) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse3 .cse2 (not (<= |old(~token~0)| .cse10)) .cse5 .cse7 .cse6 .cse8 .cse9 (not (<= .cse10 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse1 .cse11 .cse4 .cse6 .cse7 .cse8 (and .cse12 .cse13 .cse14 .cse15) .cse9))))) [2020-08-22 23:18:07,918 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (let ((.cse6 (= ~t1_pc~0 1))) (let ((.cse7 (= |old(~m_pc~0)| 1)) (.cse4 (not (= ~m_pc~0 1))) (.cse0 (not (= ~m_i~0 1))) (.cse12 (not .cse6)) (.cse13 (not (<= 2 |old(~t1_st~0)|))) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= ~E_1~0 |old(~E_1~0)|)) (.cse3 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= ~E_M~0 1)) (.cse9 (= ~E_M~0 0)) (.cse10 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (= ~t1_i~0 1)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (and .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse7 .cse13 .cse8 .cse9 .cse10 .cse11 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse14)) (let ((.cse15 (+ |old(~local~0)| 1))) (or .cse0 .cse12 (not (<= |old(~token~0)| .cse15)) .cse13 (and .cse1 .cse2 .cse3 .cse5 .cse14) .cse8 .cse9 .cse10 .cse11 (not (<= .cse15 |old(~token~0)|))))))) [2020-08-22 23:18:07,919 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse8 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (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)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 .cse8 (not (<= |old(~token~0)| .cse9)) .cse10 .cse4 .cse3 .cse5 .cse6 .cse7 (not (<= .cse9 |old(~token~0)|)))) (or .cse0 .cse8 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-08-22 23:18:07,919 INFO L264 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1))) (let ((.cse5 (= |old(~m_pc~0)| 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (not (= ~m_i~0 1))) (.cse10 (not .cse4)) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1)))) (and (or (and .cse0 .cse1 (= ~t1_st~0 0) .cse2) (not (= |old(~t1_st~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse3 .cse10 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9 (and .cse0 .cse1 .cse2 .cse12)) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse3 .cse10 (not (<= |old(~token~0)| .cse13)) .cse11 .cse6 .cse7 (and .cse0 .cse1 .cse12) .cse8 .cse9 (not (<= .cse13 |old(~token~0)|))))))) [2020-08-22 23:18:07,919 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse8 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (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)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 .cse8 (not (<= |old(~token~0)| .cse9)) .cse10 .cse4 .cse3 .cse5 .cse6 .cse7 (not (<= .cse9 |old(~token~0)|)))) (or .cse0 .cse8 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-08-22 23:18:07,919 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse7 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse9 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (let ((.cse8 (+ |old(~local~0)| 1))) (or .cse0 .cse7 (not (<= |old(~token~0)| .cse8)) .cse9 .cse3 .cse4 .cse5 .cse6 (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)) (not (<= .cse8 |old(~token~0)|)))) (or .cse0 .cse7 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6)))) [2020-08-22 23:18:07,920 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse5 (= ~E_M~0 1)) (.cse6 (= ~E_M~0 0))) (let ((.cse13 (= ~t1_st~0 0)) (.cse12 (<= 2 ~m_st~0)) (.cse19 (not .cse6)) (.cse20 (not .cse5)) (.cse14 (<= ~token~0 ~local~0)) (.cse17 (= ~t1_i~0 1)) (.cse15 (<= 2 ~E_1~0)) (.cse18 (= ~m_i~0 1)) (.cse16 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse11)) (.cse2 (and (<= 2 ~t1_st~0) .cse12 .cse11 .cse19 .cse20 .cse14 .cse17 .cse15 .cse18 .cse16)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (and .cse12 .cse11 .cse19 .cse13 .cse20 .cse14 .cse17 .cse15 .cse18 .cse16)) (.cse0 (not .cse18)) (.cse3 (= |old(~m_pc~0)| 1)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not .cse17))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse10)) .cse4 .cse6 .cse5 .cse7 .cse8 .cse9 (not (<= .cse10 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse11 .cse3 (and .cse12 .cse13 .cse14 .cse15 .cse16) .cse5 .cse6 .cse7 .cse8))))) [2020-08-22 23:18:07,920 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse8 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not .cse8)) (.cse9 (= |old(~m_pc~0)| 1)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (= ~E_M~0 1)) (.cse5 (= ~E_M~0 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1)))) (and (let ((.cse2 (+ |old(~local~0)| 1))) (or .cse0 .cse1 (not (<= |old(~token~0)| .cse2)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= .cse2 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse8 .cse9 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-08-22 23:18:07,920 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse8 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (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)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 .cse8 (not (<= |old(~token~0)| .cse9)) .cse10 .cse4 .cse3 .cse5 .cse6 .cse7 (not (<= .cse9 |old(~token~0)|)))) (or .cse0 .cse8 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-08-22 23:18:07,922 INFO L264 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (let ((.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0))) (let ((.cse6 (= ~t1_st~0 0)) (.cse1 (= ~t1_pc~0 1)) (.cse16 (not .cse4)) (.cse17 (not .cse3)) (.cse7 (<= ~token~0 ~local~0)) (.cse18 (= ~t1_i~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse19 (= ~m_i~0 1)) (.cse9 (<= ~local~0 ~token~0))) (let ((.cse11 (and (<= 2 ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) .cse1 .cse16 .cse17 .cse7 .cse18 .cse8 .cse19 .cse9 (= |old(~t1_st~0)| ~t1_st~0))) (.cse0 (not .cse19)) (.cse12 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse14 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not .cse18)) (.cse15 (and .cse1 .cse16 .cse6 .cse17 .cse7 .cse18 .cse8 .cse19 .cse9))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9) .cse10) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse11 .cse0 .cse12 (not (<= |old(~token~0)| .cse13)) .cse14 .cse4 .cse3 .cse5 .cse10 .cse15 (not (<= .cse13 |old(~token~0)|)))) (or .cse11 .cse0 .cse12 .cse2 .cse14 .cse3 .cse4 .cse5 .cse10 .cse15))))) [2020-08-22 23:18:07,922 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0 1))) (let ((.cse6 (not .cse14)) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (= |old(~t1_st~0)| ~t1_st~0)) (.cse0 (not (= ~m_i~0 1))) (.cse7 (= |old(~m_pc~0)| 1)) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (<= ~token~0 ~local~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (<= ~local~0 ~token~0)) (.cse9 (= ~E_M~0 1)) (.cse10 (= ~E_M~0 0)) (.cse11 (not (<= 2 |old(~E_1~0)|))) (.cse12 (not (= ~t1_i~0 1)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse0 .cse6 (not (<= |old(~token~0)| .cse13)) .cse8 .cse9 .cse10 (and .cse1 .cse2 .cse4 .cse5) .cse11 .cse12 (not (<= .cse13 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse14 .cse7 (and .cse1 (= ~t1_st~0 0) .cse2 .cse3 .cse4) .cse9 .cse10 .cse11 .cse12)))) [2020-08-22 23:18:07,922 INFO L264 CegarLoopResult]: At program point L51-1(line 51) the Hoare annotation is: (let ((.cse5 (= ~E_M~0 0)) (.cse4 (= ~E_M~0 1)) (.cse15 (= ~t1_i~0 1)) (.cse12 (= ~t1_st~0 0)) (.cse13 (<= ~token~0 ~local~0)) (.cse16 (= ~m_i~0 1)) (.cse14 (<= ~local~0 ~token~0)) (.cse11 (= ~t1_pc~0 1))) (let ((.cse1 (not .cse11)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (and .cse11 .cse12 .cse13 .cse16 .cse14)) (.cse9 (and (<= 2 ~t1_st~0) .cse11 (= ~m_st~0 |old(~m_st~0)|) (not .cse5) (not .cse4) .cse13 .cse15 .cse16 .cse14 (= |old(~t1_st~0)| ~t1_st~0))) (.cse0 (not .cse16)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not .cse15))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse0 .cse1 (not (<= |old(~token~0)| .cse10)) .cse3 .cse5 .cse4 .cse6 .cse7 .cse8 .cse9 (not (<= .cse10 |old(~token~0)|)))) (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse11 .cse2 .cse4 .cse5 .cse7 (and .cse12 .cse13 .cse14) .cse8)))) [2020-08-22 23:18:07,923 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1))) (let ((.cse5 (= |old(~m_pc~0)| 1)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (not (= ~m_i~0 1))) (.cse10 (not .cse4)) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (= ~E_M~0 1)) (.cse7 (= ~E_M~0 0)) (.cse0 (= ~m_st~0 |old(~m_st~0)|)) (.cse1 (= ~E_1~0 |old(~E_1~0)|)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1)))) (and (or (and .cse0 .cse1 (= ~t1_st~0 0) .cse2) (not (= |old(~t1_st~0)| 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse3 .cse10 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9 (and .cse0 .cse1 .cse2 .cse12)) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse3 .cse10 (not (<= |old(~token~0)| .cse13)) .cse11 .cse6 .cse7 (and .cse0 .cse1 .cse12) .cse8 .cse9 (not (<= .cse13 |old(~token~0)|))))))) [2020-08-22 23:18:07,923 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse8 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (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)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 .cse8 (not (<= |old(~token~0)| .cse9)) .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= .cse9 |old(~token~0)|)))) (or .cse0 .cse8 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-08-22 23:18:07,923 INFO L264 CegarLoopResult]: At program point L37(lines 37 41) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse8 (not .cse1)) (.cse2 (= |old(~m_pc~0)| 1)) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (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)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 .cse8 (not (<= |old(~token~0)| .cse9)) .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= .cse9 |old(~token~0)|)))) (or .cse0 .cse8 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-08-22 23:18:07,923 INFO L271 CegarLoopResult]: At program point fire_time_eventsEXIT(lines 337 345) the Hoare annotation is: true [2020-08-22 23:18:07,924 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= ~E_M~0 0)) (.cse4 (= ~E_M~0 1)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (= ~M_E~0 |old(~M_E~0)|)) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) .cse7 .cse8 .cse9) (or .cse0 .cse1 (= ~m_pc~0 1) .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse7 .cse8 .cse9))) [2020-08-22 23:18:07,924 INFO L271 CegarLoopResult]: At program point fire_time_eventsFINAL(lines 337 345) the Hoare annotation is: true [2020-08-22 23:18:07,924 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (not (= ~E_M~0 0)) (= ~t1_st~0 0) (not (= ~E_M~0 1)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (<= 2 ~E_1~0) (= ~m_st~0 0)) [2020-08-22 23:18:07,924 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (not (= ~E_M~0 0)) (= ~t1_st~0 0) (not (= ~E_M~0 1)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (<= 2 ~E_1~0) (= ~m_st~0 0)) [2020-08-22 23:18:07,924 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (not (= ~E_M~0 0)) (= ~t1_st~0 0) (not (= ~E_M~0 1)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (<= 2 ~E_1~0) (= ~m_st~0 0) (= |old(~token~0)| ~token~0)) [2020-08-22 23:18:07,924 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (not (= ~E_M~0 0)) (= ~t1_st~0 0) (not (= ~E_M~0 1)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (= ~m_st~0 0) (= |old(~token~0)| ~token~0)) [2020-08-22 23:18:07,924 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (= ~t1_st~0 0) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-08-22 23:18:07,925 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (= ~t1_st~0 0) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-08-22 23:18:07,925 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-08-22 23:18:07,925 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~m_pc~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-08-22 23:18:07,925 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (not (= ~t1_pc~0 1)) (= ~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) (not (= ~m_pc~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~m_i~0)| ~m_i~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-08-22 23:18:07,925 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (not (= ~t1_pc~0 1)) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~m_pc~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~m_i~0)| ~m_i~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-08-22 23:18:07,926 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (not (= ~t1_pc~0 1)) (= ~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)|) (= ~T1_E~0 |old(~T1_E~0)|) (not (= ~m_pc~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) [2020-08-22 23:18:07,926 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (= ~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)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (not (= ~m_pc~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-08-22 23:18:07,926 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(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-08-22 23:18:07,926 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (not (= ~E_M~0 0)) (= ~t1_st~0 0) (not (= ~E_M~0 1)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (<= 2 ~E_1~0) (= ~m_st~0 0)) [2020-08-22 23:18:07,927 INFO L264 CegarLoopResult]: At program point L225(line 225) the Hoare annotation is: (let ((.cse13 (<= 2 ~m_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse22 (= ~t1_i~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (not (= eval_~tmp~0 0))) (.cse21 (= ~m_i~0 1)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse20)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse11 (and .cse13 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse14 (not (= ~E_M~0 1)) .cse15 .cse22 .cse16 .cse17 .cse21 .cse18)) (.cse12 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse8 (not .cse22)) (.cse0 (not .cse21)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse6 (and .cse13 (not (= ~m_pc~0 1)) .cse21)) (.cse7 (not (<= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse6 .cse9) (let ((.cse19 (= ~E_M~0 |old(~E_M~0)|))) (or .cse11 .cse12 .cse3 (not (= |old(~m_st~0)| 0)) .cse8 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse0 .cse10 .cse1 .cse6 .cse7 .cse20 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 (= |old(~token~0)| ~token~0))))))) [2020-08-22 23:18:07,927 INFO L264 CegarLoopResult]: At program point L213(lines 213 220) the Hoare annotation is: (let ((.cse6 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse23 (= ~t1_i~0 1)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse3 (= |old(~m_pc~0)| 1)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse19 (not .cse15)) (.cse4 (= |old(~E_M~0)| 0)) (.cse20 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse21 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse16 (not .cse23)) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse17 (let ((.cse22 (+ ~local~0 1))) (and .cse6 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse7 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse23 (<= 2 ~E_1~0) .cse9 .cse10)))) (and (let ((.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (and .cse5 (let ((.cse8 (not (= ~m_pc~0 1)))) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse6 .cse7 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse8 .cse9 .cse10)))) .cse13) .cse14 .cse15 .cse16 (and (= ~local~0 |old(~local~0)|) .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse9 .cse10 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse13 .cse11) .cse17)) (or .cse0 .cse3 .cse18) (or .cse0 .cse2 .cse19 .cse4 .cse20 (not (<= 2 |old(~t1_st~0)|)) .cse21 .cse14 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse20 .cse21 .cse14 .cse16 .cse18 .cse17)))) [2020-08-22 23:18:07,927 INFO L264 CegarLoopResult]: At program point L205(lines 205 209) the Hoare annotation is: (let ((.cse25 (not (= ~m_pc~0 1))) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse26 (= ~m_st~0 0)) (.cse23 (<= 2 ~t1_st~0)) (.cse15 (<= 2 ~m_st~0)) (.cse24 (= ~t1_pc~0 1)) (.cse34 (not (= ~E_M~0 0))) (.cse16 (= ~t1_st~0 0)) (.cse35 (not (= ~E_M~0 1))) (.cse17 (<= ~token~0 ~local~0)) (.cse32 (= ~t1_i~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse19 (not (= eval_~tmp~0 0))) (.cse31 (= ~m_i~0 1)) (.cse20 (<= ~local~0 ~token~0))) (let ((.cse1 (and .cse15 .cse24 .cse34 .cse16 .cse35 .cse17 .cse32 .cse18 .cse19 .cse31 .cse20)) (.cse3 (and .cse23 .cse15 .cse24 .cse34 .cse35 .cse17 .cse32 .cse18 .cse31 .cse20)) (.cse6 (not (= |old(~t1_st~0)| 0))) (.cse13 (let ((.cse33 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse33) (<= .cse33 ~token~0) .cse24 .cse34 .cse35 .cse32 .cse18 .cse26 .cse19))) (.cse7 (= |old(~E_M~0)| 1)) (.cse0 (not .cse29)) (.cse22 (= ~E_1~0 |old(~E_1~0)|)) (.cse30 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse27 (= |old(~token~0)| ~token~0)) (.cse2 (= |old(~E_M~0)| 0)) (.cse8 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse11 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not .cse32)) (.cse5 (not .cse31)) (.cse14 (= |old(~m_pc~0)| 1)) (.cse10 (and .cse15 .cse25 .cse31)) (.cse12 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse14 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse5 .cse6 .cse7 .cse10 (and .cse22 (or (and .cse23 .cse24 .cse25 .cse26 .cse19 .cse27) (let ((.cse28 (+ |old(~token~0)| 1))) (and .cse23 .cse24 (<= .cse28 ~token~0) (<= ~token~0 .cse28) .cse25 .cse26 .cse19))) .cse21) .cse11 .cse29 (and (= ~local~0 |old(~local~0)|) .cse22 (= ~m_pc~0 |old(~m_pc~0)|) .cse26 .cse19 (= |old(~t1_pc~0)| ~t1_pc~0) .cse30 .cse21 .cse27) .cse13) (or .cse5 .cse7 .cse0 (and (= ~m_st~0 |old(~m_st~0)|) .cse24 .cse22 .cse17 .cse20 .cse30 .cse21 .cse27) .cse2 .cse8 (not (<= 2 |old(~t1_st~0)|)) .cse9 .cse10 .cse11 .cse4 .cse12) (or .cse5 .cse14 .cse10 .cse12)))) [2020-08-22 23:18:07,928 INFO L264 CegarLoopResult]: At program point L205-1(lines 200 238) the Hoare annotation is: (let ((.cse25 (not (= ~m_pc~0 1))) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse26 (= ~m_st~0 0)) (.cse23 (<= 2 ~t1_st~0)) (.cse15 (<= 2 ~m_st~0)) (.cse24 (= ~t1_pc~0 1)) (.cse34 (not (= ~E_M~0 0))) (.cse16 (= ~t1_st~0 0)) (.cse35 (not (= ~E_M~0 1))) (.cse17 (<= ~token~0 ~local~0)) (.cse32 (= ~t1_i~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse19 (not (= eval_~tmp~0 0))) (.cse31 (= ~m_i~0 1)) (.cse20 (<= ~local~0 ~token~0))) (let ((.cse1 (and .cse15 .cse24 .cse34 .cse16 .cse35 .cse17 .cse32 .cse18 .cse19 .cse31 .cse20)) (.cse4 (and .cse23 .cse15 .cse24 .cse34 .cse35 .cse17 .cse32 .cse18 .cse19 .cse20)) (.cse6 (not (= |old(~t1_st~0)| 0))) (.cse13 (let ((.cse33 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse33) (<= .cse33 ~token~0) .cse24 .cse34 .cse35 .cse32 .cse18 .cse26 .cse19))) (.cse7 (= |old(~E_M~0)| 1)) (.cse0 (not .cse29)) (.cse2 (= |old(~E_M~0)| 0)) (.cse8 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse11 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not .cse32)) (.cse22 (= ~E_1~0 |old(~E_1~0)|)) (.cse30 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse27 (= |old(~token~0)| ~token~0)) (.cse5 (not .cse31)) (.cse14 (= |old(~m_pc~0)| 1)) (.cse10 (and .cse15 .cse25 .cse31)) (.cse12 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse14 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse5 .cse6 .cse7 .cse10 (and .cse22 (or (and .cse23 .cse24 .cse25 .cse26 .cse19 .cse27) (let ((.cse28 (+ |old(~token~0)| 1))) (and .cse23 .cse24 (<= .cse28 ~token~0) (<= ~token~0 .cse28) .cse25 .cse26 .cse19))) .cse21) .cse11 .cse29 (and (= ~local~0 |old(~local~0)|) .cse22 (= ~m_pc~0 |old(~m_pc~0)|) .cse26 .cse19 (= |old(~t1_pc~0)| ~t1_pc~0) .cse30 .cse21 .cse27) .cse13) (or .cse5 .cse7 .cse0 .cse2 .cse8 (not (<= 2 |old(~t1_st~0)|)) .cse9 .cse10 .cse11 .cse3 (and .cse24 (= ~m_st~0 |old(~m_st~0)|) .cse22 .cse17 .cse19 .cse20 .cse30 .cse21 .cse27) .cse12) (or .cse5 .cse14 .cse10 .cse12)))) [2020-08-22 23:18:07,928 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse32 (not (= ~m_pc~0 1))) (.cse15 (= ~local~0 |old(~local~0)|)) (.cse19 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse17 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse18 (= ~m_st~0 0)) (.cse30 (<= 2 ~t1_st~0)) (.cse24 (<= 2 ~m_st~0)) (.cse36 (not (= ~E_M~0 0))) (.cse25 (= ~t1_st~0 0)) (.cse37 (not (= ~E_M~0 1))) (.cse41 (= ~t1_i~0 1)) (.cse27 (<= 2 ~E_1~0)) (.cse28 (not (= eval_~tmp~0 0))) (.cse35 (= ~m_i~0 1)) (.cse39 (= ~m_st~0 |old(~m_st~0)|)) (.cse31 (= ~t1_pc~0 1)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse26 (<= ~token~0 ~local~0)) (.cse29 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse22 (= |old(~token~0)| ~token~0)) (.cse34 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse34)) (.cse3 (and .cse39 .cse31 .cse16 .cse26 .cse29 .cse20 .cse21 .cse22)) (.cse5 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse11 (and .cse24 .cse31 .cse36 .cse25 .cse37 .cse26 .cse41 .cse27 .cse28 .cse35 .cse29)) (.cse4 (= |old(~E_M~0)| 0)) (.cse9 (not .cse41)) (.cse12 (and .cse30 .cse24 .cse31 .cse36 .cse37 .cse26 .cse41 .cse27 .cse28 .cse29)) (.cse13 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse14 (and .cse36 .cse37 (let ((.cse42 (+ ~local~0 1))) (let ((.cse38 (<= ~token~0 .cse42)) (.cse40 (<= .cse42 ~token~0))) (or (and .cse38 .cse15 .cse39 .cse18 .cse19 .cse21 .cse30 .cse40 .cse31 .cse16 .cse17 .cse41 .cse35 .cse20 .cse22) (and .cse30 .cse38 .cse40 .cse31 .cse41 .cse27 .cse18 .cse28 .cse35)))))) (.cse0 (not .cse35)) (.cse23 (= |old(~m_pc~0)| 1)) (.cse7 (and .cse24 .cse32 .cse35)) (.cse10 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 |old(~t1_st~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse2 .cse11 .cse4 .cse9 .cse12 .cse0 .cse13 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse14 .cse10) (or (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse11 .cse23 .cse4 (not (= |old(~m_st~0)| 0)) .cse9 .cse12 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse21) .cse0 .cse13 .cse1 .cse7 (and .cse16 (or (and .cse30 .cse31 .cse32 .cse18 .cse28 .cse22) (let ((.cse33 (+ |old(~token~0)| 1))) (and .cse30 .cse31 (<= .cse33 ~token~0) (<= ~token~0 .cse33) .cse32 .cse18 .cse28))) .cse21) .cse8 .cse34 .cse14) (or .cse0 .cse23 .cse7 .cse10)))) [2020-08-22 23:18:07,929 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse13 (not (= ~m_pc~0 1))) (.cse23 (= ~m_i~0 1)) (.cse18 (<= 2 ~m_st~0)) (.cse12 (= ~t1_pc~0 1)) (.cse19 (<= ~token~0 ~local~0)) (.cse24 (= ~t1_i~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse20 (<= 2 ~E_1~0)) (.cse15 (not (= eval_~tmp~0 0))) (.cse21 (<= ~local~0 ~token~0)) (.cse22 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse22)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse11 (and .cse18 .cse12 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse19 .cse24 .cse14 .cse20 .cse15 .cse21)) (.cse3 (= |old(~E_M~0)| 0)) (.cse8 (not .cse24)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse0 (not .cse23)) (.cse17 (= |old(~m_pc~0)| 1)) (.cse6 (and .cse18 .cse13 .cse23)) (.cse9 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse16 (= ~E_M~0 |old(~E_M~0)|))) (or .cse11 (and (not .cse12) (= ~E_1~0 |old(~E_1~0)|) .cse13 .cse14 (= ~m_st~0 0) .cse15 .cse16 (= |old(~token~0)| ~token~0)) .cse17 .cse3 (not (= |old(~m_st~0)| 0)) (and .cse18 .cse19 .cse14 .cse20 .cse15 .cse21 .cse16) .cse8 .cse0 .cse10 .cse1 .cse6 .cse7 .cse22)) (or .cse0 .cse17 .cse6 .cse9)))) [2020-08-22 23:18:07,929 INFO L264 CegarLoopResult]: At program point L226(line 226) the Hoare annotation is: (let ((.cse13 (<= 2 ~m_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse22 (= ~t1_i~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (not (= eval_~tmp~0 0))) (.cse21 (= ~m_i~0 1)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse20)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse11 (and .cse13 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse14 (not (= ~E_M~0 1)) .cse15 .cse22 .cse16 .cse17 .cse21 .cse18)) (.cse12 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse8 (not .cse22)) (.cse0 (not .cse21)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse6 (and .cse13 (not (= ~m_pc~0 1)) .cse21)) (.cse7 (not (<= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse6 .cse9) (let ((.cse19 (= ~E_M~0 |old(~E_M~0)|))) (or .cse11 .cse12 .cse3 (not (= |old(~m_st~0)| 0)) .cse8 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse0 .cse10 .cse1 .cse6 .cse7 .cse20 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 (= |old(~token~0)| ~token~0))))))) [2020-08-22 23:18:07,929 INFO L264 CegarLoopResult]: At program point L226-1(line 226) the Hoare annotation is: (let ((.cse13 (<= 2 ~m_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse22 (= ~t1_i~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (not (= eval_~tmp~0 0))) (.cse21 (= ~m_i~0 1)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse20)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse11 (and .cse13 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse14 (not (= ~E_M~0 1)) .cse15 .cse22 .cse16 .cse17 .cse21 .cse18)) (.cse12 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse8 (not .cse22)) (.cse0 (not .cse21)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse6 (and .cse13 (not (= ~m_pc~0 1)) .cse21)) (.cse7 (not (<= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse6 .cse9) (let ((.cse19 (= ~E_M~0 |old(~E_M~0)|))) (or .cse11 .cse12 .cse3 (not (= |old(~m_st~0)| 0)) .cse8 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse0 .cse10 .cse1 .cse6 .cse7 .cse20 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 (= |old(~token~0)| ~token~0))))))) [2020-08-22 23:18:07,930 INFO L264 CegarLoopResult]: At program point L226-2(line 226) the Hoare annotation is: (let ((.cse13 (<= 2 ~m_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse22 (= ~t1_i~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (not (= eval_~tmp~0 0))) (.cse21 (= ~m_i~0 1)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse20)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse11 (and .cse13 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse14 (not (= ~E_M~0 1)) .cse15 .cse22 .cse16 .cse17 .cse21 .cse18)) (.cse12 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse8 (not .cse22)) (.cse0 (not .cse21)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse6 (and .cse13 (not (= ~m_pc~0 1)) .cse21)) (.cse7 (not (<= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse6 .cse9) (let ((.cse19 (= ~E_M~0 |old(~E_M~0)|))) (or .cse11 .cse12 .cse3 (not (= |old(~m_st~0)| 0)) .cse8 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse0 .cse10 .cse1 .cse6 .cse7 .cse20 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 (= |old(~token~0)| ~token~0))))))) [2020-08-22 23:18:07,930 INFO L264 CegarLoopResult]: At program point evalEXIT(lines 194 244) the Hoare annotation is: (let ((.cse18 (= ~m_i~0 1)) (.cse17 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse13 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not .cse15)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse8 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (= ~t1_i~0 1))) (.cse16 (and (<= 2 ~t1_st~0) .cse17 .cse3 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse4 (<= 2 ~E_1~0) .cse5)) (.cse0 (not .cse18)) (.cse14 (= |old(~m_pc~0)| 1)) (.cse9 (and .cse17 (not (= ~m_pc~0 1)) .cse18)) (.cse12 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (and (= ~m_st~0 |old(~m_st~0)|) .cse3 (= ~E_1~0 |old(~E_1~0)|) .cse4 .cse5 (= |old(~t1_st~0)| ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) .cse6 .cse7 (not (<= 2 |old(~t1_st~0)|)) .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse13 .cse1 .cse14 .cse6 (not (= |old(~m_st~0)| 0)) .cse9 .cse10 .cse15 .cse11 .cse16) (or .cse0 .cse13 .cse1 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (or .cse0 .cse14 .cse9 .cse12)))) [2020-08-22 23:18:07,930 INFO L264 CegarLoopResult]: At program point L210(lines 200 238) the Hoare annotation is: (let ((.cse25 (not (= ~m_pc~0 1))) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse26 (= ~m_st~0 0)) (.cse23 (<= 2 ~t1_st~0)) (.cse15 (<= 2 ~m_st~0)) (.cse24 (= ~t1_pc~0 1)) (.cse34 (not (= ~E_M~0 0))) (.cse16 (= ~t1_st~0 0)) (.cse35 (not (= ~E_M~0 1))) (.cse17 (<= ~token~0 ~local~0)) (.cse32 (= ~t1_i~0 1)) (.cse18 (<= 2 ~E_1~0)) (.cse19 (not (= eval_~tmp~0 0))) (.cse31 (= ~m_i~0 1)) (.cse20 (<= ~local~0 ~token~0))) (let ((.cse1 (and .cse15 .cse24 .cse34 .cse16 .cse35 .cse17 .cse32 .cse18 .cse19 .cse31 .cse20)) (.cse4 (and .cse23 .cse15 .cse24 .cse34 .cse35 .cse17 .cse32 .cse18 .cse19 .cse20)) (.cse6 (not (= |old(~t1_st~0)| 0))) (.cse13 (let ((.cse33 (+ ~local~0 1))) (and .cse23 (<= ~token~0 .cse33) (<= .cse33 ~token~0) .cse24 .cse34 .cse35 .cse32 .cse18 .cse26 .cse19))) (.cse7 (= |old(~E_M~0)| 1)) (.cse0 (not .cse29)) (.cse2 (= |old(~E_M~0)| 0)) (.cse8 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse11 (not (<= 2 |old(~E_1~0)|))) (.cse3 (not .cse32)) (.cse22 (= ~E_1~0 |old(~E_1~0)|)) (.cse30 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse27 (= |old(~token~0)| ~token~0)) (.cse5 (not .cse31)) (.cse14 (= |old(~m_pc~0)| 1)) (.cse10 (and .cse15 .cse25 .cse31)) (.cse12 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse14 .cse2 (not (= |old(~m_st~0)| 0)) .cse3 .cse4 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse5 .cse6 .cse7 .cse10 (and .cse22 (or (and .cse23 .cse24 .cse25 .cse26 .cse19 .cse27) (let ((.cse28 (+ |old(~token~0)| 1))) (and .cse23 .cse24 (<= .cse28 ~token~0) (<= ~token~0 .cse28) .cse25 .cse26 .cse19))) .cse21) .cse11 .cse29 (and (= ~local~0 |old(~local~0)|) .cse22 (= ~m_pc~0 |old(~m_pc~0)|) .cse26 .cse19 (= |old(~t1_pc~0)| ~t1_pc~0) .cse30 .cse21 .cse27) .cse13) (or .cse5 .cse7 .cse0 .cse2 .cse8 (not (<= 2 |old(~t1_st~0)|)) .cse9 .cse10 .cse11 .cse3 (and .cse24 (= ~m_st~0 |old(~m_st~0)|) .cse22 .cse17 .cse19 .cse20 .cse30 .cse21 .cse27) .cse12) (or .cse5 .cse14 .cse10 .cse12)))) [2020-08-22 23:18:07,931 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse18 (= ~m_i~0 1)) (.cse17 (<= 2 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse13 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse2 (not .cse15)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse8 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (= ~t1_i~0 1))) (.cse16 (and (<= 2 ~t1_st~0) .cse17 .cse3 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse4 (<= 2 ~E_1~0) .cse5)) (.cse0 (not .cse18)) (.cse14 (= |old(~m_pc~0)| 1)) (.cse9 (and .cse17 (not (= ~m_pc~0 1)) .cse18)) (.cse12 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (and (= ~m_st~0 |old(~m_st~0)|) .cse3 (= ~E_1~0 |old(~E_1~0)|) .cse4 .cse5 (= |old(~t1_st~0)| ~t1_st~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) .cse6 .cse7 (not (<= 2 |old(~t1_st~0)|)) .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse13 .cse1 .cse14 .cse6 (not (= |old(~m_st~0)| 0)) .cse9 .cse10 .cse15 .cse11 .cse16) (or .cse0 .cse13 .cse1 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (or .cse0 .cse14 .cse9 .cse12)))) [2020-08-22 23:18:07,931 INFO L264 CegarLoopResult]: At program point L227(lines 227 234) the Hoare annotation is: (let ((.cse13 (<= 2 ~m_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse22 (= ~t1_i~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (not (= eval_~tmp~0 0))) (.cse21 (= ~m_i~0 1)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse20)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse11 (and .cse13 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse14 (not (= ~E_M~0 1)) .cse15 .cse22 .cse16 .cse17 .cse21 .cse18)) (.cse12 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse8 (not .cse22)) (.cse0 (not .cse21)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse6 (and .cse13 (not (= ~m_pc~0 1)) .cse21)) (.cse7 (not (<= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse6 .cse9) (let ((.cse19 (= ~E_M~0 |old(~E_M~0)|))) (or .cse11 .cse12 .cse3 (not (= |old(~m_st~0)| 0)) .cse8 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse0 .cse10 .cse1 .cse6 .cse7 .cse20 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 (= |old(~token~0)| ~token~0))))))) [2020-08-22 23:18:07,931 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse13 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (= ~local~0 |old(~local~0)|)) (.cse6 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (= |old(~m_pc~0)| 1)) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse4 (= ~t1_st~0 0)) (.cse0 (not (= ~m_i~0 1))) (.cse9 (= |old(~E_M~0)| 1)) (.cse18 (not .cse13)) (.cse11 (= |old(~E_M~0)| 0)) (.cse19 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse20 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse12 (not (<= 2 |old(~E_1~0)|))) (.cse14 (not (= ~t1_i~0 1))) (.cse15 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (= ~t1_pc~0 1)) (.cse3 (= ~E_1~0 |old(~E_1~0)|)) (.cse5 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse22 (<= ~token~0 ~local~0)) (.cse23 (<= ~local~0 ~token~0)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse7 (= |old(~token~0)| ~token~0)) (.cse8 (= ~E_M~0 |old(~E_M~0)|)) (.cse17 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 (not (= |old(~m_st~0)| 0)) .cse12 .cse13 .cse14) (or .cse0 (and .cse2 .cse15 .cse3 .cse5 .cse6 .cse16 .cse7 .cse8) .cse10 .cse17) (or .cse0 .cse1 .cse9 .cse18 .cse11 .cse19 .cse20 (and .cse15 .cse21 .cse3 .cse4 .cse5 .cse22 .cse23 .cse7 .cse8) .cse12 .cse14 .cse17) (or .cse0 .cse9 .cse18 .cse11 .cse19 (not (<= 2 |old(~t1_st~0)|)) .cse20 .cse12 .cse14 (and .cse15 .cse21 .cse3 .cse5 .cse22 .cse23 .cse16 .cse7 .cse8) .cse17)))) [2020-08-22 23:18:07,932 INFO L264 CegarLoopResult]: At program point L215(line 215) the Hoare annotation is: (let ((.cse13 (<= 2 ~t1_st~0)) (.cse14 (= ~t1_pc~0 1)) (.cse17 (= ~m_st~0 0)) (.cse20 (not (= eval_~tmp~0 0))) (.cse24 (= ~t1_i~0 1)) (.cse18 (= ~m_i~0 1)) (.cse22 (= |old(~t1_pc~0)| 1))) (let ((.cse4 (not .cse22)) (.cse6 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse7 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not .cse18)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse1 (= |old(~m_pc~0)| 1)) (.cse5 (= |old(~E_M~0)| 0)) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not .cse24)) (.cse11 (let ((.cse23 (+ ~local~0 1))) (and .cse13 (<= ~token~0 .cse23) (<= .cse23 ~token~0) .cse14 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse24 (<= 2 ~E_1~0) .cse18 .cse17 .cse20)))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse4 .cse5 .cse6 (not (<= 2 |old(~t1_st~0)|)) .cse7 .cse8 .cse9 .cse2) (or .cse0 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse2 .cse11) (let ((.cse12 (= ~E_1~0 |old(~E_1~0)|)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse19 (= |old(~token~0)| ~token~0))) (or .cse0 .cse10 (and .cse12 (let ((.cse16 (not (= ~m_pc~0 1)))) (or (let ((.cse15 (+ |old(~token~0)| 1))) (and .cse13 .cse14 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse16 .cse17 .cse18)) (and .cse13 .cse14 .cse16 .cse17 .cse18 .cse19))) .cse20 .cse21) .cse3 .cse1 .cse5 (not (= |old(~m_st~0)| 0)) .cse8 .cse22 .cse9 (and (= ~local~0 |old(~local~0)|) .cse12 (= ~m_pc~0 |old(~m_pc~0)|) .cse17 .cse20 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse21 .cse19) .cse11))))) [2020-08-22 23:18:07,932 INFO L264 CegarLoopResult]: At program point L211(line 211) the Hoare annotation is: (let ((.cse6 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse23 (= ~t1_i~0 1)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse3 (= |old(~m_pc~0)| 1)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse19 (not .cse15)) (.cse4 (= |old(~E_M~0)| 0)) (.cse20 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse21 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse16 (not .cse23)) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse17 (let ((.cse22 (+ ~local~0 1))) (and .cse6 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse7 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse23 (<= 2 ~E_1~0) .cse9 .cse10)))) (and (let ((.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (and .cse5 (let ((.cse8 (not (= ~m_pc~0 1)))) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse6 .cse7 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse8 .cse9 .cse10)))) .cse13) .cse14 .cse15 .cse16 (and (= ~local~0 |old(~local~0)|) .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse9 .cse10 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse13 .cse11) .cse17)) (or .cse0 .cse3 .cse18) (or .cse0 .cse2 .cse19 .cse4 .cse20 (not (<= 2 |old(~t1_st~0)|)) .cse21 .cse14 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse20 .cse21 .cse14 .cse16 .cse18 .cse17)))) [2020-08-22 23:18:07,932 INFO L264 CegarLoopResult]: At program point L203(line 203) the Hoare annotation is: (let ((.cse23 (not (= ~m_pc~0 1))) (.cse18 (= ~m_st~0 0)) (.cse31 (= ~t1_st~0 0)) (.cse33 (= ~m_i~0 1)) (.cse19 (not (= |eval_#t~ret1| 0))) (.cse22 (<= 2 ~t1_st~0)) (.cse30 (<= 2 ~m_st~0)) (.cse4 (= ~t1_pc~0 1)) (.cse35 (not (= ~E_M~0 0))) (.cse36 (not (= ~E_M~0 1))) (.cse6 (<= ~token~0 ~local~0)) (.cse32 (<= 2 ~E_1~0)) (.cse24 (not (= eval_~tmp~0 0))) (.cse7 (<= ~local~0 ~token~0)) (.cse37 (= ~t1_i~0 1)) (.cse28 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse28)) (.cse11 (= |old(~E_M~0)| 0)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (= |old(~token~0)| ~token~0)) (.cse16 (not .cse37)) (.cse21 (and .cse22 .cse30 .cse4 .cse35 .cse36 .cse6 .cse37 .cse32 .cse24 .cse7)) (.cse26 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse27 (and .cse30 .cse4 .cse35 .cse31 .cse36 .cse6 .cse37 .cse32 .cse24 .cse33 .cse7 .cse19)) (.cse12 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse13 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse15 (not (<= 2 |old(~E_1~0)|))) (.cse29 (let ((.cse34 (+ ~local~0 1))) (and .cse22 (<= ~token~0 .cse34) (<= .cse34 ~token~0) .cse4 .cse35 .cse36 .cse37 .cse32 .cse18 .cse24 .cse19))) (.cse0 (not .cse33)) (.cse20 (= |old(~m_pc~0)| 1)) (.cse14 (and .cse30 .cse23 .cse33)) (.cse17 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 (not (<= 2 |old(~t1_st~0)|)) .cse13 .cse14 .cse15 .cse16 .cse17) (or (and (= ~local~0 |old(~local~0)|) .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse18 (= |old(~t1_pc~0)| ~t1_pc~0) .cse19 .cse8 .cse9 .cse10) .cse20 .cse11 (not (= |old(~m_st~0)| 0)) .cse16 .cse21 (and .cse5 (or (and .cse22 .cse4 .cse23 .cse18 .cse24 .cse19 .cse10) (let ((.cse25 (+ |old(~token~0)| 1))) (and .cse22 .cse4 (<= .cse25 ~token~0) (<= ~token~0 .cse25) .cse23 .cse18 .cse24 .cse19))) .cse9) .cse0 .cse26 .cse1 .cse27 .cse14 .cse15 .cse28 .cse29 (and .cse30 .cse31 .cse6 .cse32 .cse24 .cse7 .cse19 .cse9)) (or .cse2 .cse11 (and .cse4 .cse3 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10) .cse16 .cse21 .cse0 .cse26 .cse1 .cse27 .cse12 .cse13 .cse14 .cse15 .cse29 .cse17) (or .cse0 .cse20 .cse14 .cse17)))) [2020-08-22 23:18:07,933 INFO L264 CegarLoopResult]: At program point L203-1(line 203) the Hoare annotation is: (let ((.cse23 (not (= ~m_pc~0 1))) (.cse18 (= ~m_st~0 0)) (.cse31 (= ~t1_st~0 0)) (.cse33 (= ~m_i~0 1)) (.cse19 (not (= |eval_#t~ret1| 0))) (.cse22 (<= 2 ~t1_st~0)) (.cse30 (<= 2 ~m_st~0)) (.cse4 (= ~t1_pc~0 1)) (.cse35 (not (= ~E_M~0 0))) (.cse36 (not (= ~E_M~0 1))) (.cse6 (<= ~token~0 ~local~0)) (.cse32 (<= 2 ~E_1~0)) (.cse24 (not (= eval_~tmp~0 0))) (.cse7 (<= ~local~0 ~token~0)) (.cse37 (= ~t1_i~0 1)) (.cse28 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse28)) (.cse11 (= |old(~E_M~0)| 0)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~E_M~0 |old(~E_M~0)|)) (.cse10 (= |old(~token~0)| ~token~0)) (.cse16 (not .cse37)) (.cse21 (and .cse22 .cse30 .cse4 .cse35 .cse36 .cse6 .cse37 .cse32 .cse24 .cse7)) (.cse26 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse27 (and .cse30 .cse4 .cse35 .cse31 .cse36 .cse6 .cse37 .cse32 .cse24 .cse33 .cse7 .cse19)) (.cse12 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse13 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse15 (not (<= 2 |old(~E_1~0)|))) (.cse29 (let ((.cse34 (+ ~local~0 1))) (and .cse22 (<= ~token~0 .cse34) (<= .cse34 ~token~0) .cse4 .cse35 .cse36 .cse37 .cse32 .cse18 .cse24 .cse19))) (.cse0 (not .cse33)) (.cse20 (= |old(~m_pc~0)| 1)) (.cse14 (and .cse30 .cse23 .cse33)) (.cse17 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 (not (<= 2 |old(~t1_st~0)|)) .cse13 .cse14 .cse15 .cse16 .cse17) (or (and (= ~local~0 |old(~local~0)|) .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse18 (= |old(~t1_pc~0)| ~t1_pc~0) .cse19 .cse8 .cse9 .cse10) .cse20 .cse11 (not (= |old(~m_st~0)| 0)) .cse16 .cse21 (and .cse5 (or (and .cse22 .cse4 .cse23 .cse18 .cse24 .cse19 .cse10) (let ((.cse25 (+ |old(~token~0)| 1))) (and .cse22 .cse4 (<= .cse25 ~token~0) (<= ~token~0 .cse25) .cse23 .cse18 .cse24 .cse19))) .cse9) .cse0 .cse26 .cse1 .cse27 .cse14 .cse15 .cse28 .cse29 (and .cse30 .cse31 .cse6 .cse32 .cse24 .cse7 .cse19 .cse9)) (or .cse2 .cse11 (and .cse4 .cse3 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10) .cse16 .cse21 .cse0 .cse26 .cse1 .cse27 .cse12 .cse13 .cse14 .cse15 .cse29 .cse17) (or .cse0 .cse20 .cse14 .cse17)))) [2020-08-22 23:18:07,934 INFO L264 CegarLoopResult]: At program point L203-2(line 203) the Hoare annotation is: (let ((.cse26 (not (= ~m_pc~0 1))) (.cse23 (= ~m_st~0 0)) (.cse30 (= ~t1_st~0 0)) (.cse22 (not (= eval_~tmp~0 0))) (.cse24 (not (= |eval_#t~ret1| 0))) (.cse25 (<= 2 ~t1_st~0)) (.cse29 (<= 2 ~m_st~0)) (.cse14 (= ~t1_pc~0 1)) (.cse34 (not (= ~E_M~0 0))) (.cse35 (not (= ~E_M~0 1))) (.cse16 (<= ~token~0 ~local~0)) (.cse36 (= ~t1_i~0 1)) (.cse31 (<= 2 ~E_1~0)) (.cse32 (= ~m_i~0 1)) (.cse17 (<= ~local~0 ~token~0)) (.cse28 (= |old(~t1_pc~0)| 1))) (let ((.cse0 (not .cse28)) (.cse8 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse9 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse1 (= |old(~E_M~0)| 0)) (.cse2 (and .cse25 .cse29 .cse14 .cse34 .cse35 .cse16 .cse36 .cse31 .cse32 .cse17)) (.cse3 (not .cse36)) (.cse18 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= ~E_1~0 |old(~E_1~0)|)) (.cse20 (= |old(~token~0)| ~token~0)) (.cse5 (not (= |old(~t1_st~0)| 0))) (.cse6 (= |old(~E_M~0)| 1)) (.cse7 (and .cse29 .cse14 .cse34 .cse30 .cse35 .cse16 .cse36 .cse31 .cse22 .cse32 .cse17 .cse24)) (.cse11 (not (<= 2 |old(~E_1~0)|))) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse12 (let ((.cse33 (+ ~local~0 1))) (and .cse25 (<= ~token~0 .cse33) (<= .cse33 ~token~0) .cse14 .cse34 .cse35 .cse36 .cse31 .cse23 .cse22 .cse32 .cse24))) (.cse4 (not .cse32)) (.cse21 (= |old(~m_pc~0)| 1)) (.cse10 (and .cse29 .cse26 .cse32)) (.cse13 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse4 .cse6 .cse0 (and (= ~m_st~0 |old(~m_st~0)|) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse1 .cse8 (not (<= 2 |old(~t1_st~0)|)) .cse9 .cse10 .cse11 .cse3 .cse13) (or .cse21 .cse1 (not (= |old(~m_st~0)| 0)) .cse2 .cse3 (and (= ~local~0 |old(~local~0)|) .cse15 (= ~m_pc~0 |old(~m_pc~0)|) .cse22 .cse23 (= |old(~t1_pc~0)| ~t1_pc~0) .cse24 .cse18 .cse19 .cse20) (and .cse15 (or (and .cse25 .cse14 .cse26 .cse23 .cse22 .cse24 .cse20) (let ((.cse27 (+ |old(~token~0)| 1))) (and .cse25 .cse14 (<= .cse27 ~token~0) (<= ~token~0 .cse27) .cse26 .cse23 .cse22 .cse24))) .cse19) .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse28 (and .cse29 .cse30 .cse16 .cse31 .cse22 .cse17 .cse24 .cse19) .cse12) (or .cse4 .cse21 .cse10 .cse13)))) [2020-08-22 23:18:07,934 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse32 (not (= ~m_pc~0 1))) (.cse15 (= ~local~0 |old(~local~0)|)) (.cse19 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse17 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse18 (= ~m_st~0 0)) (.cse30 (<= 2 ~t1_st~0)) (.cse24 (<= 2 ~m_st~0)) (.cse36 (not (= ~E_M~0 0))) (.cse25 (= ~t1_st~0 0)) (.cse37 (not (= ~E_M~0 1))) (.cse41 (= ~t1_i~0 1)) (.cse27 (<= 2 ~E_1~0)) (.cse28 (not (= eval_~tmp~0 0))) (.cse35 (= ~m_i~0 1)) (.cse39 (= ~m_st~0 |old(~m_st~0)|)) (.cse31 (= ~t1_pc~0 1)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse26 (<= ~token~0 ~local~0)) (.cse29 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~E_M~0 |old(~E_M~0)|)) (.cse22 (= |old(~token~0)| ~token~0)) (.cse34 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse34)) (.cse3 (and .cse39 .cse31 .cse16 .cse26 .cse29 .cse20 .cse21 .cse22)) (.cse5 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse11 (and .cse24 .cse31 .cse36 .cse25 .cse37 .cse26 .cse41 .cse27 .cse28 .cse35 .cse29)) (.cse4 (= |old(~E_M~0)| 0)) (.cse9 (not .cse41)) (.cse12 (and .cse30 .cse24 .cse31 .cse36 .cse37 .cse26 .cse41 .cse27 .cse28 .cse29)) (.cse13 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse14 (and .cse36 .cse37 (let ((.cse42 (+ ~local~0 1))) (let ((.cse38 (<= ~token~0 .cse42)) (.cse40 (<= .cse42 ~token~0))) (or (and .cse38 .cse15 .cse39 .cse18 .cse19 .cse21 .cse30 .cse40 .cse31 .cse16 .cse17 .cse41 .cse35 .cse20 .cse22) (and .cse30 .cse38 .cse40 .cse31 .cse41 .cse27 .cse18 .cse28 .cse35)))))) (.cse0 (not .cse35)) (.cse23 (= |old(~m_pc~0)| 1)) (.cse7 (and .cse24 .cse32 .cse35)) (.cse10 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 |old(~t1_st~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse2 .cse11 .cse4 .cse9 .cse12 .cse0 .cse13 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse14 .cse10) (or (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse11 .cse23 .cse4 (not (= |old(~m_st~0)| 0)) .cse9 .cse12 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse21) .cse0 .cse13 .cse1 .cse7 (and .cse16 (or (and .cse30 .cse31 .cse32 .cse18 .cse28 .cse22) (let ((.cse33 (+ |old(~token~0)| 1))) (and .cse30 .cse31 (<= .cse33 ~token~0) (<= ~token~0 .cse33) .cse32 .cse18 .cse28))) .cse21) .cse8 .cse34 .cse14) (or .cse0 .cse23 .cse7 .cse10)))) [2020-08-22 23:18:07,935 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse19 (<= 2 ~t1_st~0)) (.cse13 (= ~t1_pc~0 1)) (.cse16 (not (= eval_~tmp~0 0))) (.cse12 (= |old(~t1_pc~0)| 1))) (let ((.cse3 (not .cse12)) (.cse5 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse6 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse11 (= |old(~m_pc~0)| 1)) (.cse4 (= |old(~E_M~0)| 0)) (.cse7 (let ((.cse21 (+ ~local~0 1))) (and .cse19 (<= ~token~0 .cse21) (<= .cse21 ~token~0) .cse13 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) (<= 2 ~E_1~0) .cse16))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse10) (or .cse0 .cse2 .cse3 .cse4 .cse5 (not (<= 2 |old(~t1_st~0)|)) .cse6 .cse8 .cse9 .cse10) (let ((.cse14 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= |old(~token~0)| ~token~0)) (.cse15 (not (= ~m_pc~0 1))) (.cse17 (= ~E_M~0 |old(~E_M~0)|))) (or .cse0 .cse1 .cse2 .cse11 .cse4 (not (= |old(~m_st~0)| 0)) .cse7 .cse8 .cse12 .cse9 (and (not .cse13) .cse14 (= ~t1_st~0 0) .cse15 .cse16 .cse17 .cse18) (and .cse14 .cse16 (or (and .cse19 .cse13 .cse15 .cse18) (let ((.cse20 (+ |old(~token~0)| 1))) (and .cse19 .cse13 (<= .cse20 ~token~0) (<= ~token~0 .cse20) .cse15))) .cse17)))))) [2020-08-22 23:18:07,935 INFO L264 CegarLoopResult]: At program point L212(line 212) the Hoare annotation is: (let ((.cse6 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse23 (= ~t1_i~0 1)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse3 (= |old(~m_pc~0)| 1)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse19 (not .cse15)) (.cse4 (= |old(~E_M~0)| 0)) (.cse20 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse21 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse16 (not .cse23)) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse17 (let ((.cse22 (+ ~local~0 1))) (and .cse6 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse7 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse23 (<= 2 ~E_1~0) .cse9 .cse10)))) (and (let ((.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (and .cse5 (let ((.cse8 (not (= ~m_pc~0 1)))) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse6 .cse7 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse8 .cse9 .cse10)))) .cse13) .cse14 .cse15 .cse16 (and (= ~local~0 |old(~local~0)|) .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse9 .cse10 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse13 .cse11) .cse17)) (or .cse0 .cse3 .cse18) (or .cse0 .cse2 .cse19 .cse4 .cse20 (not (<= 2 |old(~t1_st~0)|)) .cse21 .cse14 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse20 .cse21 .cse14 .cse16 .cse18 .cse17)))) [2020-08-22 23:18:07,935 INFO L264 CegarLoopResult]: At program point L212-1(line 212) the Hoare annotation is: (let ((.cse6 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse23 (= ~t1_i~0 1)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse3 (= |old(~m_pc~0)| 1)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse19 (not .cse15)) (.cse4 (= |old(~E_M~0)| 0)) (.cse20 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse21 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse16 (not .cse23)) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse17 (let ((.cse22 (+ ~local~0 1))) (and .cse6 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse7 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse23 (<= 2 ~E_1~0) .cse9 .cse10)))) (and (let ((.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (and .cse5 (let ((.cse8 (not (= ~m_pc~0 1)))) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse6 .cse7 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse8 .cse9 .cse10)))) .cse13) .cse14 .cse15 .cse16 (and (= ~local~0 |old(~local~0)|) .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse9 .cse10 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse13 .cse11) .cse17)) (or .cse0 .cse3 .cse18) (or .cse0 .cse2 .cse19 .cse4 .cse20 (not (<= 2 |old(~t1_st~0)|)) .cse21 .cse14 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse20 .cse21 .cse14 .cse16 .cse18 .cse17)))) [2020-08-22 23:18:07,936 INFO L264 CegarLoopResult]: At program point L212-2(line 212) the Hoare annotation is: (let ((.cse6 (<= 2 ~t1_st~0)) (.cse7 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 0)) (.cse10 (not (= eval_~tmp~0 0))) (.cse23 (= ~t1_i~0 1)) (.cse15 (= |old(~t1_pc~0)| 1))) (let ((.cse3 (= |old(~m_pc~0)| 1)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse19 (not .cse15)) (.cse4 (= |old(~E_M~0)| 0)) (.cse20 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse21 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse16 (not .cse23)) (.cse18 (not (<= 2 |old(~m_st~0)|))) (.cse17 (let ((.cse22 (+ ~local~0 1))) (and .cse6 (<= ~token~0 .cse22) (<= .cse22 ~token~0) .cse7 (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) .cse23 (<= 2 ~E_1~0) .cse9 .cse10)))) (and (let ((.cse5 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (= |old(~token~0)| ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~m_st~0)| 0)) (and .cse5 (let ((.cse8 (not (= ~m_pc~0 1)))) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse6 .cse7 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse8 .cse9 .cse10)))) .cse13) .cse14 .cse15 .cse16 (and (= ~local~0 |old(~local~0)|) .cse5 (= ~m_pc~0 |old(~m_pc~0)|) .cse9 .cse10 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse13 .cse11) .cse17)) (or .cse0 .cse3 .cse18) (or .cse0 .cse2 .cse19 .cse4 .cse20 (not (<= 2 |old(~t1_st~0)|)) .cse21 .cse14 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse4 .cse20 .cse21 .cse14 .cse16 .cse18 .cse17)))) [2020-08-22 23:18:07,936 INFO L264 CegarLoopResult]: At program point L229(line 229) the Hoare annotation is: (let ((.cse13 (<= 2 ~m_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse15 (<= ~token~0 ~local~0)) (.cse22 (= ~t1_i~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse17 (not (= eval_~tmp~0 0))) (.cse21 (= ~m_i~0 1)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (= |old(~t1_pc~0)| 1))) (let ((.cse2 (not .cse20)) (.cse4 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse5 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse11 (and .cse13 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) .cse14 (not (= ~E_M~0 1)) .cse15 .cse22 .cse16 .cse17 .cse21 .cse18)) (.cse12 (= |old(~m_pc~0)| 1)) (.cse3 (= |old(~E_M~0)| 0)) (.cse8 (not .cse22)) (.cse0 (not .cse21)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse1 (= |old(~E_M~0)| 1)) (.cse6 (and .cse13 (not (= ~m_pc~0 1)) .cse21)) (.cse7 (not (<= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 |old(~t1_st~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse12 .cse6 .cse9) (let ((.cse19 (= ~E_M~0 |old(~E_M~0)|))) (or .cse11 .cse12 .cse3 (not (= |old(~m_st~0)| 0)) .cse8 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse0 .cse10 .cse1 .cse6 .cse7 .cse20 (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~m_st~0 0) .cse17 (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~t1_st~0)| ~t1_st~0) .cse19 (= |old(~token~0)| ~token~0))))))) [2020-08-22 23:18:07,936 INFO L271 CegarLoopResult]: At program point stop_simulationFINAL(lines 384 402) the Hoare annotation is: true [2020-08-22 23:18:07,936 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-08-22 23:18:07,936 INFO L271 CegarLoopResult]: At program point L398(line 398) the Hoare annotation is: true [2020-08-22 23:18:07,937 INFO L271 CegarLoopResult]: At program point L393(line 393) the Hoare annotation is: true [2020-08-22 23:18:07,937 INFO L271 CegarLoopResult]: At program point L392(lines 392 397) the Hoare annotation is: true [2020-08-22 23:18:07,937 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-08-22 23:18:07,937 INFO L271 CegarLoopResult]: At program point stop_simulationEXIT(lines 384 402) the Hoare annotation is: true [2020-08-22 23:18:07,937 INFO L271 CegarLoopResult]: At program point L390-1(line 390) the Hoare annotation is: true [2020-08-22 23:18:07,937 INFO L271 CegarLoopResult]: At program point L390-2(line 390) the Hoare annotation is: true [2020-08-22 23:18:07,937 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-08-22 23:18:07,937 INFO L271 CegarLoopResult]: At program point L390-3(line 390) the Hoare annotation is: true [2020-08-22 23:18:07,937 INFO L271 CegarLoopResult]: At program point L386(line 386) the Hoare annotation is: true [2020-08-22 23:18:07,938 INFO L271 CegarLoopResult]: At program point update_channelsEXIT(lines 148 155) the Hoare annotation is: true [2020-08-22 23:18:07,938 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-08-22 23:18:07,938 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse2 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (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)|))) (.cse5 (= |old(~E_M~0)| 1)) (.cse4 (= ~t1_pc~0 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse2 (not .cse4) .cse5 .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse8 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse5 .cse4 .cse6 .cse7 .cse8 .cse3 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-08-22 23:18:07,938 INFO L264 CegarLoopResult]: At program point L254-1(lines 248 271) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (= |old(~E_M~0)| 1)) (.cse4 (= ~t1_pc~0 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 (not .cse4) .cse5 .cse2 .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse8 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse5 .cse4 .cse6 .cse2 .cse7 .cse8 .cse3 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-08-22 23:18:07,938 INFO L264 CegarLoopResult]: At program point L250(line 250) the Hoare annotation is: (let ((.cse2 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse1 (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)|))) (.cse5 (= |old(~E_M~0)| 1)) (.cse4 (= ~t1_pc~0 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse2 (not .cse4) .cse5 .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse8 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse5 .cse4 .cse6 .cse7 .cse8 .cse3 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-08-22 23:18:07,939 INFO L264 CegarLoopResult]: At program point L265(line 265) the Hoare annotation is: (let ((.cse2 (= ~m_pc~0 1)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (= ~t1_pc~0 1)) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 (= ~E_1~0 |old(~E_1~0)|) .cse2) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse2 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 (not .cse4) .cse5 (not (<= ~token~0 ~local~0)) .cse6 .cse7 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))))) [2020-08-22 23:18:07,939 INFO L264 CegarLoopResult]: At program point L259-1(lines 248 271) the Hoare annotation is: (let ((.cse8 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse3 (= |old(~E_M~0)| 1)) (.cse2 (= ~t1_pc~0 1)) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (and .cse8 (= ~E_M~0 |old(~E_M~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse9 (= ~m_pc~0 1))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 (not (<= ~token~0 ~local~0)) .cse6 .cse7 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse1 .cse8 .cse9) (or .cse0 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)))))) [2020-08-22 23:18:07,939 INFO L264 CegarLoopResult]: At program point L255(line 255) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (= |old(~E_M~0)| 1)) (.cse4 (= ~t1_pc~0 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 (not .cse4) .cse5 .cse2 .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse8 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse5 .cse4 .cse6 .cse2 .cse7 .cse8 .cse3 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-08-22 23:18:07,939 INFO L264 CegarLoopResult]: At program point L249-1(lines 248 271) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse0 (not (= ~m_i~0 1))) (.cse5 (= |old(~E_M~0)| 1)) (.cse4 (= ~t1_pc~0 1)) (.cse6 (= |old(~E_M~0)| 0)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse3 (= ~m_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 (not .cse4) .cse5 .cse2 .cse6 (not (<= ~token~0 ~local~0)) .cse7 .cse8 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))) (or .cse0 .cse5 .cse4 .cse6 .cse2 .cse7 .cse8 .cse3 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))))) [2020-08-22 23:18:07,939 INFO L264 CegarLoopResult]: At program point fire_delta_eventsEXIT(lines 245 272) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~t1_pc~0 1)) (.cse1 (= |old(~E_M~0)| 1)) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 (not (<= 2 ~m_st~0)) (not .cse2) .cse1 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))))) [2020-08-22 23:18:07,940 INFO L264 CegarLoopResult]: At program point L264-1(lines 245 272) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~t1_pc~0 1)) (.cse1 (= |old(~E_M~0)| 1)) (.cse3 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 (not (<= 2 ~m_st~0)) (not .cse2) .cse1 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse6 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))))) [2020-08-22 23:18:07,940 INFO L264 CegarLoopResult]: At program point L260(line 260) the Hoare annotation is: (let ((.cse2 (= ~m_pc~0 1)) (.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (= ~t1_pc~0 1)) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1)))) (and (or .cse0 .cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) .cse2) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse2 (not (= ~t1_st~0 0)) (not (= ~m_st~0 0))) (or .cse0 .cse1 .cse3 (not .cse4) .cse5 (not (<= ~token~0 ~local~0)) .cse6 .cse7 (not (<= 2 ~t1_st~0)) (not (<= ~local~0 ~token~0))))) [2020-08-22 23:18:07,940 INFO L264 CegarLoopResult]: At program point L448(line 448) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 23:18:07,940 INFO L264 CegarLoopResult]: At program point L448-1(line 448) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 23:18:07,941 INFO L264 CegarLoopResult]: At program point L448-2(line 448) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 23:18:07,941 INFO L264 CegarLoopResult]: At program point L411(line 411) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-08-22 23:18:07,941 INFO L271 CegarLoopResult]: At program point start_simulationEXIT(lines 403 461) the Hoare annotation is: true [2020-08-22 23:18:07,941 INFO L264 CegarLoopResult]: At program point L411-1(line 411) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-08-22 23:18:07,941 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 23:18:07,941 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 23:18:07,941 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 23:18:07,942 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-08-22 23:18:07,942 INFO L264 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and (not (= ~t1_pc~0 1)) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (not (= ~m_pc~0 1)) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0))) [2020-08-22 23:18:07,942 INFO L264 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 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 23:18:07,942 INFO L264 CegarLoopResult]: At program point L437(lines 437 446) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 23:18:07,942 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 23:18:07,942 INFO L264 CegarLoopResult]: At program point L450(lines 450 454) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 23:18:07,942 INFO L264 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (not (= ~t1_pc~0 1)) (= ~t1_st~0 0) (not (= ~m_pc~0 1)) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-08-22 23:18:07,943 INFO L264 CegarLoopResult]: At program point L405(line 405) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-08-22 23:18:07,943 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)))) [2020-08-22 23:18:07,943 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)))) [2020-08-22 23:18:07,943 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)))) [2020-08-22 23:18:07,943 INFO L264 CegarLoopResult]: At program point L426-1(line 426) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)))) [2020-08-22 23:18:07,943 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse3 (= ~t1_st~0 0)) (.cse8 (not (= ~m_pc~0 1))) (.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse4 (not (= ~E_M~0 1))) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (not .cse1) .cse3 .cse8 .cse6 (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= ~t1_i~0 1)) (and .cse0 .cse8) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7))) [2020-08-22 23:18:07,943 INFO L264 CegarLoopResult]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 (= ~t1_pc~0 1) (not (= ~E_M~0 0)) (not (= ~E_M~0 1)) (<= ~token~0 ~local~0) (<= 2 ~E_1~0) (<= ~local~0 ~token~0)))) [2020-08-22 23:18:07,944 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse3 (= ~t1_st~0 0)) (.cse8 (not (= ~m_pc~0 1))) (.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse4 (not (= ~E_M~0 1))) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (not .cse1) .cse3 .cse8 .cse6 (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= ~t1_i~0 1)) (and .cse0 .cse8) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7))) [2020-08-22 23:18:07,944 INFO L264 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (not (= ~t1_pc~0 1)) (= ~t1_st~0 0) (not (= ~m_pc~0 1)) (<= 2 ~E_1~0) (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-08-22 23:18:07,944 INFO L264 CegarLoopResult]: At program point L410(line 410) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-08-22 23:18:07,944 INFO L264 CegarLoopResult]: At program point L439(line 439) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 23:18:07,944 INFO L264 CegarLoopResult]: At program point L406(line 406) the Hoare annotation is: (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (= ~local~0 |old(~local~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_st~0 0) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1))) [2020-08-22 23:18:07,944 INFO L264 CegarLoopResult]: At program point L435(line 435) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 23:18:07,944 INFO L264 CegarLoopResult]: At program point L435-1(line 435) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 23:18:07,945 INFO L264 CegarLoopResult]: At program point L435-2(line 435) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 23:18:07,945 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse3 (not (= ~E_M~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (<= ~local~0 ~token~0))) (or (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6) (= |old(~E_M~0)| 1) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (not (= ~t1_i~0 1)) (and .cse0 (not (= ~m_pc~0 1))) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-08-22 23:18:07,945 INFO L271 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: true [2020-08-22 23:18:07,945 INFO L264 CegarLoopResult]: At program point L419(line 419) the Hoare annotation is: (let ((.cse3 (= ~t1_st~0 0)) (.cse8 (not (= ~m_pc~0 1))) (.cse0 (<= 2 ~m_st~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (not (= ~E_M~0 0))) (.cse4 (not (= ~E_M~0 1))) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= 2 ~E_1~0)) (.cse7 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (= |old(~m_pc~0)| 1) (= |old(~E_M~0)| 0) (not (= |old(~m_st~0)| 0)) (and (not .cse1) .cse3 .cse8 .cse6 (= ~m_st~0 0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~token~0)| ~token~0)) (not (= ~t1_i~0 1)) (and .cse0 .cse8) (not (= ~m_i~0 1)) (not (= |old(~t1_st~0)| 0)) (= |old(~E_M~0)| 1) (not (<= 2 |old(~E_1~0)|)) (= |old(~t1_pc~0)| 1) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7))) [2020-08-22 23:18:07,945 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse15 (= ~t1_st~0 0)) (.cse13 (= ~t1_pc~0 1)) (.cse16 (<= 0 is_master_triggered_~__retres1~0)) (.cse3 (= ~m_pc~0 1)) (.cse17 (<= is_master_triggered_~__retres1~0 0)) (.cse18 (= ~m_i~0 1))) (let ((.cse1 (not (<= 2 ~m_st~0))) (.cse2 (and .cse16 (not .cse3) .cse17 .cse18)) (.cse12 (not (<= 2 ~E_1~0))) (.cse4 (not .cse13)) (.cse0 (not .cse18)) (.cse5 (and .cse16 .cse17)) (.cse7 (= ~E_M~0 1)) (.cse6 (= ~E_M~0 0)) (.cse8 (not (<= ~token~0 ~local~0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not .cse15)) (.cse11 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse5 .cse13 .cse7 .cse6 .cse9 .cse3 .cse10 (not (= ~m_st~0 0)) .cse12) (let ((.cse14 (+ ~local~0 1))) (or .cse0 .cse1 .cse4 (not (<= ~token~0 .cse14)) (<= 1 is_master_triggered_~__retres1~0) .cse2 (not (<= .cse14 ~token~0)) .cse15 (not .cse7) .cse9 .cse12)) (or .cse0 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 (not (<= 2 ~t1_st~0)) .cse11) (or .cse0 .cse5 .cse13 .cse7 .cse6 .cse8 .cse9 .cse3 .cse10 .cse11)))) [2020-08-22 23:18:07,945 INFO L264 CegarLoopResult]: At program point is_master_triggeredFINAL(lines 110 128) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse15 (= ~t1_st~0 0)) (.cse16 (<= 0 |is_master_triggered_#res|)) (.cse17 (<= |is_master_triggered_#res| 0)) (.cse18 (<= 0 is_master_triggered_~__retres1~0)) (.cse7 (= ~m_pc~0 1)) (.cse19 (<= is_master_triggered_~__retres1~0 0)) (.cse20 (= ~m_i~0 1))) (let ((.cse12 (and .cse16 .cse17 .cse18 (not .cse7) .cse19 .cse20)) (.cse11 (not (<= 2 ~m_st~0))) (.cse8 (not .cse15)) (.cse10 (not (<= 2 ~E_1~0))) (.cse0 (not .cse20)) (.cse13 (not .cse1)) (.cse2 (and .cse16 .cse17 .cse18 .cse19)) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (not (= ~m_st~0 0)) .cse10) (or .cse0 .cse11 .cse7 .cse12) (let ((.cse14 (+ ~local~0 1))) (or .cse0 .cse11 .cse13 (not (<= ~token~0 .cse14)) (not (<= .cse14 ~token~0)) .cse15 (not .cse3) .cse6 (and (<= 1 |is_master_triggered_#res|) (<= 1 is_master_triggered_~__retres1~0)) .cse12 .cse10)) (or .cse0 .cse11 .cse13 .cse2 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse9)))) [2020-08-22 23:18:07,945 INFO L264 CegarLoopResult]: At program point L116(line 116) the Hoare annotation is: (let ((.cse9 (= ~t1_pc~0 1))) (let ((.cse7 (not (<= 2 ~m_st~0))) (.cse1 (not .cse9)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~E_M~0 1)) (.cse3 (= ~E_M~0 0)) (.cse5 (not (= ~t1_i~0 1))) (.cse8 (= ~m_pc~0 1)) (.cse10 (not (= ~t1_st~0 0))) (.cse11 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 ~t1_st~0)) .cse6) (or .cse0 .cse7 .cse8) (or .cse0 .cse9 .cse2 .cse3 .cse4 .cse5 .cse8 .cse10 .cse6) (or .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse11) (or .cse0 .cse9 .cse2 .cse3 .cse5 .cse8 .cse10 (not (= ~m_st~0 0)) .cse11)))) [2020-08-22 23:18:07,946 INFO L264 CegarLoopResult]: At program point L115(lines 115 120) the Hoare annotation is: (let ((.cse5 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= ~local~0 ~token~0))) (.cse0 (not (= ~m_i~0 1))) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse6 (not (= ~t1_i~0 1))) (.cse1 (= ~m_pc~0 1)) (.cse8 (not (= ~t1_st~0 0)))) (and (or .cse0 (not (<= 2 ~m_st~0)) .cse1) (or .cse0 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse1 (not (<= 2 ~t1_st~0)) .cse7) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse1 .cse8 .cse7) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse1 .cse8 (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0))))) [2020-08-22 23:18:07,946 INFO L271 CegarLoopResult]: At program point L114(lines 114 123) the Hoare annotation is: true [2020-08-22 23:18:07,946 INFO L264 CegarLoopResult]: At program point L114-2(lines 114 123) the Hoare annotation is: (let ((.cse0 (+ ~local~0 1))) (or (not (= ~m_i~0 1)) (not (<= 2 ~m_st~0)) (not (= ~t1_pc~0 1)) (not (<= ~token~0 .cse0)) (not (<= .cse0 ~token~0)) (= ~t1_st~0 0) (not (= ~E_M~0 1)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (not (<= 2 ~E_1~0)))) [2020-08-22 23:18:07,946 INFO L264 CegarLoopResult]: At program point is_master_triggeredEXIT(lines 110 128) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse15 (= ~t1_st~0 0)) (.cse16 (<= 0 |is_master_triggered_#res|)) (.cse17 (<= |is_master_triggered_#res| 0)) (.cse18 (<= 0 is_master_triggered_~__retres1~0)) (.cse7 (= ~m_pc~0 1)) (.cse19 (<= is_master_triggered_~__retres1~0 0)) (.cse20 (= ~m_i~0 1))) (let ((.cse12 (and .cse16 .cse17 .cse18 (not .cse7) .cse19 .cse20)) (.cse11 (not (<= 2 ~m_st~0))) (.cse8 (not .cse15)) (.cse10 (not (<= 2 ~E_1~0))) (.cse0 (not .cse20)) (.cse13 (not .cse1)) (.cse2 (and .cse16 .cse17 .cse18 .cse19)) (.cse3 (= ~E_M~0 1)) (.cse4 (= ~E_M~0 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (not (= ~m_st~0 0)) .cse10) (or .cse0 .cse11 .cse7 .cse12) (let ((.cse14 (+ ~local~0 1))) (or .cse0 .cse11 .cse13 (not (<= ~token~0 .cse14)) (not (<= .cse14 ~token~0)) .cse15 (not .cse3) .cse6 (and (<= 1 |is_master_triggered_#res|) (<= 1 is_master_triggered_~__retres1~0)) .cse12 .cse10)) (or .cse0 .cse11 .cse13 .cse2 .cse4 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~t1_st~0)) .cse9)))) [2020-08-22 23:18:07,946 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-08-22 23:18:07,946 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 23:18:07,946 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~m_i~0 1)) (not (= ~t1_pc~0 1)) (not (= ~E_M~0 0)) (= ~t1_st~0 0) (not (= ~E_M~0 1)) (not (= ~t1_i~0 1)) (not (= ~m_pc~0 1)) (<= 2 ~E_1~0) (= ~m_st~0 0)) [2020-08-22 23:18:07,946 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 23:18:07,947 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 23:18:07,947 INFO L264 CegarLoopResult]: At program point L351(line 351) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse1 (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)|))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 (= ~m_pc~0 1)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9) (or .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9))) [2020-08-22 23:18:07,947 INFO L264 CegarLoopResult]: At program point reset_time_eventsEXIT(lines 346 373) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~E_M~0)| 1)) (.cse5 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9))) [2020-08-22 23:18:07,947 INFO L264 CegarLoopResult]: At program point L366(line 366) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 1)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8))) [2020-08-22 23:18:07,947 INFO L264 CegarLoopResult]: At program point L360-1(lines 349 372) the Hoare annotation is: (let ((.cse10 (= ~E_1~0 |old(~E_1~0)|))) (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~E_M~0)| 1)) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (and .cse10 (= ~E_M~0 |old(~E_M~0)|))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9) (or .cse0 .cse1 .cse10 (= ~m_pc~0 1)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9)))) [2020-08-22 23:18:07,948 INFO L264 CegarLoopResult]: At program point L356(line 356) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 (= ~m_pc~0 1)) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9))) [2020-08-22 23:18:07,948 INFO L264 CegarLoopResult]: At program point L350-1(lines 349 372) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 (= ~m_pc~0 1)) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9))) [2020-08-22 23:18:07,948 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse2 (not (<= 2 ~m_st~0))) (.cse1 (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)|))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 (= ~m_pc~0 1)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9) (or .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9))) [2020-08-22 23:18:07,948 INFO L264 CegarLoopResult]: At program point L365-1(lines 346 373) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~E_M~0)| 1)) (.cse5 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse4 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9))) [2020-08-22 23:18:07,948 INFO L264 CegarLoopResult]: At program point L361(line 361) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse2 (= |old(~E_M~0)| 1)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|)) (= ~m_pc~0 1)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 2 ~t1_st~0)) .cse8))) [2020-08-22 23:18:07,948 INFO L264 CegarLoopResult]: At program point L355-1(lines 349 372) the Hoare annotation is: (let ((.cse0 (not (= ~m_i~0 1))) (.cse1 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (= |old(~E_M~0)| 1)) (.cse2 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse5 (= |old(~E_M~0)| 0)) (.cse6 (not (<= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~local~0 ~token~0)))) (and (or .cse0 .cse1 .cse2 (= ~m_pc~0 1)) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse2 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0)) .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse2 .cse5 .cse6 .cse7 .cse8 (not (<= 2 ~t1_st~0)) .cse9))) [2020-08-22 23:18:07,949 INFO L264 CegarLoopResult]: At program point init_modelFINAL(lines 374 383) the Hoare annotation is: (or (= ~t1_pc~0 1) (= ~E_M~0 1) (= ~E_M~0 0) (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (and (= ~t1_i~0 1) (= ~m_i~0 1)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-08-22 23:18:07,949 INFO L264 CegarLoopResult]: At program point init_modelEXIT(lines 374 383) the Hoare annotation is: (or (= ~t1_pc~0 1) (= ~E_M~0 1) (= ~E_M~0 0) (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (and (= ~t1_i~0 1) (= ~m_i~0 1)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-08-22 23:18:07,949 INFO L264 CegarLoopResult]: At program point L379(line 379) the Hoare annotation is: (or (= ~t1_pc~0 1) (= ~E_M~0 1) (= ~E_M~0 0) (and (not (= ~t1_i~0 1)) (= ~m_i~0 1)) (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-08-22 23:18:07,949 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: (or (= ~t1_pc~0 1) (= ~E_M~0 1) (= ~E_M~0 0) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~m_i~0)| ~m_i~0)) (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (not (= ~m_st~0 0)) (not (<= 2 ~E_1~0)) (= |old(~m_i~0)| 1) (= |old(~t1_i~0)| 1)) [2020-08-22 23:18:08,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 11:18:08 BoogieIcfgContainer [2020-08-22 23:18:08,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 23:18:08,022 INFO L168 Benchmark]: Toolchain (without parser) took 141034.76 ms. Allocated memory was 144.7 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 101.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2020-08-22 23:18:08,023 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.7 MB. Free memory was 120.3 MB in the beginning and 119.8 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-08-22 23:18:08,023 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.62 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 179.9 MB in the end (delta: -78.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2020-08-22 23:18:08,024 INFO L168 Benchmark]: Boogie Preprocessor took 50.92 ms. Allocated memory is still 201.9 MB. Free memory was 179.9 MB in the beginning and 177.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-08-22 23:18:08,025 INFO L168 Benchmark]: RCFGBuilder took 661.56 ms. Allocated memory is still 201.9 MB. Free memory was 177.5 MB in the beginning and 141.5 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 7.1 GB. [2020-08-22 23:18:08,025 INFO L168 Benchmark]: TraceAbstraction took 139868.96 ms. Allocated memory was 201.9 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 140.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2020-08-22 23:18:08,027 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 144.7 MB. Free memory was 120.3 MB in the beginning and 119.8 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 443.62 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 179.9 MB in the end (delta: -78.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.92 ms. Allocated memory is still 201.9 MB. Free memory was 179.9 MB in the beginning and 177.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 661.56 ms. Allocated memory is still 201.9 MB. Free memory was 177.5 MB in the beginning and 141.5 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 139868.96 ms. Allocated memory was 201.9 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 140.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((!(m_i == 1) || !(t1_pc == 1)) || E_M == 1) || E_M == 0) || !(t1_i == 1)) || m_pc == 1) || !(2 <= t1_st)) || 1 <= __retres1) || !(m_st == 0)) || !(2 <= E_1)) && ((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(token <= local + 1)) || !(local + 1 <= token)) || E_M == 0) || E_M == 1) || !(t1_i == 1)) || !(2 <= t1_st)) || 1 <= __retres1) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((!(m_i == 1) || !(2 <= m_st)) || E_M == 0) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || 1 <= __retres1) || !(local <= token)) || !(2 <= E_1))) && (((((((((!(m_i == 1) || t1_pc == 1) || E_M == 1) || E_M == 0) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || 1 <= __retres1) || !(m_st == 0)) || !(2 <= E_1)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((!(m_i == 1) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || (((((((m_st == \old(m_st) && t1_pc == 1) && E_1 == \old(E_1)) && token <= local) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || \old(E_M) == 0) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st))) && ((((((((((((((!(\old(t1_pc) == 1) || ((((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && !(tmp == 0)) && m_i == 1) && local <= token)) || \old(E_M) == 0) || !(t1_i == 1)) || (((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token)) || !(m_i == 1)) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || (((((((m_st == \old(m_st) && t1_pc == 1) && E_1 == \old(E_1)) && token <= local) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || ((!(E_M == 0) && !(E_M == 1)) && (((((((((((((((token <= local + 1 && local == \old(local)) && m_st == \old(m_st)) && m_st == 0) && \old(t1_pc) == t1_pc) && E_M == \old(E_M)) && 2 <= t1_st) && local + 1 <= token) && t1_pc == 1) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && t1_i == 1) && m_i == 1) && \old(t1_st) == t1_st) && \old(token) == token) || ((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && m_st == 0) && !(tmp == 0)) && m_i == 1)))) || !(2 <= \old(m_st)))) && ((((((((((((((((((((((local == \old(local) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && m_st == 0) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token) || ((((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && !(tmp == 0)) && m_i == 1) && local <= token)) || \old(m_pc) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || !(t1_i == 1)) || (((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && !(tmp == 0)) && local <= token)) || ((((((2 <= m_st && t1_st == 0) && token <= local) && 2 <= E_1) && !(tmp == 0)) && local <= token) && E_M == \old(E_M))) || !(m_i == 1)) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || ((E_1 == \old(E_1) && ((((((2 <= t1_st && t1_pc == 1) && !(m_pc == 1)) && m_st == 0) && !(tmp == 0)) && \old(token) == token) || ((((((2 <= t1_st && t1_pc == 1) && \old(token) + 1 <= token) && token <= \old(token) + 1) && !(m_pc == 1)) && m_st == 0) && !(tmp == 0)))) && E_M == \old(E_M))) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || ((!(E_M == 0) && !(E_M == 1)) && (((((((((((((((token <= local + 1 && local == \old(local)) && m_st == \old(m_st)) && m_st == 0) && \old(t1_pc) == t1_pc) && E_M == \old(E_M)) && 2 <= t1_st) && local + 1 <= token) && t1_pc == 1) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && t1_i == 1) && m_i == 1) && \old(t1_st) == t1_st) && \old(token) == token) || ((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && t1_i == 1) && 2 <= E_1) && m_st == 0) && !(tmp == 0)) && m_i == 1))))) && (((!(m_i == 1) || \old(m_pc) == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(m_st))) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((!(m_i == 1) || !(2 <= m_st)) || (((0 <= __retres1 && !(m_pc == 1)) && __retres1 <= 0) && m_i == 1)) || m_pc == 1) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 0) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1))) && (((((((((!(m_i == 1) || (0 <= __retres1 && __retres1 <= 0)) || t1_pc == 1) || E_M == 1) || E_M == 0) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(token <= local + 1)) || 1 <= __retres1) || (((0 <= __retres1 && !(m_pc == 1)) && __retres1 <= 0) && m_i == 1)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || !(2 <= E_1))) && ((((((((!(m_i == 1) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || !(local <= token))) && (((((((((!(m_i == 1) || (0 <= __retres1 && __retres1 <= 0)) || t1_pc == 1) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(local <= token)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((!(m_i == 1) || !(t1_pc == 1)) || (((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) || \old(m_pc) == 1) || !(2 <= \old(t1_st))) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) && ((((((((((!(m_i == 1) || !(t1_pc == 1)) || (((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || E_M == 0) || E_M == 1) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) || !(\old(local) + 1 <= \old(token)))) && ((((((((!(\old(t1_st) == 0) || !(m_i == 1)) || t1_pc == 1) || \old(m_pc) == 1) || ((((2 <= m_st && t1_st == 0) && token <= local) && 2 <= E_1) && local <= token)) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((!(m_i == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || m_pc == 1) || !(2 <= \old(m_st))) && (((((((((((!(m_i == 1) || !(\old(token) <= local)) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || \old(E_M) == 0) || \old(t1_st) == 0) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(t1_i == 1)) || !(local <= \old(token))) || (((((t1_pc == 1 && !(E_M == 0)) && \old(token) + 1 <= token) && !(E_M == 1)) && token <= \old(token) + 1) && m_st == 0)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((!(m_i == 1) || !(\old(token) <= local)) || \old(E_M) == 1) || \old(E_M) == 0) || \old(t1_st) == 0) || ((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || \old(t1_pc) == 1) || !(local <= \old(token))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((!(m_i == 1) || ((((m_st == 0 && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || \old(E_M) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || \old(t1_pc) == 1) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((!(m_i == 1) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || (((((((m_st == \old(m_st) && t1_pc == 1) && E_1 == \old(E_1)) && token <= local) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || \old(E_M) == 0) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st))) && ((((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || \old(m_pc) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || !(t1_i == 1)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token))) && (((((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || \old(E_M) == 0) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token))) && (((!(m_i == 1) || \old(m_pc) == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(m_st))) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((((((!(m_i == 1) || !(\old(token) <= local)) || \old(E_M) == 1) || \old(E_M) == 0) || \old(t1_st) == 0) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == \old(E_M)) && \old(token) == token)) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || \old(t1_pc) == 1) || !(local <= \old(token))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((!(m_i == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || m_pc == 1) || !(2 <= \old(m_st)))) && (((((((((!(m_i == 1) || \old(E_M) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || ((((2 <= t1_st && t1_pc == 1) && m_st == 0) && E_M == \old(E_M)) && \old(token) == token)) || \old(t1_st) == 0) || \old(t1_pc) == 1) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1))) && (((((((((((!(m_i == 1) || !(\old(token) <= local)) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || \old(E_M) == 0) || \old(t1_st) == 0) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(t1_i == 1)) || !(local <= \old(token))) || ((((((2 <= t1_st && t1_pc == 1) && !(E_M == 0)) && \old(token) + 1 <= token) && !(E_M == 1)) && token <= \old(token) + 1) && m_st == 0)) || !(2 <= \old(m_st))) || !(2 <= E_1)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((((!(m_i == 1) || !(\old(token) <= local)) || (((((m_st == \old(m_st) && t1_pc == 1) && token <= local) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M))) || \old(E_M) == 1) || \old(E_M) == 0) || \old(t1_st) == 0) || !(local <= \old(token))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((!(m_i == 1) || ((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && \old(token) == token) && E_M == \old(E_M))) || m_pc == 1) || !(2 <= \old(m_st)))) && (((((((((!(m_i == 1) || !(\old(token) <= local)) || \old(E_M) == 1) || \old(E_M) == 0) || \old(t1_st) == 0) || \old(t1_pc) == 1) || !(local <= \old(token))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((!(m_i == 1) || \old(E_M) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || \old(t1_st) == 0) || \old(t1_pc) == 1) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token) || \old(m_pc) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || ((((((!(t1_pc == 1) && t1_st == 0) && !(m_pc == 1)) && 2 <= E_1) && m_st == 0) && E_M == \old(E_M)) && \old(token) == token)) || !(t1_i == 1)) || (2 <= m_st && !(m_pc == 1))) || !(m_i == 1)) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((!(\old(t1_st) == 0) || !(m_i == 1)) || t1_pc == 1) || \old(m_pc) == 1) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) && (((((((((!(m_i == 1) || !(t1_pc == 1)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || E_M == 1) || E_M == 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)) || !(\old(local) + 1 <= \old(token)))) && (((((((!(m_i == 1) || !(t1_pc == 1)) || \old(m_pc) == 1) || !(2 <= \old(t1_st))) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((!(\old(t1_st) == 0) || !(m_i == 1)) || t1_pc == 1) || \old(m_pc) == 1) || E_M == 1) || E_M == 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)) && (((((((((!(m_i == 1) || !(t1_pc == 1)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || E_M == 0) || E_M == 1) || !(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)) || !(\old(local) + 1 <= \old(token)))) && ((((((((!(m_i == 1) || !(t1_pc == 1)) || \old(m_pc) == 1) || !(2 <= \old(t1_st))) || E_M == 1) || E_M == 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)) - ProcedureContractResult [Line: 74]: Procedure Contract for transmit1 Derived contract for procedure transmit1: (((((((((((((!(m_i == 1) || !(\old(token) <= local)) || \old(E_M) == 1) || \old(E_M) == 0) || \old(t1_st) == 0) || ((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == \old(E_M)) && \old(token) == token)) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || \old(t1_pc) == 1) || !(local <= \old(token))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((!(m_i == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || m_pc == 1) || !(2 <= \old(m_st)))) && (((((((((!(m_i == 1) || \old(E_M) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || ((((2 <= t1_st && t1_pc == 1) && m_st == 0) && E_M == \old(E_M)) && \old(token) == token)) || \old(t1_st) == 0) || \old(t1_pc) == 1) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1))) && (((((((((((!(m_i == 1) || !(\old(token) <= local)) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || \old(E_M) == 0) || \old(t1_st) == 0) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(t1_i == 1)) || !(local <= \old(token))) || ((((((2 <= t1_st && t1_pc == 1) && !(E_M == 0)) && \old(token) + 1 <= token) && !(E_M == 1)) && token <= \old(token) + 1) && m_st == 0)) || !(2 <= \old(m_st))) || !(2 <= E_1)) - ProcedureContractResult [Line: 301]: Procedure Contract for activate_threads Derived contract for procedure activate_threads: (((((((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(2 <= \old(t1_st))) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || (t1_st == 0 && (m_st == 0 || (tmp <= 0 && 0 < tmp + 1)))) || !(local <= token)) || ((m_st == \old(m_st) && (m_st == 0 || (tmp <= 0 && 0 < tmp + 1))) && \old(t1_st) == t1_st)) && (((((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || !(t1_pc == 1)) || ((((2 <= m_st && tmp <= 0) && !(m_pc == 1)) && m_i == 1) && 0 < tmp + 1)) || E_M == 0) || E_M == 1) || !(token <= local)) || !(t1_i == 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_i == 1) || !(t1_pc == 1)) || !(token <= local + 1)) || ((((2 <= m_st && tmp <= 0) && !(m_pc == 1)) && m_i == 1) && 0 < tmp + 1)) || !(local + 1 <= token)) || \old(t1_st) == 0) || (m_st == 0 && 1 <= tmp)) || !(E_M == 1)) || !(t1_i == 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((!(m_i == 1) || !(t1_pc == 1)) || !(2 <= \old(t1_st))) || E_M == 0) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || (tmp <= 0 && 0 < tmp + 1)) || !(local <= token))) && ((((((((((2 <= m_st || !(m_i == 1)) || !(t1_pc == 1)) || !(2 <= \old(t1_st))) || E_M == 0) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(local <= token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((!(m_i == 1) || ((((2 <= m_st && tmp <= 0) && !(m_pc == 1)) && m_i == 1) && 0 < tmp + 1)) || m_pc == 1) || !(2 <= \old(m_st)))) && (((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || t1_pc == 1) || !(\old(m_st) == 0)) || E_M == 1) || E_M == 0) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1)) || (((tmp <= 0 && 0 < tmp + 1) && m_st == 0) && \old(t1_st) == t1_st))) && (((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || t1_pc == 1) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || !(local <= token)) || (((m_st == \old(m_st) && tmp <= 0) && 0 < tmp + 1) && \old(t1_st) == t1_st)) - ProcedureContractResult [Line: 326]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify: (((((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || t1_pc == 1) || E_M == 1) || E_M == 0) || !(token <= local)) || (m_st == \old(m_st) && \old(t1_st) == t1_st)) || !(t1_i == 1)) || m_pc == 1) || !(local <= token)) && (((!(m_i == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || m_pc == 1) || !(2 <= \old(m_st)))) && (((((((((!(m_i == 1) || !(t1_pc == 1)) || !(2 <= \old(t1_st))) || E_M == 1) || E_M == 0) || !(token <= local)) || t1_st == 0) || !(t1_i == 1)) || (m_st == \old(m_st) && \old(t1_st) == t1_st)) || !(local <= token))) && ((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(token <= local + 1)) || !(local + 1 <= token)) || \old(t1_st) == 0) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(E_M == 1)) || !(t1_i == 1)) || m_st == 0) || !(2 <= \old(m_st))) || !(2 <= E_1)) - ProcedureContractResult [Line: 174]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread: ((((((((((((!(m_i == 1) || !(t1_pc == 1)) || !(token <= local + 1)) || !(local + 1 <= token)) || E_M == 0) || E_M == 1) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(2 <= t1_st)) || !(m_st == 0)) || !(2 <= E_1)) && (((((((((!(m_i == 1) || !(2 <= m_st)) || E_M == 1) || E_M == 0) || !(token <= local)) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1))) && (((((((((!(m_i == 1) || !(t1_pc == 1)) || E_M == 1) || E_M == 0) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || m_pc == 1) || !(2 <= t1_st)) || !(m_st == 0)) || !(2 <= E_1))) && (((((((((!(m_i == 1) || t1_pc == 1) || E_M == 1) || E_M == 0) || (1 <= \result && 1 <= __retres1)) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(m_st == 0)) || !(2 <= E_1)) - ProcedureContractResult [Line: 129]: Procedure Contract for is_transmit1_triggered Derived contract for procedure is_transmit1_triggered: 1 - ProcedureContractResult [Line: 273]: Procedure Contract for reset_delta_events Derived contract for procedure reset_delta_events: ((((((((((!(m_i == 1) || \old(E_M) == 1) || t1_pc == 1) || (E_1 == \old(E_1) && E_M == \old(E_M))) || \old(E_M) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(m_st == 0)) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || \old(E_M) == 1) || \old(E_M) == 0) || (E_1 == \old(E_1) && E_M == \old(E_M))) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(t1_st == 0)) || !(local <= token))) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || \old(E_M) == 1) || (E_1 == \old(E_1) && E_M == \old(E_M))) || \old(E_M) == 0) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= t1_st)) || !(local <= token)) - ProcedureContractResult [Line: 156]: Procedure Contract for init_threads Derived contract for procedure init_threads: ((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || t1_pc == 1) || !(\old(m_st) == 0)) || E_M == 1) || E_M == 0) || (t1_st == 0 && m_st == 0)) || !(t1_i == 1)) || m_pc == 1) || !(2 <= E_1) - ProcedureContractResult [Line: 462]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for error Derived contract for procedure error: 1 - ProcedureContractResult [Line: 30]: Procedure Contract for master Derived contract for procedure master: ((((((((((!(m_i == 1) || !(t1_pc == 1)) || (((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) || \old(m_pc) == 1) || !(2 <= \old(t1_st))) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) && ((((((((((!(m_i == 1) || !(t1_pc == 1)) || (((((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || E_M == 0) || E_M == 1) || !(2 <= \old(E_1))) || !(t1_i == 1)) || (((((((((2 <= m_st && t1_pc == 1) && !(E_M == 0)) && t1_st == 0) && !(E_M == 1)) && token <= local) && t1_i == 1) && 2 <= E_1) && m_i == 1) && local <= token)) || !(\old(local) + 1 <= \old(token)))) && ((((((((!(\old(t1_st) == 0) || !(m_i == 1)) || t1_pc == 1) || \old(m_pc) == 1) || ((((2 <= m_st && t1_st == 0) && token <= local) && 2 <= E_1) && local <= token)) || E_M == 1) || E_M == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) - ProcedureContractResult [Line: 337]: Procedure Contract for fire_time_events Derived contract for procedure fire_time_events: 1 - ProcedureContractResult [Line: 194]: Procedure Contract for eval Derived contract for procedure eval: (((((((((((((!(m_i == 1) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || (((((((m_st == \old(m_st) && t1_pc == 1) && E_1 == \old(E_1)) && token <= local) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || \old(E_M) == 0) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st))) && ((((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || \old(m_pc) == 1) || \old(E_M) == 0) || !(\old(m_st) == 0)) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || \old(t1_pc) == 1) || !(t1_i == 1)) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token))) && (((((((((((!(m_i == 1) || !(\old(t1_st) == 0)) || \old(E_M) == 1) || !(\old(t1_pc) == 1)) || \old(E_M) == 0) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= \old(m_st))) || (((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && !(E_M == 0)) && !(E_M == 1)) && token <= local) && 2 <= E_1) && local <= token))) && (((!(m_i == 1) || \old(m_pc) == 1) || ((2 <= m_st && !(m_pc == 1)) && m_i == 1)) || !(2 <= \old(m_st))) - ProcedureContractResult [Line: 384]: Procedure Contract for stop_simulation Derived contract for procedure stop_simulation: 1 - ProcedureContractResult [Line: 148]: Procedure Contract for update_channels Derived contract for procedure update_channels: 1 - ProcedureContractResult [Line: 245]: Procedure Contract for fire_delta_events Derived contract for procedure fire_delta_events: (((((((((!(m_i == 1) || \old(E_M) == 1) || t1_pc == 1) || (E_1 == \old(E_1) && E_M == \old(E_M))) || \old(E_M) == 0) || !(2 <= \old(E_1))) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(m_st == 0)) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || \old(E_M) == 1) || (E_1 == \old(E_1) && E_M == \old(E_M))) || \old(E_M) == 0) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= t1_st)) || !(local <= token)) - ProcedureContractResult [Line: 403]: Procedure Contract for start_simulation Derived contract for procedure start_simulation: 1 - ProcedureContractResult [Line: 110]: Procedure Contract for is_master_triggered Derived contract for procedure is_master_triggered: (((((((((((((!(m_i == 1) || t1_pc == 1) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(local <= token)) && (((((((((!(m_i == 1) || t1_pc == 1) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 1) || E_M == 0) || !(t1_i == 1)) || m_pc == 1) || !(t1_st == 0)) || !(m_st == 0)) || !(2 <= E_1))) && (((!(m_i == 1) || !(2 <= m_st)) || m_pc == 1) || (((((0 <= \result && \result <= 0) && 0 <= __retres1) && !(m_pc == 1)) && __retres1 <= 0) && m_i == 1))) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || !(token <= local + 1)) || !(local + 1 <= token)) || t1_st == 0) || !(E_M == 1)) || !(t1_i == 1)) || (1 <= \result && 1 <= __retres1)) || (((((0 <= \result && \result <= 0) && 0 <= __retres1) && !(m_pc == 1)) && __retres1 <= 0) && m_i == 1)) || !(2 <= E_1))) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 0) || E_M == 1) || !(token <= local)) || !(t1_i == 1)) || !(t1_st == 0)) || !(local <= token)) || !(2 <= E_1))) && ((((((((!(m_i == 1) || !(t1_pc == 1)) || (((0 <= \result && \result <= 0) && 0 <= __retres1) && __retres1 <= 0)) || E_M == 1) || E_M == 0) || !(token <= local)) || !(t1_i == 1)) || !(2 <= t1_st)) || !(local <= token)) - ProcedureContractResult [Line: 346]: Procedure Contract for reset_time_events Derived contract for procedure reset_time_events: ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || \old(E_M) == 1) || \old(E_M) == 0) || (E_1 == \old(E_1) && E_M == \old(E_M))) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(t1_st == 0)) || !(local <= token)) && ((((((((((!(m_i == 1) || !(2 <= m_st)) || !(t1_pc == 1)) || \old(E_M) == 1) || (E_1 == \old(E_1) && E_M == \old(E_M))) || \old(E_M) == 0) || !(token <= local)) || !(2 <= \old(E_1))) || !(t1_i == 1)) || !(2 <= t1_st)) || !(local <= token)) - ProcedureContractResult [Line: 374]: Procedure Contract for init_model Derived contract for procedure init_model: ((((((((t1_pc == 1 || E_M == 1) || E_M == 0) || m_pc == 1) || !(t1_st == 0)) || (t1_i == 1 && m_i == 1)) || !(m_st == 0)) || !(2 <= E_1)) || \old(m_i) == 1) || \old(t1_i) == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 218 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 53.2s, OverallIterations: 15, TraceHistogramMax: 7, AutomataDifference: 41.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 86.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3987 SDtfs, 15508 SDslu, 1708 SDs, 0 SdLazy, 23563 SolverSat, 5654 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1274 GetRequests, 855 SyntacticMatches, 1 SemanticMatches, 418 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2832 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4359occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 7567 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 218 LocationsWithAnnotation, 31527 PreInvPairs, 37526 NumberOfFragments, 29585 HoareAnnotationTreeSize, 31527 FomulaSimplifications, 28585733061 FormulaSimplificationTreeSizeReduction, 22.1s HoareSimplificationTime, 218 FomulaSimplificationsInter, 776259 FormulaSimplificationTreeSizeReductionInter, 63.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 3809 NumberOfCodeBlocks, 3809 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3794 ConstructedInterpolants, 0 QuantifiedInterpolants, 1954346 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 2361/2470 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...