/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/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 23:16:14,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 23:16:14,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 23:16:14,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 23:16:14,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 23:16:14,699 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 23:16:14,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 23:16:14,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 23:16:14,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 23:16:14,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 23:16:14,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 23:16:14,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 23:16:14,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 23:16:14,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 23:16:14,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 23:16:14,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 23:16:14,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 23:16:14,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 23:16:14,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 23:16:14,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 23:16:14,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 23:16:14,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 23:16:14,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 23:16:14,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 23:16:14,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 23:16:14,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 23:16:14,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 23:16:14,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 23:16:14,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 23:16:14,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 23:16:14,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 23:16:14,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 23:16:14,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 23:16:14,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 23:16:14,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 23:16:14,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 23:16:14,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 23:16:14,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 23:16:14,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 23:16:14,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 23:16:14,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 23:16:14,757 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:16:14,770 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 23:16:14,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 23:16:14,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 23:16:14,774 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 23:16:14,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 23:16:14,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 23:16:14,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 23:16:14,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 23:16:14,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 23:16:14,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 23:16:14,775 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 23:16:14,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 23:16:14,776 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 23:16:14,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 23:16:14,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 23:16:14,776 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 23:16:14,777 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 23:16:14,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 23:16:14,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 23:16:14,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 23:16:14,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 23:16:14,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 23:16:14,778 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:16:15,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 23:16:15,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 23:16:15,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 23:16:15,257 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 23:16:15,258 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 23:16:15,259 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c [2020-08-22 23:16:15,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42de19af5/2710b1411c904a169ae19ebb09049594/FLAGd3d369f41 [2020-08-22 23:16:16,075 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 23:16:16,076 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2020-08-22 23:16:16,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42de19af5/2710b1411c904a169ae19ebb09049594/FLAGd3d369f41 [2020-08-22 23:16:16,330 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42de19af5/2710b1411c904a169ae19ebb09049594 [2020-08-22 23:16:16,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 23:16:16,349 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 23:16:16,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 23:16:16,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 23:16:16,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 23:16:16,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 11:16:16" (1/1) ... [2020-08-22 23:16:16,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425c36b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:16:16, skipping insertion in model container [2020-08-22 23:16:16,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 11:16:16" (1/1) ... [2020-08-22 23:16:16,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 23:16:16,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 23:16:16,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 23:16:16,756 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 23:16:16,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 23:16:16,858 INFO L208 MainTranslator]: Completed translation [2020-08-22 23:16:16,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:16:16 WrapperNode [2020-08-22 23:16:16,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 23:16:16,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 23:16:16,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 23:16:16,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 23:16:17,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:16:16" (1/1) ... [2020-08-22 23:16:17,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:16:16" (1/1) ... [2020-08-22 23:16:17,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:16:16" (1/1) ... [2020-08-22 23:16:17,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:16:16" (1/1) ... [2020-08-22 23:16:17,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:16:16" (1/1) ... [2020-08-22 23:16:17,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:16:16" (1/1) ... [2020-08-22 23:16:17,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:16:16" (1/1) ... [2020-08-22 23:16:17,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 23:16:17,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 23:16:17,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 23:16:17,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 23:16:17,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:16:16" (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:16:17,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 23:16:17,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 23:16:17,160 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-08-22 23:16:17,160 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-08-22 23:16:17,161 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-08-22 23:16:17,161 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-08-22 23:16:17,161 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-08-22 23:16:17,161 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-08-22 23:16:17,161 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-08-22 23:16:17,161 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-08-22 23:16:17,162 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-08-22 23:16:17,162 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-08-22 23:16:17,162 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-08-22 23:16:17,162 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-08-22 23:16:17,162 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-08-22 23:16:17,163 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-08-22 23:16:17,164 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-08-22 23:16:17,164 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-08-22 23:16:17,165 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-08-22 23:16:17,165 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-08-22 23:16:17,165 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-08-22 23:16:17,165 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-08-22 23:16:17,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 23:16:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 23:16:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 23:16:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-08-22 23:16:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-08-22 23:16:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-08-22 23:16:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-08-22 23:16:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-08-22 23:16:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-08-22 23:16:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-08-22 23:16:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-08-22 23:16:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-08-22 23:16:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-08-22 23:16:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-08-22 23:16:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-08-22 23:16:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-08-22 23:16:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-08-22 23:16:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-08-22 23:16:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-08-22 23:16:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-08-22 23:16:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-08-22 23:16:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-08-22 23:16:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-08-22 23:16:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 23:16:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 23:16:17,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 23:16:18,060 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 23:16:18,061 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-08-22 23:16:18,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 11:16:18 BoogieIcfgContainer [2020-08-22 23:16:18,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 23:16:18,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 23:16:18,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 23:16:18,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 23:16:18,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 11:16:16" (1/3) ... [2020-08-22 23:16:18,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fe49fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 11:16:18, skipping insertion in model container [2020-08-22 23:16:18,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:16:16" (2/3) ... [2020-08-22 23:16:18,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fe49fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 11:16:18, skipping insertion in model container [2020-08-22 23:16:18,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 11:16:18" (3/3) ... [2020-08-22 23:16:18,095 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2020-08-22 23:16:18,114 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 23:16:18,138 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 23:16:18,166 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 23:16:18,215 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 23:16:18,215 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 23:16:18,215 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 23:16:18,216 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 23:16:18,216 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 23:16:18,216 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 23:16:18,216 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 23:16:18,216 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 23:16:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states. [2020-08-22 23:16:18,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-08-22 23:16:18,313 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:18,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:18,316 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:18,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:18,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1383476838, now seen corresponding path program 1 times [2020-08-22 23:16:18,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:18,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [917504791] [2020-08-22 23:16:18,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:18,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:18,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 23:16:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:18,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:18,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-08-22 23:16:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-08-22 23:16:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-08-22 23:16:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:16:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:16:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:16:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-08-22 23:16:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 23:16:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,148 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:16:19,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [917504791] [2020-08-22 23:16:19,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:16:19,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 23:16:19,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750948181] [2020-08-22 23:16:19,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 23:16:19,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:19,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 23:16:19,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 23:16:19,191 INFO L87 Difference]: Start difference. First operand 257 states. Second operand 7 states. [2020-08-22 23:16:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:23,338 INFO L93 Difference]: Finished difference Result 946 states and 1320 transitions. [2020-08-22 23:16:23,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 23:16:23,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2020-08-22 23:16:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:23,372 INFO L225 Difference]: With dead ends: 946 [2020-08-22 23:16:23,372 INFO L226 Difference]: Without dead ends: 707 [2020-08-22 23:16:23,383 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-08-22 23:16:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2020-08-22 23:16:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 472. [2020-08-22 23:16:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2020-08-22 23:16:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 597 transitions. [2020-08-22 23:16:23,627 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 597 transitions. Word has length 127 [2020-08-22 23:16:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:23,630 INFO L479 AbstractCegarLoop]: Abstraction has 472 states and 597 transitions. [2020-08-22 23:16:23,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 23:16:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 597 transitions. [2020-08-22 23:16:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-08-22 23:16:23,639 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:23,639 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:23,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 23:16:23,640 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:23,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1691024482, now seen corresponding path program 1 times [2020-08-22 23:16:23,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:23,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1704730029] [2020-08-22 23:16:23,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 23:16:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-08-22 23:16:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:24,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-08-22 23:16:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:24,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-08-22 23:16:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:24,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:16:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:24,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:16:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:24,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:16:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:24,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-08-22 23:16:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:24,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 23:16:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:24,107 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:16:24,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1704730029] [2020-08-22 23:16:24,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:16:24,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 23:16:24,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514473772] [2020-08-22 23:16:24,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 23:16:24,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:24,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 23:16:24,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-08-22 23:16:24,114 INFO L87 Difference]: Start difference. First operand 472 states and 597 transitions. Second operand 8 states. [2020-08-22 23:16:26,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:26,689 INFO L93 Difference]: Finished difference Result 1128 states and 1479 transitions. [2020-08-22 23:16:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 23:16:26,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2020-08-22 23:16:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:26,702 INFO L225 Difference]: With dead ends: 1128 [2020-08-22 23:16:26,703 INFO L226 Difference]: Without dead ends: 700 [2020-08-22 23:16:26,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2020-08-22 23:16:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2020-08-22 23:16:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 460. [2020-08-22 23:16:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2020-08-22 23:16:26,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 578 transitions. [2020-08-22 23:16:26,846 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 578 transitions. Word has length 128 [2020-08-22 23:16:26,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:26,848 INFO L479 AbstractCegarLoop]: Abstraction has 460 states and 578 transitions. [2020-08-22 23:16:26,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 23:16:26,849 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 578 transitions. [2020-08-22 23:16:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-08-22 23:16:26,855 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:26,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:26,857 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 23:16:26,857 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:26,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:26,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2002481605, now seen corresponding path program 1 times [2020-08-22 23:16:26,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:26,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [654265168] [2020-08-22 23:16:26,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 23:16:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-08-22 23:16:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-08-22 23:16:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-08-22 23:16:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:16:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:16:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:16:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-08-22 23:16:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 23:16:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:27,222 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:16:27,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [654265168] [2020-08-22 23:16:27,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:16:27,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 23:16:27,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137522557] [2020-08-22 23:16:27,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 23:16:27,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:27,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 23:16:27,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 23:16:27,228 INFO L87 Difference]: Start difference. First operand 460 states and 578 transitions. Second operand 7 states. [2020-08-22 23:16:30,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:30,741 INFO L93 Difference]: Finished difference Result 1752 states and 2439 transitions. [2020-08-22 23:16:30,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-22 23:16:30,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2020-08-22 23:16:30,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:30,759 INFO L225 Difference]: With dead ends: 1752 [2020-08-22 23:16:30,759 INFO L226 Difference]: Without dead ends: 1336 [2020-08-22 23:16:30,765 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 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:16:30,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2020-08-22 23:16:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 947. [2020-08-22 23:16:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2020-08-22 23:16:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1238 transitions. [2020-08-22 23:16:30,979 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1238 transitions. Word has length 132 [2020-08-22 23:16:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:30,980 INFO L479 AbstractCegarLoop]: Abstraction has 947 states and 1238 transitions. [2020-08-22 23:16:30,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 23:16:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1238 transitions. [2020-08-22 23:16:30,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-08-22 23:16:30,986 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:30,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 23:16:30,988 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:30,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:30,989 INFO L82 PathProgramCache]: Analyzing trace with hash 537882589, now seen corresponding path program 1 times [2020-08-22 23:16:30,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:30,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1344480731] [2020-08-22 23:16:30,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:31,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:31,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 23:16:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:31,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:31,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-08-22 23:16:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:31,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-08-22 23:16:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:31,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-08-22 23:16:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:31,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:16:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:31,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:16:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:31,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:16:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:31,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-08-22 23:16:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:31,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 23:16:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:31,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-08-22 23:16:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:31,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2020-08-22 23:16:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 23:16:31,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1344480731] [2020-08-22 23:16:31,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:16:31,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 23:16:31,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463134184] [2020-08-22 23:16:31,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 23:16:31,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:31,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 23:16:31,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-22 23:16:31,301 INFO L87 Difference]: Start difference. First operand 947 states and 1238 transitions. Second operand 8 states. [2020-08-22 23:16:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:35,762 INFO L93 Difference]: Finished difference Result 3722 states and 5501 transitions. [2020-08-22 23:16:35,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 23:16:35,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 165 [2020-08-22 23:16:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:35,794 INFO L225 Difference]: With dead ends: 3722 [2020-08-22 23:16:35,795 INFO L226 Difference]: Without dead ends: 2820 [2020-08-22 23:16:35,809 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2020-08-22 23:16:35,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2020-08-22 23:16:36,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2091. [2020-08-22 23:16:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2020-08-22 23:16:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 2967 transitions. [2020-08-22 23:16:36,254 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 2967 transitions. Word has length 165 [2020-08-22 23:16:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:36,255 INFO L479 AbstractCegarLoop]: Abstraction has 2091 states and 2967 transitions. [2020-08-22 23:16:36,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 23:16:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2967 transitions. [2020-08-22 23:16:36,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-08-22 23:16:36,271 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:36,271 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, 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] [2020-08-22 23:16:36,272 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 23:16:36,272 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:36,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:36,273 INFO L82 PathProgramCache]: Analyzing trace with hash 755814652, now seen corresponding path program 1 times [2020-08-22 23:16:36,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:36,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1186718172] [2020-08-22 23:16:36,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 23:16:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-08-22 23:16:36,417 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 42 [2020-08-22 23:16:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-08-22 23:16:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:16:36,463 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 14 [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 25 [2020-08-22 23:16:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-08-22 23:16:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 23:16:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2020-08-22 23:16:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2020-08-22 23:16:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2020-08-22 23:16:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-08-22 23:16:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:16:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:16:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:16:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:16:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-08-22 23:16:36,928 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1186718172] [2020-08-22 23:16:36,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:16:36,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 23:16:36,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192564692] [2020-08-22 23:16:36,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 23:16:36,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:36,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 23:16:36,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-08-22 23:16:36,933 INFO L87 Difference]: Start difference. First operand 2091 states and 2967 transitions. Second operand 12 states. [2020-08-22 23:16:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:44,303 INFO L93 Difference]: Finished difference Result 8991 states and 15078 transitions. [2020-08-22 23:16:44,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-08-22 23:16:44,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 230 [2020-08-22 23:16:44,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:44,408 INFO L225 Difference]: With dead ends: 8991 [2020-08-22 23:16:44,408 INFO L226 Difference]: Without dead ends: 6948 [2020-08-22 23:16:44,460 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2020-08-22 23:16:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6948 states. [2020-08-22 23:16:46,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6948 to 4943. [2020-08-22 23:16:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4943 states. [2020-08-22 23:16:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4943 states to 4943 states and 7731 transitions. [2020-08-22 23:16:46,108 INFO L78 Accepts]: Start accepts. Automaton has 4943 states and 7731 transitions. Word has length 230 [2020-08-22 23:16:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:46,110 INFO L479 AbstractCegarLoop]: Abstraction has 4943 states and 7731 transitions. [2020-08-22 23:16:46,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 23:16:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand 4943 states and 7731 transitions. [2020-08-22 23:16:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2020-08-22 23:16:46,132 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:46,133 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, 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:46,134 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 23:16:46,134 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:46,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:46,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1577887462, now seen corresponding path program 1 times [2020-08-22 23:16:46,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:46,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [825167840] [2020-08-22 23:16:46,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 23:16:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-08-22 23:16:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-08-22 23:16:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-08-22 23:16:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:16:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:16:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:16:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-08-22 23:16:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 23:16:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-08-22 23:16:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2020-08-22 23:16:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-08-22 23:16:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:16:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:16:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:16:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:16:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-08-22 23:16:46,655 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [825167840] [2020-08-22 23:16:46,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:16:46,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 23:16:46,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619047980] [2020-08-22 23:16:46,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 23:16:46,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:46,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 23:16:46,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-08-22 23:16:46,662 INFO L87 Difference]: Start difference. First operand 4943 states and 7731 transitions. Second operand 9 states. [2020-08-22 23:16:52,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:52,179 INFO L93 Difference]: Finished difference Result 14902 states and 25159 transitions. [2020-08-22 23:16:52,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-08-22 23:16:52,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 226 [2020-08-22 23:16:52,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:52,329 INFO L225 Difference]: With dead ends: 14902 [2020-08-22 23:16:52,330 INFO L226 Difference]: Without dead ends: 10009 [2020-08-22 23:16:52,464 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=244, Invalid=568, Unknown=0, NotChecked=0, Total=812 [2020-08-22 23:16:52,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10009 states. [2020-08-22 23:16:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10009 to 8124. [2020-08-22 23:16:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8124 states. [2020-08-22 23:16:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8124 states to 8124 states and 13044 transitions. [2020-08-22 23:16:54,721 INFO L78 Accepts]: Start accepts. Automaton has 8124 states and 13044 transitions. Word has length 226 [2020-08-22 23:16:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:54,722 INFO L479 AbstractCegarLoop]: Abstraction has 8124 states and 13044 transitions. [2020-08-22 23:16:54,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 23:16:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 8124 states and 13044 transitions. [2020-08-22 23:16:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-08-22 23:16:54,749 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:54,749 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, 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:16:54,750 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 23:16:54,750 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:54,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:54,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1697090985, now seen corresponding path program 1 times [2020-08-22 23:16:54,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:54,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [940936342] [2020-08-22 23:16:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:54,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:54,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 23:16:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:54,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:54,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-08-22 23:16:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:54,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-08-22 23:16:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:54,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-08-22 23:16:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:54,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:16:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:54,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:16:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:54,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:16:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:54,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-08-22 23:16:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:54,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 23:16:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:54,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-08-22 23:16:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:54,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2020-08-22 23:16:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:54,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-08-22 23:16:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:55,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:16:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:55,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:55,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:16:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:55,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:16:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:55,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:16:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-08-22 23:16:55,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [940936342] [2020-08-22 23:16:55,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:16:55,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 23:16:55,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238183340] [2020-08-22 23:16:55,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 23:16:55,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:55,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 23:16:55,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:16:55,111 INFO L87 Difference]: Start difference. First operand 8124 states and 13044 transitions. Second operand 10 states. [2020-08-22 23:17:00,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:17:00,764 INFO L93 Difference]: Finished difference Result 18161 states and 29149 transitions. [2020-08-22 23:17:00,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-08-22 23:17:00,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 220 [2020-08-22 23:17:00,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:17:00,893 INFO L225 Difference]: With dead ends: 18161 [2020-08-22 23:17:00,893 INFO L226 Difference]: Without dead ends: 10084 [2020-08-22 23:17:00,969 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2020-08-22 23:17:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10084 states. [2020-08-22 23:17:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10084 to 8110. [2020-08-22 23:17:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8110 states. [2020-08-22 23:17:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8110 states to 8110 states and 13016 transitions. [2020-08-22 23:17:02,331 INFO L78 Accepts]: Start accepts. Automaton has 8110 states and 13016 transitions. Word has length 220 [2020-08-22 23:17:02,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:17:02,332 INFO L479 AbstractCegarLoop]: Abstraction has 8110 states and 13016 transitions. [2020-08-22 23:17:02,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 23:17:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 8110 states and 13016 transitions. [2020-08-22 23:17:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-08-22 23:17:02,356 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:17:02,356 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, 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:17:02,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 23:17:02,357 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:17:02,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:17:02,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1424066057, now seen corresponding path program 1 times [2020-08-22 23:17:02,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:17:02,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [625024464] [2020-08-22 23:17:02,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:17:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:17:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 23:17:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:17:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-08-22 23:17:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-08-22 23:17:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-08-22 23:17:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:17:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:17:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-08-22 23:17:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 23:17:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-08-22 23:17:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2020-08-22 23:17:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-08-22 23:17:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:17:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:17:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:17:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-08-22 23:17:02,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [625024464] [2020-08-22 23:17:02,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:17:02,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 23:17:02,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750275378] [2020-08-22 23:17:02,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 23:17:02,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:17:02,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 23:17:02,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:17:02,734 INFO L87 Difference]: Start difference. First operand 8110 states and 13016 transitions. Second operand 10 states. [2020-08-22 23:17:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:17:11,182 INFO L93 Difference]: Finished difference Result 20709 states and 35077 transitions. [2020-08-22 23:17:11,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-08-22 23:17:11,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 220 [2020-08-22 23:17:11,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:17:11,319 INFO L225 Difference]: With dead ends: 20709 [2020-08-22 23:17:11,320 INFO L226 Difference]: Without dead ends: 12648 [2020-08-22 23:17:11,456 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2020-08-22 23:17:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12648 states. [2020-08-22 23:17:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12648 to 10358. [2020-08-22 23:17:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10358 states. [2020-08-22 23:17:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10358 states to 10358 states and 16032 transitions. [2020-08-22 23:17:13,585 INFO L78 Accepts]: Start accepts. Automaton has 10358 states and 16032 transitions. Word has length 220 [2020-08-22 23:17:13,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:17:13,586 INFO L479 AbstractCegarLoop]: Abstraction has 10358 states and 16032 transitions. [2020-08-22 23:17:13,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 23:17:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 10358 states and 16032 transitions. [2020-08-22 23:17:13,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-08-22 23:17:13,608 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:17:13,609 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, 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] [2020-08-22 23:17:13,609 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 23:17:13,609 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:17:13,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:17:13,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1439116596, now seen corresponding path program 1 times [2020-08-22 23:17:13,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:17:13,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [905643786] [2020-08-22 23:17:13,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:17:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:17:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 23:17:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:17:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-08-22 23:17:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-08-22 23:17:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-08-22 23:17:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:17:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:17:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-08-22 23:17:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 23:17:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-08-22 23:17:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2020-08-22 23:17:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-08-22 23:17:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:17:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:17:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:13,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:17:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-08-22 23:17:14,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [905643786] [2020-08-22 23:17:14,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:17:14,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 23:17:14,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594640228] [2020-08-22 23:17:14,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 23:17:14,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:17:14,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 23:17:14,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-08-22 23:17:14,044 INFO L87 Difference]: Start difference. First operand 10358 states and 16032 transitions. Second operand 12 states. [2020-08-22 23:17:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:17:20,445 INFO L93 Difference]: Finished difference Result 22677 states and 35794 transitions. [2020-08-22 23:17:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-22 23:17:20,446 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 220 [2020-08-22 23:17:20,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:17:20,568 INFO L225 Difference]: With dead ends: 22677 [2020-08-22 23:17:20,568 INFO L226 Difference]: Without dead ends: 9475 [2020-08-22 23:17:20,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2020-08-22 23:17:20,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9475 states. [2020-08-22 23:17:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9475 to 7824. [2020-08-22 23:17:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7824 states. [2020-08-22 23:17:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7824 states to 7824 states and 11208 transitions. [2020-08-22 23:17:22,201 INFO L78 Accepts]: Start accepts. Automaton has 7824 states and 11208 transitions. Word has length 220 [2020-08-22 23:17:22,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:17:22,202 INFO L479 AbstractCegarLoop]: Abstraction has 7824 states and 11208 transitions. [2020-08-22 23:17:22,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 23:17:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 7824 states and 11208 transitions. [2020-08-22 23:17:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-08-22 23:17:22,213 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:17:22,214 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, 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:17:22,214 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 23:17:22,214 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:17:22,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:17:22,215 INFO L82 PathProgramCache]: Analyzing trace with hash 219517836, now seen corresponding path program 1 times [2020-08-22 23:17:22,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:17:22,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1822234485] [2020-08-22 23:17:22,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:17:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:17:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 23:17:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:17:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-08-22 23:17:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-08-22 23:17:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-08-22 23:17:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:17:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:17:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-08-22 23:17:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 23:17:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-08-22 23:17:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2020-08-22 23:17:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-08-22 23:17:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:17:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:17:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:17:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:22,659 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-08-22 23:17:22,660 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1822234485] [2020-08-22 23:17:22,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:17:22,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 23:17:22,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433561913] [2020-08-22 23:17:22,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 23:17:22,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:17:22,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 23:17:22,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:17:22,664 INFO L87 Difference]: Start difference. First operand 7824 states and 11208 transitions. Second operand 10 states. [2020-08-22 23:17:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:17:29,740 INFO L93 Difference]: Finished difference Result 24720 states and 38989 transitions. [2020-08-22 23:17:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-08-22 23:17:29,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 230 [2020-08-22 23:17:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:17:29,920 INFO L225 Difference]: With dead ends: 24720 [2020-08-22 23:17:29,921 INFO L226 Difference]: Without dead ends: 16939 [2020-08-22 23:17:30,081 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2020-08-22 23:17:30,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16939 states. [2020-08-22 23:17:32,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16939 to 14239. [2020-08-22 23:17:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14239 states. [2020-08-22 23:17:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14239 states to 14239 states and 20157 transitions. [2020-08-22 23:17:32,603 INFO L78 Accepts]: Start accepts. Automaton has 14239 states and 20157 transitions. Word has length 230 [2020-08-22 23:17:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:17:32,604 INFO L479 AbstractCegarLoop]: Abstraction has 14239 states and 20157 transitions. [2020-08-22 23:17:32,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 23:17:32,604 INFO L276 IsEmpty]: Start isEmpty. Operand 14239 states and 20157 transitions. [2020-08-22 23:17:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2020-08-22 23:17:32,640 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:17:32,640 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-08-22 23:17:32,641 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 23:17:32,641 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:17:32,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:17:32,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1575682267, now seen corresponding path program 1 times [2020-08-22 23:17:32,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:17:32,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [744486306] [2020-08-22 23:17:32,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:17:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:17:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 23:17:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:17:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-08-22 23:17:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-08-22 23:17:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-08-22 23:17:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:17:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:17:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-08-22 23:17:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 23:17:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:17:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:17:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-08-22 23:17:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-08-22 23:17:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-08-22 23:17:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-08-22 23:17:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:17:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:17:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-08-22 23:17:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2020-08-22 23:17:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2020-08-22 23:17:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:17:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:32,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2020-08-22 23:17:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 39 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2020-08-22 23:17:33,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [744486306] [2020-08-22 23:17:33,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:17:33,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 23:17:33,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419096499] [2020-08-22 23:17:33,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 23:17:33,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:17:33,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 23:17:33,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-08-22 23:17:33,176 INFO L87 Difference]: Start difference. First operand 14239 states and 20157 transitions. Second operand 12 states. [2020-08-22 23:17:35,253 WARN L193 SmtUtils]: Spent 919.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-08-22 23:17:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:17:40,240 INFO L93 Difference]: Finished difference Result 30730 states and 43848 transitions. [2020-08-22 23:17:40,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-08-22 23:17:40,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 280 [2020-08-22 23:17:40,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:17:40,395 INFO L225 Difference]: With dead ends: 30730 [2020-08-22 23:17:40,396 INFO L226 Difference]: Without dead ends: 16536 [2020-08-22 23:17:40,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=310, Invalid=1022, Unknown=0, NotChecked=0, Total=1332 [2020-08-22 23:17:40,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16536 states. [2020-08-22 23:17:42,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16536 to 12212. [2020-08-22 23:17:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12212 states. [2020-08-22 23:17:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12212 states to 12212 states and 16213 transitions. [2020-08-22 23:17:42,549 INFO L78 Accepts]: Start accepts. Automaton has 12212 states and 16213 transitions. Word has length 280 [2020-08-22 23:17:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:17:42,551 INFO L479 AbstractCegarLoop]: Abstraction has 12212 states and 16213 transitions. [2020-08-22 23:17:42,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 23:17:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 12212 states and 16213 transitions. [2020-08-22 23:17:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2020-08-22 23:17:42,572 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:17:42,573 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:17:42,573 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 23:17:42,573 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:17:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:17:42,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1226891913, now seen corresponding path program 1 times [2020-08-22 23:17:42,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:17:42,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2071606549] [2020-08-22 23:17:42,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:17:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:17:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-22 23:17:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:17:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2020-08-22 23:17:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-08-22 23:17:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-08-22 23:17:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:17:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-08-22 23:17:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-08-22 23:17:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 23:17:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-08-22 23:17:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2020-08-22 23:17:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2020-08-22 23:17:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2020-08-22 23:17:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:17:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:17:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:17:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2020-08-22 23:17:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:17:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 23:17:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:17:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:42,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-22 23:17:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:17:43,184 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-08-22 23:17:43,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2071606549] [2020-08-22 23:17:43,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:17:43,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-08-22 23:17:43,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794354453] [2020-08-22 23:17:43,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 23:17:43,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:17:43,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 23:17:43,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-08-22 23:17:43,189 INFO L87 Difference]: Start difference. First operand 12212 states and 16213 transitions. Second operand 15 states. [2020-08-22 23:17:55,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:17:55,472 INFO L93 Difference]: Finished difference Result 21296 states and 28380 transitions. [2020-08-22 23:17:55,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2020-08-22 23:17:55,473 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 295 [2020-08-22 23:17:55,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:17:55,543 INFO L225 Difference]: With dead ends: 21296 [2020-08-22 23:17:55,543 INFO L226 Difference]: Without dead ends: 9178 [2020-08-22 23:17:55,640 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1405 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1168, Invalid=3944, Unknown=0, NotChecked=0, Total=5112 [2020-08-22 23:17:55,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9178 states. [2020-08-22 23:17:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9178 to 7287. [2020-08-22 23:17:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7287 states. [2020-08-22 23:17:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7287 states to 7287 states and 8914 transitions. [2020-08-22 23:17:56,812 INFO L78 Accepts]: Start accepts. Automaton has 7287 states and 8914 transitions. Word has length 295 [2020-08-22 23:17:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:17:56,816 INFO L479 AbstractCegarLoop]: Abstraction has 7287 states and 8914 transitions. [2020-08-22 23:17:56,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 23:17:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 7287 states and 8914 transitions. [2020-08-22 23:17:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2020-08-22 23:17:56,834 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:17:56,835 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:17:56,835 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 23:17:56,835 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:17:56,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:17:56,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1144377897, now seen corresponding path program 1 times [2020-08-22 23:17:56,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:17:56,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [273477674] [2020-08-22 23:17:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:17:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 23:17:56,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 23:17:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 23:17:56,917 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 23:17:57,055 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-22 23:17:57,056 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 23:17:57,056 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 23:17:57,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 11:17:57 BoogieIcfgContainer [2020-08-22 23:17:57,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 23:17:57,309 INFO L168 Benchmark]: Toolchain (without parser) took 100959.64 ms. Allocated memory was 138.4 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 102.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2020-08-22 23:17:57,310 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 138.4 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-08-22 23:17:57,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 510.17 ms. Allocated memory is still 138.4 MB. Free memory was 102.1 MB in the beginning and 87.8 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-08-22 23:17:57,312 INFO L168 Benchmark]: Boogie Preprocessor took 203.68 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 87.8 MB in the beginning and 178.9 MB in the end (delta: -91.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2020-08-22 23:17:57,313 INFO L168 Benchmark]: RCFGBuilder took 1008.26 ms. Allocated memory is still 202.4 MB. Free memory was 178.2 MB in the beginning and 136.4 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. [2020-08-22 23:17:57,313 INFO L168 Benchmark]: TraceAbstraction took 99226.50 ms. Allocated memory was 202.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 135.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2020-08-22 23:17:57,317 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.50 ms. Allocated memory is still 138.4 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 510.17 ms. Allocated memory is still 138.4 MB. Free memory was 102.1 MB in the beginning and 87.8 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 203.68 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 87.8 MB in the beginning and 178.9 MB in the end (delta: -91.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1008.26 ms. Allocated memory is still 202.4 MB. Free memory was 178.2 MB in the beginning and 136.4 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99226.50 ms. Allocated memory was 202.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 135.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=12, \old(m_st)=11, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=13, \old(t2_i)=7, \old(t2_pc)=8, \old(t2_st)=10, E_1=16, E_2=5, M_E=14, m_i=6, m_pc=0, m_st=11, T1_E=3, t1_i=15, t1_pc=9, t1_st=4, T2_E=13, t2_i=7, t2_pc=8, t2_st=10] [L16] int t1_pc = 0; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=12, \old(m_st)=11, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=13, \old(t2_i)=7, \old(t2_pc)=8, \old(t2_st)=10, E_1=16, E_2=5, M_E=14, m_i=6, m_pc=0, m_st=11, T1_E=3, t1_i=15, t1_pc=0, t1_st=4, T2_E=13, t2_i=7, t2_pc=8, t2_st=10] [L17] int t2_pc = 0; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=12, \old(m_st)=11, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=13, \old(t2_i)=7, \old(t2_pc)=8, \old(t2_st)=10, E_1=16, E_2=5, M_E=14, m_i=6, m_pc=0, m_st=11, T1_E=3, t1_i=15, t1_pc=0, t1_st=4, T2_E=13, t2_i=7, t2_pc=0, t2_st=10] [L18] int m_st ; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=12, \old(m_st)=11, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=13, \old(t2_i)=7, \old(t2_pc)=8, \old(t2_st)=10, E_1=16, E_2=5, M_E=14, m_i=6, m_pc=0, m_st=0, T1_E=3, t1_i=15, t1_pc=0, t1_st=4, T2_E=13, t2_i=7, t2_pc=0, t2_st=10] [L19] int t1_st ; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=12, \old(m_st)=11, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=13, \old(t2_i)=7, \old(t2_pc)=8, \old(t2_st)=10, E_1=16, E_2=5, M_E=14, m_i=6, m_pc=0, m_st=0, T1_E=3, t1_i=15, t1_pc=0, t1_st=0, T2_E=13, t2_i=7, t2_pc=0, t2_st=10] [L20] int t2_st ; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=12, \old(m_st)=11, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=13, \old(t2_i)=7, \old(t2_pc)=8, \old(t2_st)=10, E_1=16, E_2=5, M_E=14, m_i=6, m_pc=0, m_st=0, T1_E=3, t1_i=15, t1_pc=0, t1_st=0, T2_E=13, t2_i=7, t2_pc=0, t2_st=0] [L21] int m_i ; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=12, \old(m_st)=11, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=13, \old(t2_i)=7, \old(t2_pc)=8, \old(t2_st)=10, E_1=16, E_2=5, M_E=14, m_i=0, m_pc=0, m_st=0, T1_E=3, t1_i=15, t1_pc=0, t1_st=0, T2_E=13, t2_i=7, t2_pc=0, t2_st=0] [L22] int t1_i ; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=12, \old(m_st)=11, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=13, \old(t2_i)=7, \old(t2_pc)=8, \old(t2_st)=10, E_1=16, E_2=5, M_E=14, m_i=0, m_pc=0, m_st=0, T1_E=3, t1_i=0, t1_pc=0, t1_st=0, T2_E=13, t2_i=7, t2_pc=0, t2_st=0] [L23] int t2_i ; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=12, \old(m_st)=11, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=13, \old(t2_i)=7, \old(t2_pc)=8, \old(t2_st)=10, E_1=16, E_2=5, M_E=14, m_i=0, m_pc=0, m_st=0, T1_E=3, t1_i=0, t1_pc=0, t1_st=0, T2_E=13, t2_i=0, t2_pc=0, t2_st=0] [L24] int M_E = 2; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=12, \old(m_st)=11, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=13, \old(t2_i)=7, \old(t2_pc)=8, \old(t2_st)=10, E_1=16, E_2=5, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=3, t1_i=0, t1_pc=0, t1_st=0, T2_E=13, t2_i=0, t2_pc=0, t2_st=0] [L25] int T1_E = 2; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=12, \old(m_st)=11, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=13, \old(t2_i)=7, \old(t2_pc)=8, \old(t2_st)=10, E_1=16, E_2=5, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=13, t2_i=0, t2_pc=0, t2_st=0] [L26] int T2_E = 2; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=12, \old(m_st)=11, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=13, \old(t2_i)=7, \old(t2_pc)=8, \old(t2_st)=10, E_1=16, E_2=5, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L27] int E_1 = 2; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=12, \old(m_st)=11, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=13, \old(t2_i)=7, \old(t2_pc)=8, \old(t2_st)=10, E_1=2, E_2=5, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L28] int E_2 = 2; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=12, \old(m_st)=11, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=13, \old(t2_i)=7, \old(t2_pc)=8, \old(t2_st)=10, E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L563] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L567] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L477] m_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L478] t1_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L479] t2_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L567] RET init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L568] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L504] int kernel_st ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L505] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L506] int tmp___0 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L510] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L511] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L512] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L211] COND TRUE m_i == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L212] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L216] COND TRUE t1_i == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L217] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L221] COND TRUE t2_i == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L222] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L512] RET init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L513] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L324] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L329] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L513] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L514] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L387] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L388] int tmp___0 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L389] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L393] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L143] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L146] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L158] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L393] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L393] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L395] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L401] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L162] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L165] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L177] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L401] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L401] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L403] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L409] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L181] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L184] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L196] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L409] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_transmit2_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L409] tmp___1 = is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, is_transmit2_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0] [L411] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0] [L514] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L515] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L357] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L362] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L515] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L518] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L521] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, kernel_st=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL eval() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L257] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L261] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L264] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L231] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L234] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L235] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L252] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L264] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L264] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L266] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L271] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L272] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L273] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __VERIFIER_nondet_int()=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L274] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L285] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L286] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L287] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L288] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L290] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L291] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L78] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L89] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L91] t1_pc = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L92] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L291] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L299] COND TRUE t2_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L300] int tmp_ndt_3; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L301] tmp_ndt_3 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L302] COND TRUE \read(tmp_ndt_3) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L304] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L305] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L113] COND TRUE t2_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L124] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L126] t2_pc = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L127] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L305] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L261] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L264] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L231] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L234] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L235] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L252] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L264] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L264] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L266] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L271] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L272] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_2=1, tmp_ndt_3=1] [L273] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L274] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L276] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L277] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L37] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L48] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L51] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L52] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L425] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L387] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L388] int tmp___0 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L389] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L143] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L146] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L395] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L401] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L162] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L165] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] COND TRUE E_1 == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L167] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L401] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L401] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L403] COND TRUE \read(tmp___0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L404] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L409] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L181] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L184] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L409] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, is_transmit2_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L409] tmp___1 = is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, is_transmit2_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0] [L411] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0] [L425] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L52] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L53] E_1 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L56] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] m_pc = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L59] m_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L277] RET master() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L285] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L286] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_3=1] [L287] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L288] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L290] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L291] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L78] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L81] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L97] E_2 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L98] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L425] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L387] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L388] int tmp___0 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L389] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L143] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L146] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L147] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, is_master_triggered()=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, is_master_triggered()=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L395] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L401] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L162] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L165] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L401] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L401] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L403] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L409] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L181] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L184] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] COND TRUE E_2 == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L186] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L409] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, is_transmit2_triggered()=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L409] tmp___1 = is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, is_transmit2_triggered()=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, tmp___1=1] [L411] COND TRUE \read(tmp___1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, tmp___1=1] [L412] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1] [L425] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L98] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L99] E_2 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L89] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L91] t1_pc = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L92] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L291] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L299] COND TRUE t2_st == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L300] int tmp_ndt_3; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L301] tmp_ndt_3 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __VERIFIER_nondet_int()=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L302] COND TRUE \read(tmp_ndt_3) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L304] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L305] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L113] COND FALSE !(t2_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L116] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L132] CALL error() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L11] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 257 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 98.8s, OverallIterations: 13, TraceHistogramMax: 5, AutomataDifference: 76.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3861 SDtfs, 18729 SDslu, 1572 SDs, 0 SdLazy, 24301 SolverSat, 5644 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 905 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3545 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14239occurred 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: 15.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 20313 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2769 NumberOfCodeBlocks, 2769 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2461 ConstructedInterpolants, 0 QuantifiedInterpolants, 1082621 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 696/725 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 incorrect! Received shutdown request...