/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 11:36:03,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 11:36:03,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 11:36:03,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 11:36:03,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 11:36:03,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 11:36:03,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 11:36:03,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 11:36:03,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 11:36:03,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 11:36:03,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 11:36:03,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 11:36:03,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 11:36:03,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 11:36:03,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 11:36:03,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 11:36:03,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 11:36:03,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 11:36:03,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 11:36:03,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 11:36:03,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 11:36:03,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 11:36:03,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 11:36:03,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 11:36:03,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 11:36:03,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 11:36:03,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 11:36:03,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 11:36:03,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 11:36:03,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 11:36:03,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 11:36:03,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 11:36:03,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 11:36:03,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 11:36:03,653 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 11:36:03,653 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 11:36:03,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 11:36:03,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 11:36:03,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 11:36:03,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 11:36:03,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 11:36:03,657 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-07 11:36:03,691 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 11:36:03,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 11:36:03,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-07 11:36:03,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-07 11:36:03,696 INFO L138 SettingsManager]: * Use SBE=true [2020-07-07 11:36:03,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 11:36:03,698 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 11:36:03,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 11:36:03,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 11:36:03,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 11:36:03,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 11:36:03,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 11:36:03,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 11:36:03,699 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 11:36:03,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 11:36:03,700 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 11:36:03,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 11:36:03,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 11:36:03,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-07 11:36:03,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 11:36:03,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 11:36:03,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:36:03,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 11:36:03,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-07 11:36:03,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-07 11:36:03,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-07 11:36:03,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-07 11:36:03,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 11:36:03,703 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-07 11:36:03,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-07 11:36:04,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 11:36:04,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 11:36:04,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 11:36:04,033 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 11:36:04,033 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 11:36:04,034 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-07-07 11:36:04,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa5b0638/d2a0be041ed34677975c7c1b81eca695/FLAGbb28a8c7c [2020-07-07 11:36:04,578 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 11:36:04,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-07-07 11:36:04,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa5b0638/d2a0be041ed34677975c7c1b81eca695/FLAGbb28a8c7c [2020-07-07 11:36:04,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa5b0638/d2a0be041ed34677975c7c1b81eca695 [2020-07-07 11:36:04,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 11:36:04,920 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 11:36:04,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 11:36:04,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 11:36:04,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 11:36:04,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:36:04" (1/1) ... [2020-07-07 11:36:04,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9e62ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:04, skipping insertion in model container [2020-07-07 11:36:04,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:36:04" (1/1) ... [2020-07-07 11:36:04,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 11:36:04,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 11:36:05,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:36:05,279 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 11:36:05,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:36:05,443 INFO L208 MainTranslator]: Completed translation [2020-07-07 11:36:05,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05 WrapperNode [2020-07-07 11:36:05,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 11:36:05,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 11:36:05,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 11:36:05,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 11:36:05,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... [2020-07-07 11:36:05,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 11:36:05,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 11:36:05,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 11:36:05,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 11:36:05,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:36:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 11:36:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 11:36:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-07 11:36:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-07 11:36:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-07 11:36:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-07-07 11:36:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-07 11:36:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-07 11:36:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-07-07 11:36:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-07 11:36:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-07 11:36:05,555 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-07 11:36:05,555 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-07 11:36:05,555 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-07 11:36:05,555 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-07 11:36:05,555 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-07 11:36:05,555 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-07 11:36:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-07 11:36:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-07 11:36:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-07 11:36:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-07 11:36:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-07 11:36:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 11:36:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 11:36:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-07 11:36:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-07 11:36:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-07 11:36:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-07-07 11:36:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-07 11:36:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 11:36:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-07 11:36:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-07 11:36:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-07-07 11:36:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-07 11:36:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-07 11:36:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-07 11:36:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-07 11:36:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-07 11:36:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-07 11:36:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-07 11:36:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-07 11:36:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-07 11:36:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-07 11:36:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-07 11:36:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-07 11:36:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 11:36:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 11:36:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 11:36:06,128 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 11:36:06,129 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-07 11:36:06,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:36:06 BoogieIcfgContainer [2020-07-07 11:36:06,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 11:36:06,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 11:36:06,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 11:36:06,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 11:36:06,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 11:36:04" (1/3) ... [2020-07-07 11:36:06,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640f5cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:36:06, skipping insertion in model container [2020-07-07 11:36:06,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:36:05" (2/3) ... [2020-07-07 11:36:06,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640f5cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:36:06, skipping insertion in model container [2020-07-07 11:36:06,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:36:06" (3/3) ... [2020-07-07 11:36:06,143 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-07-07 11:36:06,151 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-07 11:36:06,159 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 11:36:06,171 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 11:36:06,195 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 11:36:06,196 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 11:36:06,196 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-07 11:36:06,196 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 11:36:06,196 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 11:36:06,196 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 11:36:06,196 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 11:36:06,197 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 11:36:06,219 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2020-07-07 11:36:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-07 11:36:06,231 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:06,232 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] [2020-07-07 11:36:06,233 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:06,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:06,239 INFO L82 PathProgramCache]: Analyzing trace with hash -67309704, now seen corresponding path program 1 times [2020-07-07 11:36:06,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:06,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57872876] [2020-07-07 11:36:06,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:36:06,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57872876] [2020-07-07 11:36:06,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:06,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-07 11:36:06,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920750080] [2020-07-07 11:36:06,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 11:36:06,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:06,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 11:36:06,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:36:06,980 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 14 states. [2020-07-07 11:36:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:09,620 INFO L93 Difference]: Finished difference Result 449 states and 710 transitions. [2020-07-07 11:36:09,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-07 11:36:09,622 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2020-07-07 11:36:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:09,651 INFO L225 Difference]: With dead ends: 449 [2020-07-07 11:36:09,651 INFO L226 Difference]: Without dead ends: 276 [2020-07-07 11:36:09,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2020-07-07 11:36:09,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-07-07 11:36:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 177. [2020-07-07 11:36:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-07 11:36:09,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 237 transitions. [2020-07-07 11:36:09,738 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 237 transitions. Word has length 92 [2020-07-07 11:36:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:09,738 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 237 transitions. [2020-07-07 11:36:09,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 11:36:09,739 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 237 transitions. [2020-07-07 11:36:09,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-07 11:36:09,743 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:09,743 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] [2020-07-07 11:36:09,744 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 11:36:09,744 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:09,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:09,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2098275908, now seen corresponding path program 1 times [2020-07-07 11:36:09,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:09,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022678161] [2020-07-07 11:36:09,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:36:09,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022678161] [2020-07-07 11:36:09,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:09,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:36:09,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331116608] [2020-07-07 11:36:09,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:36:09,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:09,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:36:09,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:09,963 INFO L87 Difference]: Start difference. First operand 177 states and 237 transitions. Second operand 10 states. [2020-07-07 11:36:11,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:11,393 INFO L93 Difference]: Finished difference Result 425 states and 610 transitions. [2020-07-07 11:36:11,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 11:36:11,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-07 11:36:11,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:11,397 INFO L225 Difference]: With dead ends: 425 [2020-07-07 11:36:11,398 INFO L226 Difference]: Without dead ends: 268 [2020-07-07 11:36:11,400 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-07-07 11:36:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-07-07 11:36:11,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 177. [2020-07-07 11:36:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-07 11:36:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2020-07-07 11:36:11,444 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 92 [2020-07-07 11:36:11,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:11,445 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2020-07-07 11:36:11,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:36:11,445 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2020-07-07 11:36:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-07 11:36:11,448 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:11,449 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] [2020-07-07 11:36:11,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 11:36:11,449 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:11,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:11,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1653808840, now seen corresponding path program 1 times [2020-07-07 11:36:11,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:11,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359951489] [2020-07-07 11:36:11,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:36:11,699 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359951489] [2020-07-07 11:36:11,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:11,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:36:11,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408032514] [2020-07-07 11:36:11,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:36:11,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:11,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:36:11,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:11,704 INFO L87 Difference]: Start difference. First operand 177 states and 234 transitions. Second operand 10 states. [2020-07-07 11:36:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:13,520 INFO L93 Difference]: Finished difference Result 504 states and 747 transitions. [2020-07-07 11:36:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 11:36:13,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-07 11:36:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:13,525 INFO L225 Difference]: With dead ends: 504 [2020-07-07 11:36:13,526 INFO L226 Difference]: Without dead ends: 347 [2020-07-07 11:36:13,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-07-07 11:36:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-07-07 11:36:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 213. [2020-07-07 11:36:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-07-07 11:36:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 274 transitions. [2020-07-07 11:36:13,581 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 274 transitions. Word has length 92 [2020-07-07 11:36:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:13,582 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 274 transitions. [2020-07-07 11:36:13,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:36:13,582 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 274 transitions. [2020-07-07 11:36:13,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-07 11:36:13,584 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:13,584 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] [2020-07-07 11:36:13,584 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 11:36:13,584 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:13,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:13,585 INFO L82 PathProgramCache]: Analyzing trace with hash -550041895, now seen corresponding path program 1 times [2020-07-07 11:36:13,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:13,585 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313570799] [2020-07-07 11:36:13,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:36:13,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313570799] [2020-07-07 11:36:13,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:13,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:36:13,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453413306] [2020-07-07 11:36:13,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:36:13,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:13,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:36:13,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:13,795 INFO L87 Difference]: Start difference. First operand 213 states and 274 transitions. Second operand 10 states. [2020-07-07 11:36:15,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:15,639 INFO L93 Difference]: Finished difference Result 586 states and 840 transitions. [2020-07-07 11:36:15,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 11:36:15,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-07 11:36:15,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:15,644 INFO L225 Difference]: With dead ends: 586 [2020-07-07 11:36:15,644 INFO L226 Difference]: Without dead ends: 393 [2020-07-07 11:36:15,646 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2020-07-07 11:36:15,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-07-07 11:36:15,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 249. [2020-07-07 11:36:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2020-07-07 11:36:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 312 transitions. [2020-07-07 11:36:15,686 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 312 transitions. Word has length 92 [2020-07-07 11:36:15,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:15,687 INFO L479 AbstractCegarLoop]: Abstraction has 249 states and 312 transitions. [2020-07-07 11:36:15,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:36:15,687 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 312 transitions. [2020-07-07 11:36:15,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-07 11:36:15,692 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:15,693 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] [2020-07-07 11:36:15,693 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 11:36:15,693 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:15,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:15,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1219969707, now seen corresponding path program 1 times [2020-07-07 11:36:15,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:15,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311618021] [2020-07-07 11:36:15,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:36:15,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311618021] [2020-07-07 11:36:15,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:15,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:36:15,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552446956] [2020-07-07 11:36:15,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:36:15,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:15,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:36:15,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:15,900 INFO L87 Difference]: Start difference. First operand 249 states and 312 transitions. Second operand 10 states. [2020-07-07 11:36:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:17,751 INFO L93 Difference]: Finished difference Result 663 states and 922 transitions. [2020-07-07 11:36:17,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 11:36:17,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-07 11:36:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:17,755 INFO L225 Difference]: With dead ends: 663 [2020-07-07 11:36:17,755 INFO L226 Difference]: Without dead ends: 434 [2020-07-07 11:36:17,756 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-07-07 11:36:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-07-07 11:36:17,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 282. [2020-07-07 11:36:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-07-07 11:36:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 345 transitions. [2020-07-07 11:36:17,789 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 345 transitions. Word has length 92 [2020-07-07 11:36:17,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:17,789 INFO L479 AbstractCegarLoop]: Abstraction has 282 states and 345 transitions. [2020-07-07 11:36:17,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:36:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 345 transitions. [2020-07-07 11:36:17,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-07 11:36:17,791 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:17,791 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] [2020-07-07 11:36:17,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 11:36:17,792 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:17,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:17,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1929357560, now seen corresponding path program 1 times [2020-07-07 11:36:17,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:17,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606336727] [2020-07-07 11:36:17,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:36:17,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606336727] [2020-07-07 11:36:17,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:17,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:36:17,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187084163] [2020-07-07 11:36:17,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:36:17,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:17,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:36:17,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:17,977 INFO L87 Difference]: Start difference. First operand 282 states and 345 transitions. Second operand 10 states. [2020-07-07 11:36:19,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:19,722 INFO L93 Difference]: Finished difference Result 674 states and 877 transitions. [2020-07-07 11:36:19,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 11:36:19,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-07 11:36:19,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:19,727 INFO L225 Difference]: With dead ends: 674 [2020-07-07 11:36:19,727 INFO L226 Difference]: Without dead ends: 413 [2020-07-07 11:36:19,729 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-07-07 11:36:19,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-07-07 11:36:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 287. [2020-07-07 11:36:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2020-07-07 11:36:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 347 transitions. [2020-07-07 11:36:19,759 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 347 transitions. Word has length 92 [2020-07-07 11:36:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:19,759 INFO L479 AbstractCegarLoop]: Abstraction has 287 states and 347 transitions. [2020-07-07 11:36:19,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:36:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 347 transitions. [2020-07-07 11:36:19,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-07 11:36:19,761 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:19,761 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] [2020-07-07 11:36:19,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 11:36:19,762 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:19,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:19,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1031964282, now seen corresponding path program 1 times [2020-07-07 11:36:19,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:19,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731576128] [2020-07-07 11:36:19,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:36:19,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731576128] [2020-07-07 11:36:19,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:19,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:36:19,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63653538] [2020-07-07 11:36:19,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:36:19,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:19,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:36:19,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:19,977 INFO L87 Difference]: Start difference. First operand 287 states and 347 transitions. Second operand 10 states. [2020-07-07 11:36:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:22,488 INFO L93 Difference]: Finished difference Result 1068 states and 1350 transitions. [2020-07-07 11:36:22,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 11:36:22,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-07 11:36:22,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:22,499 INFO L225 Difference]: With dead ends: 1068 [2020-07-07 11:36:22,499 INFO L226 Difference]: Without dead ends: 801 [2020-07-07 11:36:22,505 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-07 11:36:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2020-07-07 11:36:22,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 591. [2020-07-07 11:36:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-07 11:36:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 707 transitions. [2020-07-07 11:36:22,582 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 707 transitions. Word has length 92 [2020-07-07 11:36:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:22,583 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 707 transitions. [2020-07-07 11:36:22,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:36:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 707 transitions. [2020-07-07 11:36:22,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-07 11:36:22,584 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:22,585 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] [2020-07-07 11:36:22,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 11:36:22,585 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:22,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:22,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1054596536, now seen corresponding path program 1 times [2020-07-07 11:36:22,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:22,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62255632] [2020-07-07 11:36:22,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:36:22,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62255632] [2020-07-07 11:36:22,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:22,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 11:36:22,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840024884] [2020-07-07 11:36:22,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 11:36:22,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:22,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 11:36:22,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-07 11:36:22,737 INFO L87 Difference]: Start difference. First operand 591 states and 707 transitions. Second operand 7 states. [2020-07-07 11:36:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:24,521 INFO L93 Difference]: Finished difference Result 2051 states and 2640 transitions. [2020-07-07 11:36:24,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:36:24,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2020-07-07 11:36:24,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:24,532 INFO L225 Difference]: With dead ends: 2051 [2020-07-07 11:36:24,532 INFO L226 Difference]: Without dead ends: 1481 [2020-07-07 11:36:24,535 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:36:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2020-07-07 11:36:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1207. [2020-07-07 11:36:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2020-07-07 11:36:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1495 transitions. [2020-07-07 11:36:24,655 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1495 transitions. Word has length 92 [2020-07-07 11:36:24,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:24,656 INFO L479 AbstractCegarLoop]: Abstraction has 1207 states and 1495 transitions. [2020-07-07 11:36:24,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 11:36:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1495 transitions. [2020-07-07 11:36:24,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-07-07 11:36:24,659 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:24,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:36:24,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 11:36:24,660 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:24,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:24,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1357284192, now seen corresponding path program 1 times [2020-07-07 11:36:24,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:24,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478184922] [2020-07-07 11:36:24,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-07-07 11:36:24,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478184922] [2020-07-07 11:36:24,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:24,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 11:36:24,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431166763] [2020-07-07 11:36:24,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:36:24,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:24,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:36:24,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:36:24,895 INFO L87 Difference]: Start difference. First operand 1207 states and 1495 transitions. Second operand 9 states. [2020-07-07 11:36:27,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:27,475 INFO L93 Difference]: Finished difference Result 3860 states and 4987 transitions. [2020-07-07 11:36:27,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 11:36:27,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2020-07-07 11:36:27,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:27,492 INFO L225 Difference]: With dead ends: 3860 [2020-07-07 11:36:27,492 INFO L226 Difference]: Without dead ends: 2675 [2020-07-07 11:36:27,497 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2020-07-07 11:36:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2675 states. [2020-07-07 11:36:27,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2675 to 2303. [2020-07-07 11:36:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2303 states. [2020-07-07 11:36:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 2940 transitions. [2020-07-07 11:36:27,729 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 2940 transitions. Word has length 147 [2020-07-07 11:36:27,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:27,731 INFO L479 AbstractCegarLoop]: Abstraction has 2303 states and 2940 transitions. [2020-07-07 11:36:27,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:36:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2940 transitions. [2020-07-07 11:36:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-07 11:36:27,738 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:27,741 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, 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] [2020-07-07 11:36:27,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 11:36:27,742 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:27,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:27,742 INFO L82 PathProgramCache]: Analyzing trace with hash 674078602, now seen corresponding path program 1 times [2020-07-07 11:36:27,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:27,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477235246] [2020-07-07 11:36:27,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-07-07 11:36:28,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477235246] [2020-07-07 11:36:28,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:28,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:36:28,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793093727] [2020-07-07 11:36:28,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:36:28,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:28,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:36:28,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:28,181 INFO L87 Difference]: Start difference. First operand 2303 states and 2940 transitions. Second operand 10 states. [2020-07-07 11:36:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:30,860 INFO L93 Difference]: Finished difference Result 6901 states and 9607 transitions. [2020-07-07 11:36:30,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 11:36:30,862 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2020-07-07 11:36:30,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:30,890 INFO L225 Difference]: With dead ends: 6901 [2020-07-07 11:36:30,891 INFO L226 Difference]: Without dead ends: 4625 [2020-07-07 11:36:30,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2020-07-07 11:36:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4625 states. [2020-07-07 11:36:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4625 to 4205. [2020-07-07 11:36:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4205 states. [2020-07-07 11:36:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4205 states to 4205 states and 5340 transitions. [2020-07-07 11:36:31,432 INFO L78 Accepts]: Start accepts. Automaton has 4205 states and 5340 transitions. Word has length 191 [2020-07-07 11:36:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:31,433 INFO L479 AbstractCegarLoop]: Abstraction has 4205 states and 5340 transitions. [2020-07-07 11:36:31,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:36:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4205 states and 5340 transitions. [2020-07-07 11:36:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-07-07 11:36:31,441 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:31,442 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:36:31,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 11:36:31,442 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:31,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:31,443 INFO L82 PathProgramCache]: Analyzing trace with hash -635516700, now seen corresponding path program 1 times [2020-07-07 11:36:31,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:31,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568984205] [2020-07-07 11:36:31,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-07-07 11:36:31,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568984205] [2020-07-07 11:36:31,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:31,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:36:31,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181607621] [2020-07-07 11:36:31,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:36:31,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:31,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:36:31,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:31,769 INFO L87 Difference]: Start difference. First operand 4205 states and 5340 transitions. Second operand 10 states. [2020-07-07 11:36:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:33,301 INFO L93 Difference]: Finished difference Result 8766 states and 11212 transitions. [2020-07-07 11:36:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:36:33,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 249 [2020-07-07 11:36:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:33,329 INFO L225 Difference]: With dead ends: 8766 [2020-07-07 11:36:33,329 INFO L226 Difference]: Without dead ends: 4582 [2020-07-07 11:36:33,342 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-07-07 11:36:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4582 states. [2020-07-07 11:36:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4582 to 4198. [2020-07-07 11:36:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4198 states. [2020-07-07 11:36:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 5326 transitions. [2020-07-07 11:36:33,814 INFO L78 Accepts]: Start accepts. Automaton has 4198 states and 5326 transitions. Word has length 249 [2020-07-07 11:36:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:33,814 INFO L479 AbstractCegarLoop]: Abstraction has 4198 states and 5326 transitions. [2020-07-07 11:36:33,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:36:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 4198 states and 5326 transitions. [2020-07-07 11:36:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-07-07 11:36:33,821 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:33,821 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, 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] [2020-07-07 11:36:33,821 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 11:36:33,822 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:33,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:33,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2111585836, now seen corresponding path program 1 times [2020-07-07 11:36:33,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:33,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694918434] [2020-07-07 11:36:33,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-07-07 11:36:34,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694918434] [2020-07-07 11:36:34,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567299501] [2020-07-07 11:36:34,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:34,464 INFO L264 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-07 11:36:34,510 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:36:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-07 11:36:34,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:36:34,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2020-07-07 11:36:34,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189147274] [2020-07-07 11:36:34,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:36:34,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:36:34,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:36:34,629 INFO L87 Difference]: Start difference. First operand 4198 states and 5326 transitions. Second operand 3 states. [2020-07-07 11:36:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:35,615 INFO L93 Difference]: Finished difference Result 11573 states and 15836 transitions. [2020-07-07 11:36:35,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:36:35,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2020-07-07 11:36:35,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:35,656 INFO L225 Difference]: With dead ends: 11573 [2020-07-07 11:36:35,657 INFO L226 Difference]: Without dead ends: 7397 [2020-07-07 11:36:35,678 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:36:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7397 states. [2020-07-07 11:36:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7397 to 7377. [2020-07-07 11:36:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7377 states. [2020-07-07 11:36:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7377 states to 7377 states and 9620 transitions. [2020-07-07 11:36:36,505 INFO L78 Accepts]: Start accepts. Automaton has 7377 states and 9620 transitions. Word has length 192 [2020-07-07 11:36:36,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:36,505 INFO L479 AbstractCegarLoop]: Abstraction has 7377 states and 9620 transitions. [2020-07-07 11:36:36,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:36:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 7377 states and 9620 transitions. [2020-07-07 11:36:36,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-07-07 11:36:36,515 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:36,516 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, 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] [2020-07-07 11:36:36,728 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-07 11:36:36,729 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:36,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:36,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1391086419, now seen corresponding path program 1 times [2020-07-07 11:36:36,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:36,730 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817280902] [2020-07-07 11:36:36,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-07-07 11:36:36,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817280902] [2020-07-07 11:36:36,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761567954] [2020-07-07 11:36:36,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:37,184 INFO L264 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-07 11:36:37,202 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:36:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2020-07-07 11:36:37,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:36:37,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-07-07 11:36:37,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718321689] [2020-07-07 11:36:37,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:36:37,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:37,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:36:37,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:36:37,325 INFO L87 Difference]: Start difference. First operand 7377 states and 9620 transitions. Second operand 3 states. [2020-07-07 11:36:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:38,744 INFO L93 Difference]: Finished difference Result 11477 states and 14788 transitions. [2020-07-07 11:36:38,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:36:38,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2020-07-07 11:36:38,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:38,780 INFO L225 Difference]: With dead ends: 11477 [2020-07-07 11:36:38,780 INFO L226 Difference]: Without dead ends: 7380 [2020-07-07 11:36:38,798 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:36:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7380 states. [2020-07-07 11:36:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7380 to 7376. [2020-07-07 11:36:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7376 states. [2020-07-07 11:36:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7376 states to 7376 states and 9240 transitions. [2020-07-07 11:36:40,261 INFO L78 Accepts]: Start accepts. Automaton has 7376 states and 9240 transitions. Word has length 194 [2020-07-07 11:36:40,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:40,262 INFO L479 AbstractCegarLoop]: Abstraction has 7376 states and 9240 transitions. [2020-07-07 11:36:40,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:36:40,262 INFO L276 IsEmpty]: Start isEmpty. Operand 7376 states and 9240 transitions. [2020-07-07 11:36:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2020-07-07 11:36:40,280 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:40,281 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:36:40,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-07 11:36:40,496 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:40,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:40,496 INFO L82 PathProgramCache]: Analyzing trace with hash -204454725, now seen corresponding path program 1 times [2020-07-07 11:36:40,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:40,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779648985] [2020-07-07 11:36:40,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2020-07-07 11:36:40,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779648985] [2020-07-07 11:36:40,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204840782] [2020-07-07 11:36:40,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:41,059 INFO L264 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-07 11:36:41,077 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:36:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2020-07-07 11:36:41,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:36:41,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-07 11:36:41,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703510451] [2020-07-07 11:36:41,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:36:41,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:41,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:36:41,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:41,191 INFO L87 Difference]: Start difference. First operand 7376 states and 9240 transitions. Second operand 3 states. [2020-07-07 11:36:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:41,965 INFO L93 Difference]: Finished difference Result 15122 states and 19239 transitions. [2020-07-07 11:36:41,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:36:41,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2020-07-07 11:36:41,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:42,007 INFO L225 Difference]: With dead ends: 15122 [2020-07-07 11:36:42,007 INFO L226 Difference]: Without dead ends: 7768 [2020-07-07 11:36:42,038 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:42,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7768 states. [2020-07-07 11:36:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7768 to 7344. [2020-07-07 11:36:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7344 states. [2020-07-07 11:36:42,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7344 states to 7344 states and 9124 transitions. [2020-07-07 11:36:42,891 INFO L78 Accepts]: Start accepts. Automaton has 7344 states and 9124 transitions. Word has length 305 [2020-07-07 11:36:42,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:42,891 INFO L479 AbstractCegarLoop]: Abstraction has 7344 states and 9124 transitions. [2020-07-07 11:36:42,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:36:42,892 INFO L276 IsEmpty]: Start isEmpty. Operand 7344 states and 9124 transitions. [2020-07-07 11:36:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-07-07 11:36:42,901 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:42,902 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 11:36:43,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-07 11:36:43,115 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:43,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:43,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1451826661, now seen corresponding path program 1 times [2020-07-07 11:36:43,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:43,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162356618] [2020-07-07 11:36:43,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-07-07 11:36:43,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162356618] [2020-07-07 11:36:43,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029709738] [2020-07-07 11:36:43,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:43,639 INFO L264 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-07 11:36:43,644 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:36:43,699 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-07 11:36:43,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:36:43,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2020-07-07 11:36:43,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145815101] [2020-07-07 11:36:43,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:36:43,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:43,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:36:43,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-07-07 11:36:43,702 INFO L87 Difference]: Start difference. First operand 7344 states and 9124 transitions. Second operand 3 states. [2020-07-07 11:36:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:45,121 INFO L93 Difference]: Finished difference Result 20797 states and 27002 transitions. [2020-07-07 11:36:45,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:36:45,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-07-07 11:36:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:45,189 INFO L225 Difference]: With dead ends: 20797 [2020-07-07 11:36:45,189 INFO L226 Difference]: Without dead ends: 13475 [2020-07-07 11:36:45,217 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-07-07 11:36:45,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13475 states. [2020-07-07 11:36:46,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13475 to 13471. [2020-07-07 11:36:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13471 states. [2020-07-07 11:36:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13471 states to 13471 states and 17180 transitions. [2020-07-07 11:36:46,847 INFO L78 Accepts]: Start accepts. Automaton has 13471 states and 17180 transitions. Word has length 212 [2020-07-07 11:36:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:46,851 INFO L479 AbstractCegarLoop]: Abstraction has 13471 states and 17180 transitions. [2020-07-07 11:36:46,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:36:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 13471 states and 17180 transitions. [2020-07-07 11:36:46,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2020-07-07 11:36:46,871 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:46,871 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:36:47,084 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:47,085 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:47,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:47,085 INFO L82 PathProgramCache]: Analyzing trace with hash 240464675, now seen corresponding path program 1 times [2020-07-07 11:36:47,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:47,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201104927] [2020-07-07 11:36:47,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 35 proven. 12 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2020-07-07 11:36:47,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201104927] [2020-07-07 11:36:47,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313786676] [2020-07-07 11:36:47,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:47,675 INFO L264 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-07 11:36:47,682 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:36:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2020-07-07 11:36:47,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:36:47,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 13 [2020-07-07 11:36:47,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87089701] [2020-07-07 11:36:47,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 11:36:47,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:47,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 11:36:47,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:36:47,758 INFO L87 Difference]: Start difference. First operand 13471 states and 17180 transitions. Second operand 6 states. [2020-07-07 11:36:48,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:48,696 INFO L93 Difference]: Finished difference Result 26721 states and 35076 transitions. [2020-07-07 11:36:48,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 11:36:48,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 306 [2020-07-07 11:36:48,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:48,751 INFO L225 Difference]: With dead ends: 26721 [2020-07-07 11:36:48,751 INFO L226 Difference]: Without dead ends: 13277 [2020-07-07 11:36:48,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2020-07-07 11:36:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2020-07-07 11:36:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 12125. [2020-07-07 11:36:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12125 states. [2020-07-07 11:36:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12125 states to 12125 states and 15011 transitions. [2020-07-07 11:36:50,542 INFO L78 Accepts]: Start accepts. Automaton has 12125 states and 15011 transitions. Word has length 306 [2020-07-07 11:36:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:50,543 INFO L479 AbstractCegarLoop]: Abstraction has 12125 states and 15011 transitions. [2020-07-07 11:36:50,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 11:36:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 12125 states and 15011 transitions. [2020-07-07 11:36:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-07 11:36:50,554 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:50,554 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 11:36:50,769 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-07 11:36:50,770 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:50,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:50,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1911575971, now seen corresponding path program 1 times [2020-07-07 11:36:50,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:50,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577842499] [2020-07-07 11:36:50,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2020-07-07 11:36:51,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577842499] [2020-07-07 11:36:51,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:51,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:36:51,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119641189] [2020-07-07 11:36:51,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:36:51,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:51,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:36:51,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:51,009 INFO L87 Difference]: Start difference. First operand 12125 states and 15011 transitions. Second operand 10 states. [2020-07-07 11:36:52,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:52,749 INFO L93 Difference]: Finished difference Result 22385 states and 27895 transitions. [2020-07-07 11:36:52,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:36:52,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2020-07-07 11:36:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:52,786 INFO L225 Difference]: With dead ends: 22385 [2020-07-07 11:36:52,786 INFO L226 Difference]: Without dead ends: 10309 [2020-07-07 11:36:52,808 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-07-07 11:36:52,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10309 states. [2020-07-07 11:36:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10309 to 9576. [2020-07-07 11:36:53,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9576 states. [2020-07-07 11:36:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9576 states to 9576 states and 11802 transitions. [2020-07-07 11:36:54,035 INFO L78 Accepts]: Start accepts. Automaton has 9576 states and 11802 transitions. Word has length 213 [2020-07-07 11:36:54,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:54,035 INFO L479 AbstractCegarLoop]: Abstraction has 9576 states and 11802 transitions. [2020-07-07 11:36:54,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:36:54,036 INFO L276 IsEmpty]: Start isEmpty. Operand 9576 states and 11802 transitions. [2020-07-07 11:36:54,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-07 11:36:54,044 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:54,044 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 11:36:54,044 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-07 11:36:54,044 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:54,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:54,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1721244321, now seen corresponding path program 1 times [2020-07-07 11:36:54,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:54,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306736819] [2020-07-07 11:36:54,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,466 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-07-07 11:36:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2020-07-07 11:36:54,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306736819] [2020-07-07 11:36:54,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350429944] [2020-07-07 11:36:54,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:36:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:54,788 INFO L264 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-07 11:36:54,794 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:36:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-07-07 11:36:54,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:36:54,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-07 11:36:54,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364993160] [2020-07-07 11:36:54,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:36:54,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:54,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:36:54,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:54,830 INFO L87 Difference]: Start difference. First operand 9576 states and 11802 transitions. Second operand 3 states. [2020-07-07 11:36:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:36:55,923 INFO L93 Difference]: Finished difference Result 26950 states and 33850 transitions. [2020-07-07 11:36:55,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:36:55,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2020-07-07 11:36:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:36:55,981 INFO L225 Difference]: With dead ends: 26950 [2020-07-07 11:36:55,981 INFO L226 Difference]: Without dead ends: 17424 [2020-07-07 11:36:56,011 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:36:56,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17424 states. [2020-07-07 11:36:57,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17424 to 17420. [2020-07-07 11:36:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17420 states. [2020-07-07 11:36:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17420 states to 17420 states and 21298 transitions. [2020-07-07 11:36:57,575 INFO L78 Accepts]: Start accepts. Automaton has 17420 states and 21298 transitions. Word has length 213 [2020-07-07 11:36:57,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:36:57,575 INFO L479 AbstractCegarLoop]: Abstraction has 17420 states and 21298 transitions. [2020-07-07 11:36:57,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:36:57,576 INFO L276 IsEmpty]: Start isEmpty. Operand 17420 states and 21298 transitions. [2020-07-07 11:36:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-07 11:36:57,586 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:36:57,587 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 11:36:57,801 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-07 11:36:57,802 INFO L427 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:36:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:36:57,802 INFO L82 PathProgramCache]: Analyzing trace with hash 352584377, now seen corresponding path program 1 times [2020-07-07 11:36:57,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:36:57,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913673374] [2020-07-07 11:36:57,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:36:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:36:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-07-07 11:36:58,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913673374] [2020-07-07 11:36:58,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:36:58,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 11:36:58,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750012876] [2020-07-07 11:36:58,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 11:36:58,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:36:58,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 11:36:58,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-07-07 11:36:58,089 INFO L87 Difference]: Start difference. First operand 17420 states and 21298 transitions. Second operand 12 states. [2020-07-07 11:37:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:00,640 INFO L93 Difference]: Finished difference Result 28311 states and 35002 transitions. [2020-07-07 11:37:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 11:37:00,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 213 [2020-07-07 11:37:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:00,658 INFO L225 Difference]: With dead ends: 28311 [2020-07-07 11:37:00,658 INFO L226 Difference]: Without dead ends: 6771 [2020-07-07 11:37:00,687 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2020-07-07 11:37:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6771 states. [2020-07-07 11:37:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6771 to 6592. [2020-07-07 11:37:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6592 states. [2020-07-07 11:37:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6592 states to 6592 states and 7582 transitions. [2020-07-07 11:37:01,196 INFO L78 Accepts]: Start accepts. Automaton has 6592 states and 7582 transitions. Word has length 213 [2020-07-07 11:37:01,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:01,197 INFO L479 AbstractCegarLoop]: Abstraction has 6592 states and 7582 transitions. [2020-07-07 11:37:01,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 11:37:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 6592 states and 7582 transitions. [2020-07-07 11:37:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-07 11:37:01,205 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:01,205 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 11:37:01,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-07 11:37:01,205 INFO L427 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:01,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:01,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1892464406, now seen corresponding path program 1 times [2020-07-07 11:37:01,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:01,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994193837] [2020-07-07 11:37:01,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,879 WARN L193 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-07-07 11:37:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-07-07 11:37:02,049 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994193837] [2020-07-07 11:37:02,049 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840337869] [2020-07-07 11:37:02,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:37:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:02,208 INFO L264 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-07 11:37:02,214 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:37:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-07-07 11:37:02,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:37:02,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2020-07-07 11:37:02,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711814295] [2020-07-07 11:37:02,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-07 11:37:02,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:02,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-07 11:37:02,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:37:02,318 INFO L87 Difference]: Start difference. First operand 6592 states and 7582 transitions. Second operand 4 states. [2020-07-07 11:37:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:03,033 INFO L93 Difference]: Finished difference Result 9885 states and 11395 transitions. [2020-07-07 11:37:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:37:03,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2020-07-07 11:37:03,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:03,043 INFO L225 Difference]: With dead ends: 9885 [2020-07-07 11:37:03,044 INFO L226 Difference]: Without dead ends: 4730 [2020-07-07 11:37:03,050 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-07-07 11:37:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2020-07-07 11:37:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 4643. [2020-07-07 11:37:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4643 states. [2020-07-07 11:37:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4643 states to 4643 states and 5240 transitions. [2020-07-07 11:37:03,380 INFO L78 Accepts]: Start accepts. Automaton has 4643 states and 5240 transitions. Word has length 213 [2020-07-07 11:37:03,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:03,381 INFO L479 AbstractCegarLoop]: Abstraction has 4643 states and 5240 transitions. [2020-07-07 11:37:03,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-07 11:37:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4643 states and 5240 transitions. [2020-07-07 11:37:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-07 11:37:03,385 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:03,385 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 11:37:03,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:37:03,599 INFO L427 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:03,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:03,600 INFO L82 PathProgramCache]: Analyzing trace with hash 407200168, now seen corresponding path program 1 times [2020-07-07 11:37:03,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:03,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448423486] [2020-07-07 11:37:03,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-07-07 11:37:03,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448423486] [2020-07-07 11:37:03,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:37:03,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 11:37:03,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224654993] [2020-07-07 11:37:03,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:37:03,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:03,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:37:03,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:37:03,821 INFO L87 Difference]: Start difference. First operand 4643 states and 5240 transitions. Second operand 10 states. [2020-07-07 11:37:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:05,179 INFO L93 Difference]: Finished difference Result 4800 states and 5433 transitions. [2020-07-07 11:37:05,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:37:05,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2020-07-07 11:37:05,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:05,191 INFO L225 Difference]: With dead ends: 4800 [2020-07-07 11:37:05,191 INFO L226 Difference]: Without dead ends: 3433 [2020-07-07 11:37:05,193 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-07-07 11:37:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2020-07-07 11:37:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3280. [2020-07-07 11:37:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3280 states. [2020-07-07 11:37:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 3723 transitions. [2020-07-07 11:37:05,432 INFO L78 Accepts]: Start accepts. Automaton has 3280 states and 3723 transitions. Word has length 213 [2020-07-07 11:37:05,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:05,433 INFO L479 AbstractCegarLoop]: Abstraction has 3280 states and 3723 transitions. [2020-07-07 11:37:05,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:37:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 3723 transitions. [2020-07-07 11:37:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-07-07 11:37:05,435 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:05,435 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 11:37:05,435 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-07 11:37:05,435 INFO L427 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:05,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:05,435 INFO L82 PathProgramCache]: Analyzing trace with hash 592829452, now seen corresponding path program 1 times [2020-07-07 11:37:05,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:05,436 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851549163] [2020-07-07 11:37:05,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-07-07 11:37:05,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851549163] [2020-07-07 11:37:05,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068455624] [2020-07-07 11:37:05,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:37:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:05,861 INFO L264 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-07 11:37:05,873 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:37:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-07-07 11:37:05,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:37:05,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 12 [2020-07-07 11:37:05,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033965164] [2020-07-07 11:37:05,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 11:37:05,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:05,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 11:37:05,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-07-07 11:37:05,926 INFO L87 Difference]: Start difference. First operand 3280 states and 3723 transitions. Second operand 6 states. [2020-07-07 11:37:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:06,139 INFO L93 Difference]: Finished difference Result 5120 states and 5853 transitions. [2020-07-07 11:37:06,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 11:37:06,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2020-07-07 11:37:06,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:06,143 INFO L225 Difference]: With dead ends: 5120 [2020-07-07 11:37:06,144 INFO L226 Difference]: Without dead ends: 926 [2020-07-07 11:37:06,148 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 262 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:37:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2020-07-07 11:37:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 916. [2020-07-07 11:37:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2020-07-07 11:37:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 992 transitions. [2020-07-07 11:37:06,233 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 992 transitions. Word has length 215 [2020-07-07 11:37:06,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:06,234 INFO L479 AbstractCegarLoop]: Abstraction has 916 states and 992 transitions. [2020-07-07 11:37:06,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 11:37:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 992 transitions. [2020-07-07 11:37:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2020-07-07 11:37:06,236 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:06,236 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:37:06,450 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-07-07 11:37:06,451 INFO L427 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:06,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:06,451 INFO L82 PathProgramCache]: Analyzing trace with hash -373872983, now seen corresponding path program 1 times [2020-07-07 11:37:06,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:06,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088807233] [2020-07-07 11:37:06,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-07-07 11:37:06,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088807233] [2020-07-07 11:37:06,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102496396] [2020-07-07 11:37:06,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:37:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:07,047 INFO L264 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-07 11:37:07,052 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:37:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 70 proven. 66 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2020-07-07 11:37:07,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:37:07,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 14 [2020-07-07 11:37:07,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291901958] [2020-07-07 11:37:07,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 11:37:07,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:07,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 11:37:07,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:37:07,150 INFO L87 Difference]: Start difference. First operand 916 states and 992 transitions. Second operand 14 states. [2020-07-07 11:37:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:09,499 INFO L93 Difference]: Finished difference Result 952 states and 1040 transitions. [2020-07-07 11:37:09,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-07 11:37:09,500 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 267 [2020-07-07 11:37:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:09,502 INFO L225 Difference]: With dead ends: 952 [2020-07-07 11:37:09,503 INFO L226 Difference]: Without dead ends: 949 [2020-07-07 11:37:09,503 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 335 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2020-07-07 11:37:09,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2020-07-07 11:37:09,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 915. [2020-07-07 11:37:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2020-07-07 11:37:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 989 transitions. [2020-07-07 11:37:09,594 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 989 transitions. Word has length 267 [2020-07-07 11:37:09,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:09,594 INFO L479 AbstractCegarLoop]: Abstraction has 915 states and 989 transitions. [2020-07-07 11:37:09,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 11:37:09,594 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 989 transitions. [2020-07-07 11:37:09,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2020-07-07 11:37:09,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:09,596 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:37:09,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:37:09,797 INFO L427 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:09,798 INFO L82 PathProgramCache]: Analyzing trace with hash -271251823, now seen corresponding path program 1 times [2020-07-07 11:37:09,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:09,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651512096] [2020-07-07 11:37:09,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2020-07-07 11:37:10,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651512096] [2020-07-07 11:37:10,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020627615] [2020-07-07 11:37:10,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:37:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:37:10,256 INFO L264 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-07 11:37:10,261 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:37:10,297 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-07-07 11:37:10,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:37:10,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-07 11:37:10,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868947629] [2020-07-07 11:37:10,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:37:10,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:37:10,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:37:10,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:37:10,299 INFO L87 Difference]: Start difference. First operand 915 states and 989 transitions. Second operand 3 states. [2020-07-07 11:37:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:37:10,390 INFO L93 Difference]: Finished difference Result 1617 states and 1757 transitions. [2020-07-07 11:37:10,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:37:10,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2020-07-07 11:37:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:37:10,392 INFO L225 Difference]: With dead ends: 1617 [2020-07-07 11:37:10,392 INFO L226 Difference]: Without dead ends: 929 [2020-07-07 11:37:10,393 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:37:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2020-07-07 11:37:10,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 923. [2020-07-07 11:37:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2020-07-07 11:37:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 999 transitions. [2020-07-07 11:37:10,450 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 999 transitions. Word has length 271 [2020-07-07 11:37:10,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:37:10,451 INFO L479 AbstractCegarLoop]: Abstraction has 923 states and 999 transitions. [2020-07-07 11:37:10,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:37:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 999 transitions. [2020-07-07 11:37:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-07-07 11:37:10,453 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:37:10,453 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:37:10,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:37:10,667 INFO L427 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:37:10,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:37:10,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1410375831, now seen corresponding path program 1 times [2020-07-07 11:37:10,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:37:10,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784898806] [2020-07-07 11:37:10,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:37:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:37:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:37:10,823 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-07 11:37:10,823 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 11:37:10,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-07 11:37:11,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 11:37:11 BoogieIcfgContainer [2020-07-07 11:37:11,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 11:37:11,039 INFO L168 Benchmark]: Toolchain (without parser) took 66119.67 ms. Allocated memory was 137.9 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 102.5 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 655.4 MB. Max. memory is 7.1 GB. [2020-07-07 11:37:11,040 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-07 11:37:11,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.23 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 178.3 MB in the end (delta: -76.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2020-07-07 11:37:11,043 INFO L168 Benchmark]: Boogie Preprocessor took 49.06 ms. Allocated memory is still 201.9 MB. Free memory was 178.3 MB in the beginning and 176.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-07-07 11:37:11,044 INFO L168 Benchmark]: RCFGBuilder took 641.08 ms. Allocated memory is still 201.9 MB. Free memory was 176.2 MB in the beginning and 136.5 MB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 7.1 GB. [2020-07-07 11:37:11,046 INFO L168 Benchmark]: TraceAbstraction took 64901.66 ms. Allocated memory was 201.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 136.5 MB in the beginning and 1.1 GB in the end (delta: -981.5 MB). Peak memory consumption was 625.4 MB. Max. memory is 7.1 GB. [2020-07-07 11:37:11,047 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.47 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 523.23 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 178.3 MB in the end (delta: -76.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.06 ms. Allocated memory is still 201.9 MB. Free memory was 178.3 MB in the beginning and 176.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 641.08 ms. Allocated memory is still 201.9 MB. Free memory was 176.2 MB in the beginning and 136.5 MB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 64901.66 ms. Allocated memory was 201.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 136.5 MB in the beginning and 1.1 GB in the end (delta: -981.5 MB). Peak memory consumption was 625.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int t2_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int t2_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int T2_E = 2; [L26] int E_M = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; [L33] int token ; [L35] int local ; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=17, \old(m_i)=10, \old(m_pc)=14, \old(m_st)=15, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=11, \old(t1_st)=7, \old(T2_E)=18, \old(t2_i)=9, \old(t2_pc)=12, \old(t2_st)=13, \old(token)=22, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L600] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L604] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L514] m_i = 1 [L515] t1_i = 1 [L516] t2_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L604] RET init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L605] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L541] int kernel_st ; [L542] int tmp ; [L543] int tmp___0 ; [L547] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=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, token=0] [L548] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=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, token=0] [L549] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L233] COND TRUE m_i == 1 [L234] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L238] COND TRUE t1_i == 1 [L239] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L243] COND TRUE t2_i == 1 [L244] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L549] RET init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=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, token=0] [L550] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L346] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L351] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L356] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L361] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L366] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L371] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L550] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=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, token=0] [L551] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L168] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, is_master_triggered()=0, local=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, token=0] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L187] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit1_triggered()=0, local=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, token=0] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L206] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit2_triggered()=0, local=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, token=0] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L551] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=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, token=0] [L552] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L384] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L389] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L394] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L399] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L404] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L409] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L552] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=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, token=0] [L555] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=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, token=0] [L558] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=1, local=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, token=0] [L559] CALL eval() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L279] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=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, token=0] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=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, token=0] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=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, token=0] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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=1, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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=1, tmp_ndt_1=0, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L313] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L96] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L107] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L109] t1_pc = 1 [L110] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L313] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L327] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L132] COND TRUE t2_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L143] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L145] t2_pc = 1 [L146] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L327] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, 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, token=0] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, 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, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L299] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, token=0] [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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_var=0, token=0] [L51] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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_var=0, token=0] [L54] token = __VERIFIER_nondet_int() [L55] local = token [L56] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-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_var=0, token=-1] [L57] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-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, token=-1] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-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, token=-1] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-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, token=-1] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-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, token=-1] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-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, token=-1] [L168] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-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, token=-1] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-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, token=-1] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-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, token=-1] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, is_master_triggered()=0, local=-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, token=-1] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-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, token=-1] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-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, token=-1] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-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, token=-1] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-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, token=-1] [L188] COND TRUE E_1 == 1 [L189] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=1, E_1=1, E_2=2, E_M=2, local=-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, token=-1] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=1, __retres1=1, E_1=1, E_2=2, E_M=2, local=-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, token=-1] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit1_triggered()=1, local=-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, token=-1] [L433] tmp___0 = is_transmit1_triggered() [L435] COND TRUE \read(tmp___0) [L436] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, 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, token=-1] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, 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, token=-1] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, 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, token=-1] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, 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, token=-1] [L207] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, 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, token=-1] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, 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, token=-1] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, 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, token=-1] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit2_triggered()=0, local=-1, 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, token=-1] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, 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, token=-1] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, 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, token=-1] [L57] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, 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_var=0, token=-1] [L58] E_1 = 2 [L59] m_pc = 1 [L60] m_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, 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_var=0, token=-1] [L299] RET master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, 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, token=-1] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-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=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=-1] [L313] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-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, token=-1] [L96] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-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, token=-1] [L99] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-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, token=-1] [L115] token += 1 [L116] E_2 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L117] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L168] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L169] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, __retres1=0, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_master_triggered()=0, local=-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, token=0] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L188] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, __retres1=0, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_transmit1_triggered()=0, local=-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, token=0] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L207] COND TRUE E_2 == 1 [L208] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, __retres1=1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, \result=1, __retres1=1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_transmit2_triggered()=1, local=-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, token=0] [L441] tmp___1 = is_transmit2_triggered() [L443] COND TRUE \read(tmp___1) [L444] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L117] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-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, token=0] [L118] E_2 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-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, token=0] [L107] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-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, token=0] [L109] t1_pc = 1 [L110] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, 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, token=0] [L313] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, 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, token=0] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, 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, token=0] [L327] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, 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, token=0] [L132] COND FALSE !(t2_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, 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, token=0] [L135] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, 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, token=0] [L151] token += 1 [L152] E_M = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, 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, token=1] [L153] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, 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, token=1] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, 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, token=1] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, 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, token=1] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, 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, token=1] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, 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, token=1] [L168] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, 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, token=1] [L169] COND TRUE E_M == 1 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=1, local=-1, 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, token=1] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=1, local=-1, 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, token=1] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_master_triggered()=1, local=-1, 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, token=1] [L425] tmp = is_master_triggered() [L427] COND TRUE \read(tmp) [L428] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, tmp=1, token=1] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L188] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_transmit1_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, 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, tmp=1, token=1] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, tmp=1, tmp___0=0, token=1] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L207] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_transmit2_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, 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, tmp=1, tmp___0=0, token=1] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, tmp=1, tmp___0=0, tmp___1=0, token=1] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L153] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L154] E_M = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L143] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L145] t2_pc = 1 [L146] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L327] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \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, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L299] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \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, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \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, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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_var=5, token=1] [L43] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \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, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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_var=5, token=1] [L65] COND FALSE !(token != local + 2) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \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, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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_var=5, token=1] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \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, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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_var=5, token=1] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \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, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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_var=5, token=1] [L76] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \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, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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_var=5, token=1] [L77] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \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, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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_var=5, token=1] [L78] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \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, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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_var=5, token=1] [L79] CALL error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \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, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \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, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, 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, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 181 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 64.6s, OverallIterations: 25, TraceHistogramMax: 6, AutomataDifference: 38.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5239 SDtfs, 12397 SDslu, 3816 SDs, 0 SdLazy, 17972 SolverSat, 5325 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3842 GetRequests, 3458 SyntacticMatches, 17 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17420occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 5216 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 7010 NumberOfCodeBlocks, 7010 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 6704 ConstructedInterpolants, 0 QuantifiedInterpolants, 2854313 SizeOfPredicates, 13 NumberOfNonLiveVariables, 10008 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 34 InterpolantComputations, 23 PerfectInterpolantSequences, 4399/4555 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...