/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks NOT_INCREMENTALLY -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-d623d84 [2020-07-20 12:25:56,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 12:25:56,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 12:25:56,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 12:25:56,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 12:25:56,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 12:25:56,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 12:25:56,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 12:25:56,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 12:25:56,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 12:25:56,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 12:25:56,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 12:25:56,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 12:25:56,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 12:25:56,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 12:25:56,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 12:25:56,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 12:25:56,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 12:25:56,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 12:25:56,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 12:25:56,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 12:25:56,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 12:25:56,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 12:25:56,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 12:25:56,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 12:25:56,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 12:25:56,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 12:25:56,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 12:25:56,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 12:25:56,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 12:25:56,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 12:25:56,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 12:25:56,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 12:25:56,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 12:25:56,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 12:25:56,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 12:25:56,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 12:25:56,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 12:25:56,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 12:25:56,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 12:25:56,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 12:25:56,645 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-20 12:25:56,670 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 12:25:56,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 12:25:56,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 12:25:56,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 12:25:56,673 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 12:25:56,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 12:25:56,674 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 12:25:56,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 12:25:56,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 12:25:56,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 12:25:56,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 12:25:56,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 12:25:56,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 12:25:56,676 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 12:25:56,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 12:25:56,676 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 12:25:56,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 12:25:56,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 12:25:56,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 12:25:56,677 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 12:25:56,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 12:25:56,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 12:25:56,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 12:25:56,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 12:25:56,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 12:25:56,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 12:25:56,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:56,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 12:25:56,679 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 12:25:56,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> NOT_INCREMENTALLY [2020-07-20 12:25:56,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 12:25:57,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 12:25:57,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 12:25:57,013 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 12:25:57,014 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 12:25:57,014 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-20 12:25:57,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37b79ed7/4e4291d8055145bfa81ded595dc3717f/FLAG14ce507c4 [2020-07-20 12:25:57,501 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 12:25:57,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-07-20 12:25:57,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37b79ed7/4e4291d8055145bfa81ded595dc3717f/FLAG14ce507c4 [2020-07-20 12:25:57,889 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37b79ed7/4e4291d8055145bfa81ded595dc3717f [2020-07-20 12:25:57,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 12:25:57,899 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 12:25:57,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 12:25:57,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 12:25:57,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 12:25:57,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:25:57" (1/1) ... [2020-07-20 12:25:57,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d61c383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:57, skipping insertion in model container [2020-07-20 12:25:57,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:25:57" (1/1) ... [2020-07-20 12:25:57,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 12:25:57,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 12:25:58,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 12:25:58,244 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 12:25:58,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 12:25:58,402 INFO L208 MainTranslator]: Completed translation [2020-07-20 12:25:58,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:58 WrapperNode [2020-07-20 12:25:58,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 12:25:58,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 12:25:58,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 12:25:58,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 12:25:58,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:58" (1/1) ... [2020-07-20 12:25:58,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:58" (1/1) ... [2020-07-20 12:25:58,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:58" (1/1) ... [2020-07-20 12:25:58,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:58" (1/1) ... [2020-07-20 12:25:58,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:58" (1/1) ... [2020-07-20 12:25:58,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:58" (1/1) ... [2020-07-20 12:25:58,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:58" (1/1) ... [2020-07-20 12:25:58,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 12:25:58,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 12:25:58,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 12:25:58,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 12:25:58,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:58" (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-20 12:25:58,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 12:25:58,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 12:25:58,502 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 12:25:58,502 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-20 12:25:58,502 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-20 12:25:58,502 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-07-20 12:25:58,502 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-20 12:25:58,503 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-20 12:25:58,503 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-07-20 12:25:58,503 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 12:25:58,503 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 12:25:58,503 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 12:25:58,503 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 12:25:58,503 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 12:25:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 12:25:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 12:25:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-20 12:25:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 12:25:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 12:25:58,504 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 12:25:58,505 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 12:25:58,505 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 12:25:58,505 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 12:25:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 12:25:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 12:25:58,505 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-20 12:25:58,506 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-20 12:25:58,506 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-07-20 12:25:58,506 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-20 12:25:58,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 12:25:58,506 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-20 12:25:58,506 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-20 12:25:58,506 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-07-20 12:25:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 12:25:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 12:25:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 12:25:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 12:25:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 12:25:58,507 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 12:25:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 12:25:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 12:25:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 12:25:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 12:25:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 12:25:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 12:25:58,508 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 12:25:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 12:25:58,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 12:25:59,064 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 12:25:59,065 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-20 12:25:59,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:25:59 BoogieIcfgContainer [2020-07-20 12:25:59,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 12:25:59,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 12:25:59,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 12:25:59,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 12:25:59,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 12:25:57" (1/3) ... [2020-07-20 12:25:59,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329b5ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:25:59, skipping insertion in model container [2020-07-20 12:25:59,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:25:58" (2/3) ... [2020-07-20 12:25:59,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329b5ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:25:59, skipping insertion in model container [2020-07-20 12:25:59,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:25:59" (3/3) ... [2020-07-20 12:25:59,079 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-07-20 12:25:59,089 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 12:25:59,096 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 12:25:59,110 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 12:25:59,135 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 12:25:59,136 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 12:25:59,136 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 12:25:59,136 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 12:25:59,136 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 12:25:59,137 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 12:25:59,137 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 12:25:59,137 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 12:25:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2020-07-20 12:25:59,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-20 12:25:59,172 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:59,173 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-20 12:25:59,174 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:59,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:59,180 INFO L82 PathProgramCache]: Analyzing trace with hash -67309704, now seen corresponding path program 1 times [2020-07-20 12:25:59,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:59,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [101581972] [2020-07-20 12:25:59,190 INFO L95 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:25:59,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 12:25:59,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:25:59,487 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-20 12:25:59,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:25:59,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [101581972] [2020-07-20 12:25:59,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:25:59,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:25:59,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221838809] [2020-07-20 12:25:59,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:25:59,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:25:59,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:25:59,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:59,513 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 3 states. [2020-07-20 12:25:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:25:59,629 INFO L93 Difference]: Finished difference Result 483 states and 706 transitions. [2020-07-20 12:25:59,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:25:59,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-07-20 12:25:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:25:59,649 INFO L225 Difference]: With dead ends: 483 [2020-07-20 12:25:59,649 INFO L226 Difference]: Without dead ends: 309 [2020-07-20 12:25:59,655 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:25:59,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-07-20 12:25:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2020-07-20 12:25:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-07-20 12:25:59,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 421 transitions. [2020-07-20 12:25:59,756 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 421 transitions. Word has length 92 [2020-07-20 12:25:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:25:59,757 INFO L479 AbstractCegarLoop]: Abstraction has 308 states and 421 transitions. [2020-07-20 12:25:59,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:25:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 421 transitions. [2020-07-20 12:25:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-07-20 12:25:59,768 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:25:59,769 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-20 12:25:59,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:25:59,972 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:25:59,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:25:59,974 INFO L82 PathProgramCache]: Analyzing trace with hash -76316608, now seen corresponding path program 1 times [2020-07-20 12:25:59,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:25:59,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1091112968] [2020-07-20 12:25:59,976 INFO L95 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:00,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 12:26:00,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-20 12:26:00,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:00,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1091112968] [2020-07-20 12:26:00,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:00,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:00,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807339148] [2020-07-20 12:26:00,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:00,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:00,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:00,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:00,184 INFO L87 Difference]: Start difference. First operand 308 states and 421 transitions. Second operand 3 states. [2020-07-20 12:26:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:00,265 INFO L93 Difference]: Finished difference Result 858 states and 1208 transitions. [2020-07-20 12:26:00,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:00,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2020-07-20 12:26:00,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:00,274 INFO L225 Difference]: With dead ends: 858 [2020-07-20 12:26:00,274 INFO L226 Difference]: Without dead ends: 572 [2020-07-20 12:26:00,277 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-07-20 12:26:00,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2020-07-20 12:26:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2020-07-20 12:26:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 799 transitions. [2020-07-20 12:26:00,357 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 799 transitions. Word has length 147 [2020-07-20 12:26:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:00,358 INFO L479 AbstractCegarLoop]: Abstraction has 572 states and 799 transitions. [2020-07-20 12:26:00,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 799 transitions. [2020-07-20 12:26:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-20 12:26:00,373 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:00,375 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-20 12:26:00,590 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:00,590 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:00,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:00,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1090347337, now seen corresponding path program 1 times [2020-07-20 12:26:00,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:00,593 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [923748176] [2020-07-20 12:26:00,593 INFO L95 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:00,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:00,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-07-20 12:26:00,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:00,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [923748176] [2020-07-20 12:26:00,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:00,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:00,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841437495] [2020-07-20 12:26:00,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:00,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:00,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:00,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:00,846 INFO L87 Difference]: Start difference. First operand 572 states and 799 transitions. Second operand 3 states. [2020-07-20 12:26:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:00,903 INFO L93 Difference]: Finished difference Result 988 states and 1377 transitions. [2020-07-20 12:26:00,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:00,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2020-07-20 12:26:00,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:00,908 INFO L225 Difference]: With dead ends: 988 [2020-07-20 12:26:00,908 INFO L226 Difference]: Without dead ends: 437 [2020-07-20 12:26:00,911 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:00,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-07-20 12:26:00,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2020-07-20 12:26:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-07-20 12:26:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 604 transitions. [2020-07-20 12:26:00,942 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 604 transitions. Word has length 191 [2020-07-20 12:26:00,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:00,943 INFO L479 AbstractCegarLoop]: Abstraction has 437 states and 604 transitions. [2020-07-20 12:26:00,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:00,943 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 604 transitions. [2020-07-20 12:26:00,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-20 12:26:00,947 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:00,947 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-20 12:26:01,162 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:01,163 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:01,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:01,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1777580215, now seen corresponding path program 1 times [2020-07-20 12:26:01,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:01,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2018226253] [2020-07-20 12:26:01,166 INFO L95 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:01,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:01,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-07-20 12:26:01,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:01,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2018226253] [2020-07-20 12:26:01,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:01,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:01,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010356804] [2020-07-20 12:26:01,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:01,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:01,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:01,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:01,394 INFO L87 Difference]: Start difference. First operand 437 states and 604 transitions. Second operand 3 states. [2020-07-20 12:26:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:01,449 INFO L93 Difference]: Finished difference Result 1246 states and 1803 transitions. [2020-07-20 12:26:01,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:01,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2020-07-20 12:26:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:01,457 INFO L225 Difference]: With dead ends: 1246 [2020-07-20 12:26:01,457 INFO L226 Difference]: Without dead ends: 831 [2020-07-20 12:26:01,459 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2020-07-20 12:26:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 818. [2020-07-20 12:26:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2020-07-20 12:26:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1183 transitions. [2020-07-20 12:26:01,516 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1183 transitions. Word has length 191 [2020-07-20 12:26:01,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:01,519 INFO L479 AbstractCegarLoop]: Abstraction has 818 states and 1183 transitions. [2020-07-20 12:26:01,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:01,520 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1183 transitions. [2020-07-20 12:26:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-20 12:26:01,527 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:01,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:26:01,741 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:01,742 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:01,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:01,743 INFO L82 PathProgramCache]: Analyzing trace with hash 88465863, now seen corresponding path program 1 times [2020-07-20 12:26:01,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:01,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [543986026] [2020-07-20 12:26:01,743 INFO L95 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:01,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:01,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-07-20 12:26:01,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:01,926 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [543986026] [2020-07-20 12:26:01,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:01,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:01,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189237779] [2020-07-20 12:26:01,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:01,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:01,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:01,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:01,928 INFO L87 Difference]: Start difference. First operand 818 states and 1183 transitions. Second operand 3 states. [2020-07-20 12:26:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:01,986 INFO L93 Difference]: Finished difference Result 1609 states and 2329 transitions. [2020-07-20 12:26:01,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:01,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2020-07-20 12:26:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:01,993 INFO L225 Difference]: With dead ends: 1609 [2020-07-20 12:26:01,993 INFO L226 Difference]: Without dead ends: 812 [2020-07-20 12:26:01,996 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-07-20 12:26:02,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2020-07-20 12:26:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-07-20 12:26:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1171 transitions. [2020-07-20 12:26:02,085 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1171 transitions. Word has length 191 [2020-07-20 12:26:02,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:02,085 INFO L479 AbstractCegarLoop]: Abstraction has 812 states and 1171 transitions. [2020-07-20 12:26:02,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:02,086 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1171 transitions. [2020-07-20 12:26:02,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-07-20 12:26:02,094 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:02,095 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:26:02,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:02,309 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:02,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:02,309 INFO L82 PathProgramCache]: Analyzing trace with hash 65874096, now seen corresponding path program 1 times [2020-07-20 12:26:02,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:02,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [851150834] [2020-07-20 12:26:02,310 INFO L95 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:02,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:02,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:02,490 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-20 12:26:02,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:02,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [851150834] [2020-07-20 12:26:02,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:02,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:02,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617327185] [2020-07-20 12:26:02,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:02,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:02,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:02,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:02,492 INFO L87 Difference]: Start difference. First operand 812 states and 1171 transitions. Second operand 3 states. [2020-07-20 12:26:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:02,563 INFO L93 Difference]: Finished difference Result 1997 states and 3037 transitions. [2020-07-20 12:26:02,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:02,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2020-07-20 12:26:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:02,572 INFO L225 Difference]: With dead ends: 1997 [2020-07-20 12:26:02,573 INFO L226 Difference]: Without dead ends: 1207 [2020-07-20 12:26:02,577 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:02,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2020-07-20 12:26:02,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1197. [2020-07-20 12:26:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2020-07-20 12:26:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1736 transitions. [2020-07-20 12:26:02,641 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1736 transitions. Word has length 198 [2020-07-20 12:26:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:02,642 INFO L479 AbstractCegarLoop]: Abstraction has 1197 states and 1736 transitions. [2020-07-20 12:26:02,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1736 transitions. [2020-07-20 12:26:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-07-20 12:26:02,647 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:02,648 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:26:02,861 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:02,862 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:02,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:02,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1832656209, now seen corresponding path program 1 times [2020-07-20 12:26:02,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:02,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [271990367] [2020-07-20 12:26:02,863 INFO L95 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:03,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 12:26:03,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-20 12:26:03,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:03,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [271990367] [2020-07-20 12:26:03,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:03,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:03,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376544992] [2020-07-20 12:26:03,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:03,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:03,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:03,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:03,190 INFO L87 Difference]: Start difference. First operand 1197 states and 1736 transitions. Second operand 3 states. [2020-07-20 12:26:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:03,292 INFO L93 Difference]: Finished difference Result 2585 states and 3880 transitions. [2020-07-20 12:26:03,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:03,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2020-07-20 12:26:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:03,305 INFO L225 Difference]: With dead ends: 2585 [2020-07-20 12:26:03,305 INFO L226 Difference]: Without dead ends: 1408 [2020-07-20 12:26:03,315 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-07-20 12:26:03,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1408. [2020-07-20 12:26:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1408 states. [2020-07-20 12:26:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1956 transitions. [2020-07-20 12:26:03,402 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1956 transitions. Word has length 198 [2020-07-20 12:26:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:03,402 INFO L479 AbstractCegarLoop]: Abstraction has 1408 states and 1956 transitions. [2020-07-20 12:26:03,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1956 transitions. [2020-07-20 12:26:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2020-07-20 12:26:03,409 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:03,410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:26:03,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:03,624 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:03,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:03,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1852007665, now seen corresponding path program 1 times [2020-07-20 12:26:03,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:03,625 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [302815765] [2020-07-20 12:26:03,625 INFO L95 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:03,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 12:26:03,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-20 12:26:03,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:03,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [302815765] [2020-07-20 12:26:03,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:03,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:03,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034208357] [2020-07-20 12:26:03,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:03,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:03,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:03,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:03,822 INFO L87 Difference]: Start difference. First operand 1408 states and 1956 transitions. Second operand 3 states. [2020-07-20 12:26:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:03,940 INFO L93 Difference]: Finished difference Result 2945 states and 4288 transitions. [2020-07-20 12:26:03,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:03,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2020-07-20 12:26:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:03,951 INFO L225 Difference]: With dead ends: 2945 [2020-07-20 12:26:03,951 INFO L226 Difference]: Without dead ends: 1557 [2020-07-20 12:26:03,959 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:03,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2020-07-20 12:26:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1515. [2020-07-20 12:26:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2020-07-20 12:26:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2034 transitions. [2020-07-20 12:26:04,045 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2034 transitions. Word has length 250 [2020-07-20 12:26:04,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:04,046 INFO L479 AbstractCegarLoop]: Abstraction has 1515 states and 2034 transitions. [2020-07-20 12:26:04,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2034 transitions. [2020-07-20 12:26:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-07-20 12:26:04,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:04,053 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, 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] [2020-07-20 12:26:04,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:04,266 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:04,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:04,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1964324510, now seen corresponding path program 1 times [2020-07-20 12:26:04,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:04,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [534477198] [2020-07-20 12:26:04,268 INFO L95 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:04,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:04,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-20 12:26:04,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:04,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [534477198] [2020-07-20 12:26:04,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:04,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:04,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046794911] [2020-07-20 12:26:04,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:04,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:04,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:04,512 INFO L87 Difference]: Start difference. First operand 1515 states and 2034 transitions. Second operand 3 states. [2020-07-20 12:26:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:04,683 INFO L93 Difference]: Finished difference Result 4438 states and 6397 transitions. [2020-07-20 12:26:04,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:04,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2020-07-20 12:26:04,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:04,702 INFO L225 Difference]: With dead ends: 4438 [2020-07-20 12:26:04,702 INFO L226 Difference]: Without dead ends: 2944 [2020-07-20 12:26:04,712 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-07-20 12:26:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2895. [2020-07-20 12:26:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2895 states. [2020-07-20 12:26:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4080 transitions. [2020-07-20 12:26:04,949 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4080 transitions. Word has length 192 [2020-07-20 12:26:04,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:04,949 INFO L479 AbstractCegarLoop]: Abstraction has 2895 states and 4080 transitions. [2020-07-20 12:26:04,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:04,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4080 transitions. [2020-07-20 12:26:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-07-20 12:26:04,958 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:04,958 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] [2020-07-20 12:26:05,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:05,172 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:05,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:05,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1294115091, now seen corresponding path program 1 times [2020-07-20 12:26:05,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:05,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [74060386] [2020-07-20 12:26:05,174 INFO L95 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 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:05,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 12:26:05,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-07-20 12:26:05,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:05,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [74060386] [2020-07-20 12:26:05,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:05,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:05,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444474432] [2020-07-20 12:26:05,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:05,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:05,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:05,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:05,370 INFO L87 Difference]: Start difference. First operand 2895 states and 4080 transitions. Second operand 3 states. [2020-07-20 12:26:05,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:05,509 INFO L93 Difference]: Finished difference Result 4912 states and 6912 transitions. [2020-07-20 12:26:05,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:05,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2020-07-20 12:26:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:05,531 INFO L225 Difference]: With dead ends: 4912 [2020-07-20 12:26:05,531 INFO L226 Difference]: Without dead ends: 2910 [2020-07-20 12:26:05,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:05,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-07-20 12:26:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2894. [2020-07-20 12:26:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2894 states. [2020-07-20 12:26:05,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 3987 transitions. [2020-07-20 12:26:05,696 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 3987 transitions. Word has length 193 [2020-07-20 12:26:05,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:05,696 INFO L479 AbstractCegarLoop]: Abstraction has 2894 states and 3987 transitions. [2020-07-20 12:26:05,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:05,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 3987 transitions. [2020-07-20 12:26:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2020-07-20 12:26:05,709 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:05,709 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:26:05,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:05,925 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:05,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:05,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2041050493, now seen corresponding path program 1 times [2020-07-20 12:26:05,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:05,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [452767137] [2020-07-20 12:26:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:06,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 1269 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:06,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2020-07-20 12:26:06,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:06,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [452767137] [2020-07-20 12:26:06,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:06,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:06,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103187921] [2020-07-20 12:26:06,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:06,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:06,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:06,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:06,221 INFO L87 Difference]: Start difference. First operand 2894 states and 3987 transitions. Second operand 3 states. [2020-07-20 12:26:06,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:06,408 INFO L93 Difference]: Finished difference Result 6034 states and 8513 transitions. [2020-07-20 12:26:06,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:06,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2020-07-20 12:26:06,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:06,429 INFO L225 Difference]: With dead ends: 6034 [2020-07-20 12:26:06,429 INFO L226 Difference]: Without dead ends: 3162 [2020-07-20 12:26:06,451 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:06,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2020-07-20 12:26:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 2878. [2020-07-20 12:26:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2878 states. [2020-07-20 12:26:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 3923 transitions. [2020-07-20 12:26:06,613 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 3923 transitions. Word has length 311 [2020-07-20 12:26:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:06,614 INFO L479 AbstractCegarLoop]: Abstraction has 2878 states and 3923 transitions. [2020-07-20 12:26:06,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:06,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 3923 transitions. [2020-07-20 12:26:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-07-20 12:26:06,625 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:06,625 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-20 12:26:06,839 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:06,840 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:06,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:06,841 INFO L82 PathProgramCache]: Analyzing trace with hash -682494087, now seen corresponding path program 1 times [2020-07-20 12:26:06,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:06,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1730637369] [2020-07-20 12:26:06,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:07,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 12:26:07,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-07-20 12:26:07,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:07,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1730637369] [2020-07-20 12:26:07,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:07,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:07,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581994252] [2020-07-20 12:26:07,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:07,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:07,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:07,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:07,240 INFO L87 Difference]: Start difference. First operand 2878 states and 3923 transitions. Second operand 3 states. [2020-07-20 12:26:07,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:07,372 INFO L93 Difference]: Finished difference Result 4871 states and 6775 transitions. [2020-07-20 12:26:07,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:07,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-07-20 12:26:07,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:07,392 INFO L225 Difference]: With dead ends: 4871 [2020-07-20 12:26:07,392 INFO L226 Difference]: Without dead ends: 2882 [2020-07-20 12:26:07,403 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-07-20 12:26:07,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2878. [2020-07-20 12:26:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2878 states. [2020-07-20 12:26:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 3885 transitions. [2020-07-20 12:26:07,554 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 3885 transitions. Word has length 212 [2020-07-20 12:26:07,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:07,554 INFO L479 AbstractCegarLoop]: Abstraction has 2878 states and 3885 transitions. [2020-07-20 12:26:07,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:07,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 3885 transitions. [2020-07-20 12:26:07,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-07-20 12:26:07,563 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:07,564 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] [2020-07-20 12:26:07,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:07,779 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:07,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash -265547747, now seen corresponding path program 1 times [2020-07-20 12:26:07,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:07,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1578857741] [2020-07-20 12:26:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:07,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 12:26:07,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:07,996 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-07-20 12:26:07,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:07,997 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1578857741] [2020-07-20 12:26:07,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:07,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 12:26:07,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774035545] [2020-07-20 12:26:07,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 12:26:07,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:07,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 12:26:07,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:26:07,999 INFO L87 Difference]: Start difference. First operand 2878 states and 3885 transitions. Second operand 5 states. [2020-07-20 12:26:08,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:08,713 INFO L93 Difference]: Finished difference Result 6645 states and 10108 transitions. [2020-07-20 12:26:08,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 12:26:08,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2020-07-20 12:26:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:08,749 INFO L225 Difference]: With dead ends: 6645 [2020-07-20 12:26:08,749 INFO L226 Difference]: Without dead ends: 3787 [2020-07-20 12:26:08,776 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:26:08,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2020-07-20 12:26:08,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3361. [2020-07-20 12:26:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3361 states. [2020-07-20 12:26:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 4508 transitions. [2020-07-20 12:26:08,991 INFO L78 Accepts]: Start accepts. Automaton has 3361 states and 4508 transitions. Word has length 212 [2020-07-20 12:26:08,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:08,991 INFO L479 AbstractCegarLoop]: Abstraction has 3361 states and 4508 transitions. [2020-07-20 12:26:08,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 12:26:08,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 4508 transitions. [2020-07-20 12:26:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-07-20 12:26:09,002 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:09,002 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:26:09,217 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:09,218 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:09,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:09,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1623667584, now seen corresponding path program 1 times [2020-07-20 12:26:09,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:09,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [750065691] [2020-07-20 12:26:09,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:09,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:09,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-20 12:26:09,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:09,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [750065691] [2020-07-20 12:26:09,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:09,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:09,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315713315] [2020-07-20 12:26:09,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:09,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:09,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:09,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:09,384 INFO L87 Difference]: Start difference. First operand 3361 states and 4508 transitions. Second operand 3 states. [2020-07-20 12:26:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:09,515 INFO L93 Difference]: Finished difference Result 5763 states and 8139 transitions. [2020-07-20 12:26:09,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:09,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-07-20 12:26:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:09,536 INFO L225 Difference]: With dead ends: 5763 [2020-07-20 12:26:09,536 INFO L226 Difference]: Without dead ends: 3367 [2020-07-20 12:26:09,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2020-07-20 12:26:09,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 3361. [2020-07-20 12:26:09,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3361 states. [2020-07-20 12:26:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 4468 transitions. [2020-07-20 12:26:09,776 INFO L78 Accepts]: Start accepts. Automaton has 3361 states and 4468 transitions. Word has length 212 [2020-07-20 12:26:09,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:09,777 INFO L479 AbstractCegarLoop]: Abstraction has 3361 states and 4468 transitions. [2020-07-20 12:26:09,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 4468 transitions. [2020-07-20 12:26:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-20 12:26:09,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:09,789 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-20 12:26:10,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:10,005 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:10,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1685575191, now seen corresponding path program 1 times [2020-07-20 12:26:10,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:10,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2042350947] [2020-07-20 12:26:10,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:10,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 12:26:10,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-20 12:26:10,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:10,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2042350947] [2020-07-20 12:26:10,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:10,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:10,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760229865] [2020-07-20 12:26:10,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:10,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:10,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:10,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:10,280 INFO L87 Difference]: Start difference. First operand 3361 states and 4468 transitions. Second operand 3 states. [2020-07-20 12:26:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:10,534 INFO L93 Difference]: Finished difference Result 9475 states and 13633 transitions. [2020-07-20 12:26:10,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:10,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2020-07-20 12:26:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:10,584 INFO L225 Difference]: With dead ends: 9475 [2020-07-20 12:26:10,584 INFO L226 Difference]: Without dead ends: 6136 [2020-07-20 12:26:10,602 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:10,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2020-07-20 12:26:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 6132. [2020-07-20 12:26:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6132 states. [2020-07-20 12:26:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6132 states to 6132 states and 8647 transitions. [2020-07-20 12:26:10,935 INFO L78 Accepts]: Start accepts. Automaton has 6132 states and 8647 transitions. Word has length 213 [2020-07-20 12:26:10,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:10,936 INFO L479 AbstractCegarLoop]: Abstraction has 6132 states and 8647 transitions. [2020-07-20 12:26:10,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 6132 states and 8647 transitions. [2020-07-20 12:26:10,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2020-07-20 12:26:10,954 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:10,955 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-20 12:26:11,169 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:11,170 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:11,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:11,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2001767659, now seen corresponding path program 1 times [2020-07-20 12:26:11,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:11,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1515978024] [2020-07-20 12:26:11,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:11,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 12:26:11,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-07-20 12:26:11,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:11,473 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1515978024] [2020-07-20 12:26:11,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:11,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 12:26:11,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510764125] [2020-07-20 12:26:11,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 12:26:11,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:11,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 12:26:11,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:26:11,475 INFO L87 Difference]: Start difference. First operand 6132 states and 8647 transitions. Second operand 5 states. [2020-07-20 12:26:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:12,026 INFO L93 Difference]: Finished difference Result 12241 states and 17379 transitions. [2020-07-20 12:26:12,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 12:26:12,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 306 [2020-07-20 12:26:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:12,061 INFO L225 Difference]: With dead ends: 12241 [2020-07-20 12:26:12,061 INFO L226 Difference]: Without dead ends: 6132 [2020-07-20 12:26:12,076 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:26:12,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6132 states. [2020-07-20 12:26:12,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6132 to 6132. [2020-07-20 12:26:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6132 states. [2020-07-20 12:26:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6132 states to 6132 states and 8539 transitions. [2020-07-20 12:26:12,424 INFO L78 Accepts]: Start accepts. Automaton has 6132 states and 8539 transitions. Word has length 306 [2020-07-20 12:26:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:12,424 INFO L479 AbstractCegarLoop]: Abstraction has 6132 states and 8539 transitions. [2020-07-20 12:26:12,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 12:26:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 6132 states and 8539 transitions. [2020-07-20 12:26:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2020-07-20 12:26:12,445 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:12,445 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:26:12,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:12,660 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:12,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:12,660 INFO L82 PathProgramCache]: Analyzing trace with hash -121441309, now seen corresponding path program 1 times [2020-07-20 12:26:12,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:12,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1091027225] [2020-07-20 12:26:12,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:12,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:12,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2020-07-20 12:26:12,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:12,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1091027225] [2020-07-20 12:26:12,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:12,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:12,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13658284] [2020-07-20 12:26:12,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:12,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:12,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:13,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:13,000 INFO L87 Difference]: Start difference. First operand 6132 states and 8539 transitions. Second operand 3 states. [2020-07-20 12:26:13,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:13,204 INFO L93 Difference]: Finished difference Result 12238 states and 17044 transitions. [2020-07-20 12:26:13,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:13,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2020-07-20 12:26:13,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:13,234 INFO L225 Difference]: With dead ends: 12238 [2020-07-20 12:26:13,234 INFO L226 Difference]: Without dead ends: 6127 [2020-07-20 12:26:13,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2020-07-20 12:26:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 6127. [2020-07-20 12:26:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6127 states. [2020-07-20 12:26:13,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6127 states to 6127 states and 8529 transitions. [2020-07-20 12:26:13,556 INFO L78 Accepts]: Start accepts. Automaton has 6127 states and 8529 transitions. Word has length 306 [2020-07-20 12:26:13,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:13,557 INFO L479 AbstractCegarLoop]: Abstraction has 6127 states and 8529 transitions. [2020-07-20 12:26:13,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 6127 states and 8529 transitions. [2020-07-20 12:26:13,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2020-07-20 12:26:13,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:13,572 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-20 12:26:13,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:13,787 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:13,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash 997588263, now seen corresponding path program 1 times [2020-07-20 12:26:13,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:13,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1710350714] [2020-07-20 12:26:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:13,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 12:26:13,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-07-20 12:26:14,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:14,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1710350714] [2020-07-20 12:26:14,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:14,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 12:26:14,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198705346] [2020-07-20 12:26:14,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 12:26:14,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:14,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 12:26:14,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:26:14,093 INFO L87 Difference]: Start difference. First operand 6127 states and 8529 transitions. Second operand 5 states. [2020-07-20 12:26:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:14,634 INFO L93 Difference]: Finished difference Result 12234 states and 17146 transitions. [2020-07-20 12:26:14,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 12:26:14,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 306 [2020-07-20 12:26:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:14,658 INFO L225 Difference]: With dead ends: 12234 [2020-07-20 12:26:14,659 INFO L226 Difference]: Without dead ends: 6127 [2020-07-20 12:26:14,675 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:26:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2020-07-20 12:26:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 6127. [2020-07-20 12:26:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6127 states. [2020-07-20 12:26:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6127 states to 6127 states and 8421 transitions. [2020-07-20 12:26:15,010 INFO L78 Accepts]: Start accepts. Automaton has 6127 states and 8421 transitions. Word has length 306 [2020-07-20 12:26:15,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:15,010 INFO L479 AbstractCegarLoop]: Abstraction has 6127 states and 8421 transitions. [2020-07-20 12:26:15,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 12:26:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 6127 states and 8421 transitions. [2020-07-20 12:26:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-20 12:26:15,021 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:15,021 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-20 12:26:15,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:15,234 INFO L427 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:15,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:15,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1659971131, now seen corresponding path program 1 times [2020-07-20 12:26:15,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:15,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [124578269] [2020-07-20 12:26:15,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:15,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 12:26:15,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-07-20 12:26:15,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:15,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [124578269] [2020-07-20 12:26:15,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:15,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 12:26:15,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546538375] [2020-07-20 12:26:15,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 12:26:15,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:15,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 12:26:15,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:26:15,439 INFO L87 Difference]: Start difference. First operand 6127 states and 8421 transitions. Second operand 5 states. [2020-07-20 12:26:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:16,470 INFO L93 Difference]: Finished difference Result 19239 states and 27314 transitions. [2020-07-20 12:26:16,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 12:26:16,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2020-07-20 12:26:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:16,534 INFO L225 Difference]: With dead ends: 19239 [2020-07-20 12:26:16,534 INFO L226 Difference]: Without dead ends: 13132 [2020-07-20 12:26:16,557 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-20 12:26:16,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13132 states. [2020-07-20 12:26:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13132 to 12228. [2020-07-20 12:26:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12228 states. [2020-07-20 12:26:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12228 states to 12228 states and 16561 transitions. [2020-07-20 12:26:17,879 INFO L78 Accepts]: Start accepts. Automaton has 12228 states and 16561 transitions. Word has length 213 [2020-07-20 12:26:17,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:17,879 INFO L479 AbstractCegarLoop]: Abstraction has 12228 states and 16561 transitions. [2020-07-20 12:26:17,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 12:26:17,880 INFO L276 IsEmpty]: Start isEmpty. Operand 12228 states and 16561 transitions. [2020-07-20 12:26:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2020-07-20 12:26:17,890 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:17,891 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-20 12:26:18,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:18,105 INFO L427 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:18,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:18,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2058631651, now seen corresponding path program 1 times [2020-07-20 12:26:18,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:18,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2051241141] [2020-07-20 12:26:18,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:18,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-20 12:26:18,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:18,333 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-20 12:26:18,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:18,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2051241141] [2020-07-20 12:26:18,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:18,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 12:26:18,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953358084] [2020-07-20 12:26:18,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 12:26:18,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:18,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 12:26:18,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:26:18,335 INFO L87 Difference]: Start difference. First operand 12228 states and 16561 transitions. Second operand 6 states. [2020-07-20 12:26:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:18,754 INFO L93 Difference]: Finished difference Result 17960 states and 24463 transitions. [2020-07-20 12:26:18,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 12:26:18,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 306 [2020-07-20 12:26:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:18,780 INFO L225 Difference]: With dead ends: 17960 [2020-07-20 12:26:18,780 INFO L226 Difference]: Without dead ends: 5754 [2020-07-20 12:26:18,807 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-20 12:26:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5754 states. [2020-07-20 12:26:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5754 to 5579. [2020-07-20 12:26:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5579 states. [2020-07-20 12:26:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 7074 transitions. [2020-07-20 12:26:19,084 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 7074 transitions. Word has length 306 [2020-07-20 12:26:19,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:19,085 INFO L479 AbstractCegarLoop]: Abstraction has 5579 states and 7074 transitions. [2020-07-20 12:26:19,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 12:26:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 7074 transitions. [2020-07-20 12:26:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-20 12:26:19,088 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:19,088 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-20 12:26:19,289 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:19,289 INFO L427 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:19,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:19,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1188415299, now seen corresponding path program 1 times [2020-07-20 12:26:19,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:19,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1832167734] [2020-07-20 12:26:19,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:19,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 926 conjuncts, 39 conjunts are in the unsatisfiable core [2020-07-20 12:26:19,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-07-20 12:26:19,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:19,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1832167734] [2020-07-20 12:26:19,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:19,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-20 12:26:19,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877691710] [2020-07-20 12:26:19,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-20 12:26:19,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:19,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-20 12:26:19,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 12:26:19,500 INFO L87 Difference]: Start difference. First operand 5579 states and 7074 transitions. Second operand 4 states. [2020-07-20 12:26:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:20,057 INFO L93 Difference]: Finished difference Result 11335 states and 14498 transitions. [2020-07-20 12:26:20,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 12:26:20,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2020-07-20 12:26:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:20,075 INFO L225 Difference]: With dead ends: 11335 [2020-07-20 12:26:20,075 INFO L226 Difference]: Without dead ends: 5830 [2020-07-20 12:26:20,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:26:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5830 states. [2020-07-20 12:26:20,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5830 to 5608. [2020-07-20 12:26:20,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5608 states. [2020-07-20 12:26:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5608 states to 5608 states and 6966 transitions. [2020-07-20 12:26:20,366 INFO L78 Accepts]: Start accepts. Automaton has 5608 states and 6966 transitions. Word has length 213 [2020-07-20 12:26:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:20,366 INFO L479 AbstractCegarLoop]: Abstraction has 5608 states and 6966 transitions. [2020-07-20 12:26:20,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-20 12:26:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 5608 states and 6966 transitions. [2020-07-20 12:26:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2020-07-20 12:26:20,370 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:20,370 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, 1] [2020-07-20 12:26:20,580 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:20,581 INFO L427 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:20,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:20,582 INFO L82 PathProgramCache]: Analyzing trace with hash 348127502, now seen corresponding path program 1 times [2020-07-20 12:26:20,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:20,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1019426375] [2020-07-20 12:26:20,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:20,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:26:20,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2020-07-20 12:26:20,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:20,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1019426375] [2020-07-20 12:26:20,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:20,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:20,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564539579] [2020-07-20 12:26:20,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:20,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:20,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:20,745 INFO L87 Difference]: Start difference. First operand 5608 states and 6966 transitions. Second operand 3 states. [2020-07-20 12:26:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:20,860 INFO L93 Difference]: Finished difference Result 8644 states and 10947 transitions. [2020-07-20 12:26:20,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:20,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2020-07-20 12:26:20,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:20,873 INFO L225 Difference]: With dead ends: 8644 [2020-07-20 12:26:20,873 INFO L226 Difference]: Without dead ends: 3400 [2020-07-20 12:26:20,888 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2020-07-20 12:26:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3334. [2020-07-20 12:26:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3334 states. [2020-07-20 12:26:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 3863 transitions. [2020-07-20 12:26:21,046 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 3863 transitions. Word has length 214 [2020-07-20 12:26:21,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:21,046 INFO L479 AbstractCegarLoop]: Abstraction has 3334 states and 3863 transitions. [2020-07-20 12:26:21,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:21,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 3863 transitions. [2020-07-20 12:26:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-07-20 12:26:21,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:21,057 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-20 12:26:21,272 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:21,273 INFO L427 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:21,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:21,274 INFO L82 PathProgramCache]: Analyzing trace with hash -460026251, now seen corresponding path program 1 times [2020-07-20 12:26:21,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:21,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [942129631] [2020-07-20 12:26:21,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:21,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 12:26:21,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-07-20 12:26:21,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:21,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [942129631] [2020-07-20 12:26:21,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:21,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 12:26:21,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850124410] [2020-07-20 12:26:21,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 12:26:21,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:21,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 12:26:21,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:26:21,447 INFO L87 Difference]: Start difference. First operand 3334 states and 3863 transitions. Second operand 6 states. [2020-07-20 12:26:21,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:21,608 INFO L93 Difference]: Finished difference Result 6003 states and 7095 transitions. [2020-07-20 12:26:21,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 12:26:21,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2020-07-20 12:26:21,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:21,614 INFO L225 Difference]: With dead ends: 6003 [2020-07-20 12:26:21,614 INFO L226 Difference]: Without dead ends: 2719 [2020-07-20 12:26:21,620 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 12:26:21,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2020-07-20 12:26:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2719. [2020-07-20 12:26:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2719 states. [2020-07-20 12:26:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 3060 transitions. [2020-07-20 12:26:21,746 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 3060 transitions. Word has length 215 [2020-07-20 12:26:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:21,746 INFO L479 AbstractCegarLoop]: Abstraction has 2719 states and 3060 transitions. [2020-07-20 12:26:21,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 12:26:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 3060 transitions. [2020-07-20 12:26:21,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-07-20 12:26:21,749 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:21,749 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, 1, 1] [2020-07-20 12:26:21,962 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:21,962 INFO L427 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:21,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:21,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1796614603, now seen corresponding path program 1 times [2020-07-20 12:26:21,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:21,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [381681678] [2020-07-20 12:26:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:22,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 12:26:22,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-07-20 12:26:22,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:22,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [381681678] [2020-07-20 12:26:22,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:22,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 12:26:22,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403175723] [2020-07-20 12:26:22,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 12:26:22,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:22,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 12:26:22,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:26:22,157 INFO L87 Difference]: Start difference. First operand 2719 states and 3060 transitions. Second operand 6 states. [2020-07-20 12:26:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:22,261 INFO L93 Difference]: Finished difference Result 4987 states and 5737 transitions. [2020-07-20 12:26:22,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 12:26:22,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2020-07-20 12:26:22,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:22,265 INFO L225 Difference]: With dead ends: 4987 [2020-07-20 12:26:22,265 INFO L226 Difference]: Without dead ends: 2309 [2020-07-20 12:26:22,268 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 12:26:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2020-07-20 12:26:22,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2309. [2020-07-20 12:26:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2309 states. [2020-07-20 12:26:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 2541 transitions. [2020-07-20 12:26:22,356 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 2541 transitions. Word has length 215 [2020-07-20 12:26:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:22,357 INFO L479 AbstractCegarLoop]: Abstraction has 2309 states and 2541 transitions. [2020-07-20 12:26:22,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 12:26:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2541 transitions. [2020-07-20 12:26:22,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-07-20 12:26:22,359 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:22,359 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-20 12:26:22,572 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:22,573 INFO L427 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:22,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:22,573 INFO L82 PathProgramCache]: Analyzing trace with hash 592829452, now seen corresponding path program 1 times [2020-07-20 12:26:22,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:22,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [364758740] [2020-07-20 12:26:22,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:22,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 12:26:22,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:22,741 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-20 12:26:22,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:22,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [364758740] [2020-07-20 12:26:22,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:22,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 12:26:22,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943376776] [2020-07-20 12:26:22,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 12:26:22,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:22,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 12:26:22,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:26:22,743 INFO L87 Difference]: Start difference. First operand 2309 states and 2541 transitions. Second operand 6 states. [2020-07-20 12:26:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:22,817 INFO L93 Difference]: Finished difference Result 3229 states and 3580 transitions. [2020-07-20 12:26:22,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 12:26:22,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2020-07-20 12:26:22,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:22,821 INFO L225 Difference]: With dead ends: 3229 [2020-07-20 12:26:22,821 INFO L226 Difference]: Without dead ends: 451 [2020-07-20 12:26:22,824 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 12:26:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2020-07-20 12:26:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2020-07-20 12:26:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2020-07-20 12:26:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 474 transitions. [2020-07-20 12:26:22,851 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 474 transitions. Word has length 215 [2020-07-20 12:26:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:22,852 INFO L479 AbstractCegarLoop]: Abstraction has 451 states and 474 transitions. [2020-07-20 12:26:22,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 12:26:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 474 transitions. [2020-07-20 12:26:22,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2020-07-20 12:26:22,853 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:22,854 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-20 12:26:23,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:23,067 INFO L427 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:23,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:23,068 INFO L82 PathProgramCache]: Analyzing trace with hash -373872983, now seen corresponding path program 1 times [2020-07-20 12:26:23,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:23,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1155488160] [2020-07-20 12:26:23,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:23,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-20 12:26:23,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:23,315 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-20 12:26:23,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 12:26:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2020-07-20 12:26:23,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1155488160] [2020-07-20 12:26:23,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 12:26:23,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 11 [2020-07-20 12:26:23,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817864920] [2020-07-20 12:26:23,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 12:26:23,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:23,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 12:26:23,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-20 12:26:23,720 INFO L87 Difference]: Start difference. First operand 451 states and 474 transitions. Second operand 9 states. [2020-07-20 12:26:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:24,458 INFO L93 Difference]: Finished difference Result 453 states and 475 transitions. [2020-07-20 12:26:24,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 12:26:24,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 267 [2020-07-20 12:26:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:24,460 INFO L225 Difference]: With dead ends: 453 [2020-07-20 12:26:24,460 INFO L226 Difference]: Without dead ends: 450 [2020-07-20 12:26:24,461 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2020-07-20 12:26:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-07-20 12:26:24,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-07-20 12:26:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-07-20 12:26:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 472 transitions. [2020-07-20 12:26:24,518 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 472 transitions. Word has length 267 [2020-07-20 12:26:24,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:24,519 INFO L479 AbstractCegarLoop]: Abstraction has 450 states and 472 transitions. [2020-07-20 12:26:24,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 12:26:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 472 transitions. [2020-07-20 12:26:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2020-07-20 12:26:24,520 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:24,521 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-20 12:26:24,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:24,735 INFO L427 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:24,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:24,735 INFO L82 PathProgramCache]: Analyzing trace with hash -271251823, now seen corresponding path program 1 times [2020-07-20 12:26:24,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:24,735 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [664629365] [2020-07-20 12:26:24,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:24,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 12:26:24,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:24,921 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-20 12:26:24,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:26:24,922 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [664629365] [2020-07-20 12:26:24,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:26:24,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:26:24,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345283638] [2020-07-20 12:26:24,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:26:24,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:26:24,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:26:24,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:24,923 INFO L87 Difference]: Start difference. First operand 450 states and 472 transitions. Second operand 3 states. [2020-07-20 12:26:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:24,953 INFO L93 Difference]: Finished difference Result 643 states and 675 transitions. [2020-07-20 12:26:24,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:26:24,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2020-07-20 12:26:24,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:24,954 INFO L225 Difference]: With dead ends: 643 [2020-07-20 12:26:24,954 INFO L226 Difference]: Without dead ends: 457 [2020-07-20 12:26:24,955 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:26:24,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2020-07-20 12:26:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2020-07-20 12:26:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2020-07-20 12:26:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 480 transitions. [2020-07-20 12:26:24,973 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 480 transitions. Word has length 271 [2020-07-20 12:26:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:24,973 INFO L479 AbstractCegarLoop]: Abstraction has 457 states and 480 transitions. [2020-07-20 12:26:24,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:26:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 480 transitions. [2020-07-20 12:26:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-07-20 12:26:24,974 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:24,974 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-20 12:26:25,175 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:25,175 INFO L427 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:25,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:25,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1410375831, now seen corresponding path program 1 times [2020-07-20 12:26:25,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:25,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [72864471] [2020-07-20 12:26:25,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 12:26:25,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 12:26:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 12:26:25,385 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 12:26:25,666 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-20 12:26:25,666 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 12:26:25,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:26,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 12:26:26 BoogieIcfgContainer [2020-07-20 12:26:26,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 12:26:26,064 INFO L168 Benchmark]: Toolchain (without parser) took 28165.56 ms. Allocated memory was 135.8 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 99.9 MB in the beginning and 871.9 MB in the end (delta: -772.0 MB). Peak memory consumption was 394.5 MB. Max. memory is 7.1 GB. [2020-07-20 12:26:26,064 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 135.8 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 12:26:26,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 503.02 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 177.7 MB in the end (delta: -78.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2020-07-20 12:26:26,065 INFO L168 Benchmark]: Boogie Preprocessor took 44.14 ms. Allocated memory is still 199.8 MB. Free memory was 176.9 MB in the beginning and 174.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-20 12:26:26,066 INFO L168 Benchmark]: RCFGBuilder took 622.98 ms. Allocated memory is still 199.8 MB. Free memory was 174.4 MB in the beginning and 135.2 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. [2020-07-20 12:26:26,066 INFO L168 Benchmark]: TraceAbstraction took 26989.57 ms. Allocated memory was 199.8 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 134.5 MB in the beginning and 871.9 MB in the end (delta: -737.4 MB). Peak memory consumption was 365.2 MB. Max. memory is 7.1 GB. [2020-07-20 12:26:26,068 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.17 ms. Allocated memory is still 135.8 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 503.02 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 177.7 MB in the end (delta: -78.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.14 ms. Allocated memory is still 199.8 MB. Free memory was 176.9 MB in the beginning and 174.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 622.98 ms. Allocated memory is still 199.8 MB. Free memory was 174.4 MB in the beginning and 135.2 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26989.57 ms. Allocated memory was 199.8 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 134.5 MB in the beginning and 871.9 MB in the end (delta: -737.4 MB). Peak memory consumption was 365.2 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)=18, \old(E_2)=3, \old(E_M)=17, \old(local)=8, \old(M_E)=9, \old(m_i)=20, \old(m_pc)=6, \old(m_st)=11, \old(T1_E)=19, \old(t1_i)=15, \old(t1_pc)=13, \old(t1_st)=14, \old(T2_E)=10, \old(t2_i)=12, \old(t2_pc)=16, \old(t2_st)=7, \old(token)=4, 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: 26.7s, OverallIterations: 28, TraceHistogramMax: 6, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7173 SDtfs, 5378 SDslu, 6637 SDs, 0 SdLazy, 2075 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6314 GetRequests, 6234 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12228occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 2222 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 6322 NumberOfCodeBlocks, 6322 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 6289 ConstructedInterpolants, 0 QuantifiedInterpolants, 1888303 SizeOfPredicates, 22 NumberOfNonLiveVariables, 26370 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 28 InterpolantComputations, 27 PerfectInterpolantSequences, 4623/4689 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...