/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 SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic DAGSIZE --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -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 22:58:16,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 22:58:16,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 22:58:17,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 22:58:17,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 22:58:17,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 22:58:17,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 22:58:17,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 22:58:17,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 22:58:17,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 22:58:17,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 22:58:17,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 22:58:17,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 22:58:17,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 22:58:17,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 22:58:17,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 22:58:17,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 22:58:17,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 22:58:17,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 22:58:17,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 22:58:17,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 22:58:17,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 22:58:17,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 22:58:17,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 22:58:17,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 22:58:17,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 22:58:17,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 22:58:17,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 22:58:17,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 22:58:17,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 22:58:17,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 22:58:17,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 22:58:17,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 22:58:17,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 22:58:17,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 22:58:17,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 22:58:17,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 22:58:17,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 22:58:17,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 22:58:17,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 22:58:17,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 22:58:17,045 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 22:58:17,060 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 22:58:17,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 22:58:17,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 22:58:17,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 22:58:17,063 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 22:58:17,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 22:58:17,063 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 22:58:17,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 22:58:17,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 22:58:17,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 22:58:17,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 22:58:17,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 22:58:17,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 22:58:17,064 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 22:58:17,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 22:58:17,065 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 22:58:17,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 22:58:17,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 22:58:17,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 22:58:17,066 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 22:58:17,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 22:58:17,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 22:58:17,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 22:58:17,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 22:58:17,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 22:58:17,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 22:58:17,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:17,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 22:58:17,068 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 22:58:17,068 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 -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> DAGSIZE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-20 22:58:17,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 22:58:17,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 22:58:17,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 22:58:17,463 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 22:58:17,465 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 22:58:17,465 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 22:58:17,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24997ea11/100c406f5b9a4e1a88e7f495429d268d/FLAG7eaf21203 [2020-07-20 22:58:17,992 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 22:58:17,993 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-07-20 22:58:18,006 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24997ea11/100c406f5b9a4e1a88e7f495429d268d/FLAG7eaf21203 [2020-07-20 22:58:18,366 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24997ea11/100c406f5b9a4e1a88e7f495429d268d [2020-07-20 22:58:18,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 22:58:18,378 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 22:58:18,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 22:58:18,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 22:58:18,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 22:58:18,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:58:18" (1/1) ... [2020-07-20 22:58:18,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69fc279c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:18, skipping insertion in model container [2020-07-20 22:58:18,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:58:18" (1/1) ... [2020-07-20 22:58:18,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 22:58:18,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 22:58:18,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 22:58:18,778 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 22:58:18,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 22:58:18,936 INFO L208 MainTranslator]: Completed translation [2020-07-20 22:58:18,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:18 WrapperNode [2020-07-20 22:58:18,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 22:58:18,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 22:58:18,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 22:58:18,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 22:58:18,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:18" (1/1) ... [2020-07-20 22:58:18,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:18" (1/1) ... [2020-07-20 22:58:18,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:18" (1/1) ... [2020-07-20 22:58:18,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:18" (1/1) ... [2020-07-20 22:58:18,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:18" (1/1) ... [2020-07-20 22:58:18,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:18" (1/1) ... [2020-07-20 22:58:18,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:18" (1/1) ... [2020-07-20 22:58:18,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 22:58:18,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 22:58:18,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 22:58:18,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 22:58:18,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:18" (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 22:58:19,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 22:58:19,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 22:58:19,057 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 22:58:19,057 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-20 22:58:19,058 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-20 22:58:19,058 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-07-20 22:58:19,058 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-20 22:58:19,058 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-20 22:58:19,058 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-07-20 22:58:19,058 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 22:58:19,058 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 22:58:19,059 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 22:58:19,059 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 22:58:19,059 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 22:58:19,059 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 22:58:19,059 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 22:58:19,059 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-20 22:58:19,060 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 22:58:19,060 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 22:58:19,060 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 22:58:19,060 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 22:58:19,060 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 22:58:19,060 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 22:58:19,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 22:58:19,061 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 22:58:19,061 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-20 22:58:19,061 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-20 22:58:19,061 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-07-20 22:58:19,061 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-20 22:58:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 22:58:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-20 22:58:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-20 22:58:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-07-20 22:58:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 22:58:19,062 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 22:58:19,063 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 22:58:19,063 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 22:58:19,063 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 22:58:19,063 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 22:58:19,063 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 22:58:19,063 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 22:58:19,063 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 22:58:19,063 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 22:58:19,063 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 22:58:19,064 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 22:58:19,064 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 22:58:19,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 22:58:19,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 22:58:19,664 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 22:58:19,665 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-20 22:58:19,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:58:19 BoogieIcfgContainer [2020-07-20 22:58:19,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 22:58:19,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 22:58:19,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 22:58:19,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 22:58:19,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:58:18" (1/3) ... [2020-07-20 22:58:19,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7914a389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:58:19, skipping insertion in model container [2020-07-20 22:58:19,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:58:18" (2/3) ... [2020-07-20 22:58:19,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7914a389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:58:19, skipping insertion in model container [2020-07-20 22:58:19,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:58:19" (3/3) ... [2020-07-20 22:58:19,683 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-07-20 22:58:19,694 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 22:58:19,702 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 22:58:19,717 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 22:58:19,747 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 22:58:19,748 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 22:58:19,748 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 22:58:19,748 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 22:58:19,749 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 22:58:19,749 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 22:58:19,750 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 22:58:19,750 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 22:58:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2020-07-20 22:58:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-20 22:58:19,804 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:19,806 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 22:58:19,806 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:19,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:19,813 INFO L82 PathProgramCache]: Analyzing trace with hash -67309704, now seen corresponding path program 1 times [2020-07-20 22:58:19,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:19,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1044826591] [2020-07-20 22:58:19,824 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:19,971 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:58:19,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:19,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-20 22:58:19,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:20,104 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 22:58:20,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:20,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1044826591] [2020-07-20 22:58:20,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:20,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 22:58:20,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796894075] [2020-07-20 22:58:20,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 22:58:20,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:20,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 22:58:20,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 22:58:20,132 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 6 states. [2020-07-20 22:58:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:20,244 INFO L93 Difference]: Finished difference Result 352 states and 516 transitions. [2020-07-20 22:58:20,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 22:58:20,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2020-07-20 22:58:20,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:20,276 INFO L225 Difference]: With dead ends: 352 [2020-07-20 22:58:20,277 INFO L226 Difference]: Without dead ends: 185 [2020-07-20 22:58:20,282 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 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 22:58:20,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-07-20 22:58:20,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2020-07-20 22:58:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-20 22:58:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 240 transitions. [2020-07-20 22:58:20,390 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 240 transitions. Word has length 92 [2020-07-20 22:58:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:20,391 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 240 transitions. [2020-07-20 22:58:20,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 22:58:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 240 transitions. [2020-07-20 22:58:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-20 22:58:20,396 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:20,397 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 22:58:20,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:20,610 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:20,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:20,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1605649734, now seen corresponding path program 1 times [2020-07-20 22:58:20,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:20,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [473398840] [2020-07-20 22:58:20,612 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:20,712 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:58:20,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:20,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-20 22:58:20,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:20,779 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 22:58:20,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:20,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [473398840] [2020-07-20 22:58:20,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:20,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 22:58:20,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234582087] [2020-07-20 22:58:20,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 22:58:20,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:20,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 22:58:20,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 22:58:20,784 INFO L87 Difference]: Start difference. First operand 177 states and 240 transitions. Second operand 6 states. [2020-07-20 22:58:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:20,836 INFO L93 Difference]: Finished difference Result 340 states and 475 transitions. [2020-07-20 22:58:20,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 22:58:20,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2020-07-20 22:58:20,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:20,840 INFO L225 Difference]: With dead ends: 340 [2020-07-20 22:58:20,841 INFO L226 Difference]: Without dead ends: 184 [2020-07-20 22:58:20,843 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 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 22:58:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-07-20 22:58:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2020-07-20 22:58:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-07-20 22:58:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 245 transitions. [2020-07-20 22:58:20,865 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 245 transitions. Word has length 92 [2020-07-20 22:58:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:20,865 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 245 transitions. [2020-07-20 22:58:20,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 22:58:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 245 transitions. [2020-07-20 22:58:20,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-20 22:58:20,873 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:20,873 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 22:58:21,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:21,088 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:21,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:21,089 INFO L82 PathProgramCache]: Analyzing trace with hash 638333564, now seen corresponding path program 1 times [2020-07-20 22:58:21,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:21,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1815467849] [2020-07-20 22:58:21,091 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:21,162 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:58:21,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:21,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 22:58:21,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:21,221 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 22:58:21,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:21,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1815467849] [2020-07-20 22:58:21,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:21,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 22:58:21,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029856654] [2020-07-20 22:58:21,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 22:58:21,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:21,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 22:58:21,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 22:58:21,225 INFO L87 Difference]: Start difference. First operand 182 states and 245 transitions. Second operand 6 states. [2020-07-20 22:58:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:21,284 INFO L93 Difference]: Finished difference Result 355 states and 493 transitions. [2020-07-20 22:58:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 22:58:21,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2020-07-20 22:58:21,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:21,297 INFO L225 Difference]: With dead ends: 355 [2020-07-20 22:58:21,297 INFO L226 Difference]: Without dead ends: 194 [2020-07-20 22:58:21,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 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 22:58:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-07-20 22:58:21,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 187. [2020-07-20 22:58:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-07-20 22:58:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 250 transitions. [2020-07-20 22:58:21,339 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 250 transitions. Word has length 92 [2020-07-20 22:58:21,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:21,340 INFO L479 AbstractCegarLoop]: Abstraction has 187 states and 250 transitions. [2020-07-20 22:58:21,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 22:58:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 250 transitions. [2020-07-20 22:58:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-20 22:58:21,346 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:21,346 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 22:58:21,546 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:21,547 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:21,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:21,548 INFO L82 PathProgramCache]: Analyzing trace with hash -259059714, now seen corresponding path program 1 times [2020-07-20 22:58:21,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:21,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1833628989] [2020-07-20 22:58:21,550 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:21,669 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 22:58:21,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:21,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 22:58:21,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 22:58:21,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:21,734 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1833628989] [2020-07-20 22:58:21,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:21,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:21,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321899898] [2020-07-20 22:58:21,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:21,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:21,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:21,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:21,737 INFO L87 Difference]: Start difference. First operand 187 states and 250 transitions. Second operand 3 states. [2020-07-20 22:58:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:21,775 INFO L93 Difference]: Finished difference Result 500 states and 687 transitions. [2020-07-20 22:58:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:21,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-07-20 22:58:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:21,779 INFO L225 Difference]: With dead ends: 500 [2020-07-20 22:58:21,779 INFO L226 Difference]: Without dead ends: 334 [2020-07-20 22:58:21,781 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 22:58:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-07-20 22:58:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2020-07-20 22:58:21,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-07-20 22:58:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 446 transitions. [2020-07-20 22:58:21,810 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 446 transitions. Word has length 92 [2020-07-20 22:58:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:21,810 INFO L479 AbstractCegarLoop]: Abstraction has 333 states and 446 transitions. [2020-07-20 22:58:21,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 446 transitions. [2020-07-20 22:58:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-07-20 22:58:21,814 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:21,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:58:22,032 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:22,033 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:22,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:22,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1693923773, now seen corresponding path program 1 times [2020-07-20 22:58:22,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:22,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [931671084] [2020-07-20 22:58:22,035 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:22,133 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 22:58:22,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:22,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 22:58:22,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-07-20 22:58:22,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:22,177 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [931671084] [2020-07-20 22:58:22,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:22,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:22,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509776971] [2020-07-20 22:58:22,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:22,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:22,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:22,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:22,183 INFO L87 Difference]: Start difference. First operand 333 states and 446 transitions. Second operand 3 states. [2020-07-20 22:58:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:22,270 INFO L93 Difference]: Finished difference Result 933 states and 1283 transitions. [2020-07-20 22:58:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:22,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2020-07-20 22:58:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:22,283 INFO L225 Difference]: With dead ends: 933 [2020-07-20 22:58:22,292 INFO L226 Difference]: Without dead ends: 622 [2020-07-20 22:58:22,295 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 145 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 22:58:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-07-20 22:58:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 620. [2020-07-20 22:58:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2020-07-20 22:58:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 847 transitions. [2020-07-20 22:58:22,360 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 847 transitions. Word has length 147 [2020-07-20 22:58:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:22,361 INFO L479 AbstractCegarLoop]: Abstraction has 620 states and 847 transitions. [2020-07-20 22:58:22,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 847 transitions. [2020-07-20 22:58:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-07-20 22:58:22,372 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:22,372 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-07-20 22:58:22,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:22,586 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:22,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1026796008, now seen corresponding path program 1 times [2020-07-20 22:58:22,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:22,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1450879138] [2020-07-20 22:58:22,588 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:22,683 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 22:58:22,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:22,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 22:58:22,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2020-07-20 22:58:22,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:22,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1450879138] [2020-07-20 22:58:22,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:22,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:22,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049349272] [2020-07-20 22:58:22,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:22,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:22,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:22,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:22,766 INFO L87 Difference]: Start difference. First operand 620 states and 847 transitions. Second operand 3 states. [2020-07-20 22:58:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:22,795 INFO L93 Difference]: Finished difference Result 1074 states and 1463 transitions. [2020-07-20 22:58:22,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:22,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2020-07-20 22:58:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:22,800 INFO L225 Difference]: With dead ends: 1074 [2020-07-20 22:58:22,800 INFO L226 Difference]: Without dead ends: 475 [2020-07-20 22:58:22,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 246 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 22:58:22,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2020-07-20 22:58:22,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2020-07-20 22:58:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2020-07-20 22:58:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 642 transitions. [2020-07-20 22:58:22,830 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 642 transitions. Word has length 248 [2020-07-20 22:58:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:22,831 INFO L479 AbstractCegarLoop]: Abstraction has 475 states and 642 transitions. [2020-07-20 22:58:22,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 642 transitions. [2020-07-20 22:58:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-20 22:58:22,835 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:22,835 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 22:58:23,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:23,049 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:23,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:23,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1647756813, now seen corresponding path program 1 times [2020-07-20 22:58:23,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:23,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1036520377] [2020-07-20 22:58:23,052 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:23,171 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 22:58:23,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:23,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 22:58:23,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-07-20 22:58:23,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:23,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1036520377] [2020-07-20 22:58:23,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:23,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:23,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239765859] [2020-07-20 22:58:23,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:23,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:23,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:23,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:23,243 INFO L87 Difference]: Start difference. First operand 475 states and 642 transitions. Second operand 3 states. [2020-07-20 22:58:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:23,308 INFO L93 Difference]: Finished difference Result 1349 states and 1883 transitions. [2020-07-20 22:58:23,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:23,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2020-07-20 22:58:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:23,315 INFO L225 Difference]: With dead ends: 1349 [2020-07-20 22:58:23,315 INFO L226 Difference]: Without dead ends: 895 [2020-07-20 22:58:23,318 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 188 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 22:58:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2020-07-20 22:58:23,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 885. [2020-07-20 22:58:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-07-20 22:58:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1210 transitions. [2020-07-20 22:58:23,365 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1210 transitions. Word has length 191 [2020-07-20 22:58:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:23,366 INFO L479 AbstractCegarLoop]: Abstraction has 885 states and 1210 transitions. [2020-07-20 22:58:23,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1210 transitions. [2020-07-20 22:58:23,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-20 22:58:23,370 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:23,371 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] [2020-07-20 22:58:23,583 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:23,584 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:23,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:23,585 INFO L82 PathProgramCache]: Analyzing trace with hash 533994925, now seen corresponding path program 1 times [2020-07-20 22:58:23,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:23,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1266712162] [2020-07-20 22:58:23,587 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:23,663 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:58:23,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:23,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 22:58:23,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-07-20 22:58:23,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:23,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1266712162] [2020-07-20 22:58:23,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:23,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:23,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003063808] [2020-07-20 22:58:23,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:23,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:23,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:23,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:23,707 INFO L87 Difference]: Start difference. First operand 885 states and 1210 transitions. Second operand 3 states. [2020-07-20 22:58:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:23,795 INFO L93 Difference]: Finished difference Result 2543 states and 3674 transitions. [2020-07-20 22:58:23,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:23,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2020-07-20 22:58:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:23,808 INFO L225 Difference]: With dead ends: 2543 [2020-07-20 22:58:23,808 INFO L226 Difference]: Without dead ends: 1680 [2020-07-20 22:58:23,813 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 22:58:23,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2020-07-20 22:58:23,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1664. [2020-07-20 22:58:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2020-07-20 22:58:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2347 transitions. [2020-07-20 22:58:23,915 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2347 transitions. Word has length 191 [2020-07-20 22:58:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:23,916 INFO L479 AbstractCegarLoop]: Abstraction has 1664 states and 2347 transitions. [2020-07-20 22:58:23,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2347 transitions. [2020-07-20 22:58:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-20 22:58:23,924 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:23,924 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 22:58:24,138 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:24,139 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:24,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:24,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1488224269, now seen corresponding path program 1 times [2020-07-20 22:58:24,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:24,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [257758148] [2020-07-20 22:58:24,140 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:24,220 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 22:58:24,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:24,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 22:58:24,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:24,283 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 22:58:24,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:24,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [257758148] [2020-07-20 22:58:24,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:24,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:24,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795845089] [2020-07-20 22:58:24,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:24,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:24,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:24,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:24,286 INFO L87 Difference]: Start difference. First operand 1664 states and 2347 transitions. Second operand 3 states. [2020-07-20 22:58:24,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:24,391 INFO L93 Difference]: Finished difference Result 3608 states and 5182 transitions. [2020-07-20 22:58:24,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:24,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2020-07-20 22:58:24,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:24,405 INFO L225 Difference]: With dead ends: 3608 [2020-07-20 22:58:24,405 INFO L226 Difference]: Without dead ends: 1964 [2020-07-20 22:58:24,415 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 188 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 22:58:24,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2020-07-20 22:58:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2020-07-20 22:58:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2020-07-20 22:58:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2639 transitions. [2020-07-20 22:58:24,521 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2639 transitions. Word has length 191 [2020-07-20 22:58:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:24,521 INFO L479 AbstractCegarLoop]: Abstraction has 1964 states and 2639 transitions. [2020-07-20 22:58:24,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2639 transitions. [2020-07-20 22:58:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-07-20 22:58:24,531 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:24,531 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:58:24,745 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:24,746 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:24,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:24,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1699102099, now seen corresponding path program 1 times [2020-07-20 22:58:24,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:24,748 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [488156688] [2020-07-20 22:58:24,749 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:24,891 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 22:58:24,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:24,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 22:58:24,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:24,985 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 22:58:24,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:24,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [488156688] [2020-07-20 22:58:24,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:24,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:24,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284100069] [2020-07-20 22:58:24,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:24,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:24,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:24,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:24,987 INFO L87 Difference]: Start difference. First operand 1964 states and 2639 transitions. Second operand 3 states. [2020-07-20 22:58:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:25,074 INFO L93 Difference]: Finished difference Result 2993 states and 3985 transitions. [2020-07-20 22:58:25,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:25,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2020-07-20 22:58:25,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:25,089 INFO L225 Difference]: With dead ends: 2993 [2020-07-20 22:58:25,089 INFO L226 Difference]: Without dead ends: 1979 [2020-07-20 22:58:25,094 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 22:58:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2020-07-20 22:58:25,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1963. [2020-07-20 22:58:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2020-07-20 22:58:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2564 transitions. [2020-07-20 22:58:25,203 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2564 transitions. Word has length 193 [2020-07-20 22:58:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:25,203 INFO L479 AbstractCegarLoop]: Abstraction has 1963 states and 2564 transitions. [2020-07-20 22:58:25,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2564 transitions. [2020-07-20 22:58:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2020-07-20 22:58:25,214 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:25,215 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] [2020-07-20 22:58:25,428 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:25,429 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:25,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:25,429 INFO L82 PathProgramCache]: Analyzing trace with hash -123546328, now seen corresponding path program 1 times [2020-07-20 22:58:25,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:25,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1940463995] [2020-07-20 22:58:25,430 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:25,526 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:58:25,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:25,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 22:58:25,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2020-07-20 22:58:25,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:25,592 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1940463995] [2020-07-20 22:58:25,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:25,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:25,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833405061] [2020-07-20 22:58:25,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:25,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:25,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:25,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:25,594 INFO L87 Difference]: Start difference. First operand 1963 states and 2564 transitions. Second operand 3 states. [2020-07-20 22:58:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:25,714 INFO L93 Difference]: Finished difference Result 4124 states and 5420 transitions. [2020-07-20 22:58:25,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:25,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2020-07-20 22:58:25,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:25,728 INFO L225 Difference]: With dead ends: 4124 [2020-07-20 22:58:25,728 INFO L226 Difference]: Without dead ends: 2183 [2020-07-20 22:58:25,736 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 300 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 22:58:25,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2020-07-20 22:58:25,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1947. [2020-07-20 22:58:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2020-07-20 22:58:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2516 transitions. [2020-07-20 22:58:25,841 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2516 transitions. Word has length 302 [2020-07-20 22:58:25,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:25,842 INFO L479 AbstractCegarLoop]: Abstraction has 1947 states and 2516 transitions. [2020-07-20 22:58:25,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2516 transitions. [2020-07-20 22:58:25,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-07-20 22:58:25,849 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:25,850 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:58:26,063 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:26,064 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:26,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:26,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1310451636, now seen corresponding path program 1 times [2020-07-20 22:58:26,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:26,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1617939481] [2020-07-20 22:58:26,066 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:26,165 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 22:58:26,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:26,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 22:58:26,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-20 22:58:26,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:26,208 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1617939481] [2020-07-20 22:58:26,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:26,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:26,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315799224] [2020-07-20 22:58:26,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:26,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:26,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:26,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:26,210 INFO L87 Difference]: Start difference. First operand 1947 states and 2516 transitions. Second operand 3 states. [2020-07-20 22:58:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:26,353 INFO L93 Difference]: Finished difference Result 5703 states and 7628 transitions. [2020-07-20 22:58:26,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:26,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2020-07-20 22:58:26,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:26,379 INFO L225 Difference]: With dead ends: 5703 [2020-07-20 22:58:26,379 INFO L226 Difference]: Without dead ends: 3778 [2020-07-20 22:58:26,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 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 22:58:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2020-07-20 22:58:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 3754. [2020-07-20 22:58:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3754 states. [2020-07-20 22:58:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 4982 transitions. [2020-07-20 22:58:26,608 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 4982 transitions. Word has length 211 [2020-07-20 22:58:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:26,609 INFO L479 AbstractCegarLoop]: Abstraction has 3754 states and 4982 transitions. [2020-07-20 22:58:26,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 4982 transitions. [2020-07-20 22:58:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-07-20 22:58:26,623 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:26,623 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] [2020-07-20 22:58:26,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:26,838 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:26,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:26,839 INFO L82 PathProgramCache]: Analyzing trace with hash -913388980, now seen corresponding path program 1 times [2020-07-20 22:58:26,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:26,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1884917361] [2020-07-20 22:58:26,840 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:26,991 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 22:58:26,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:26,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 22:58:26,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2020-07-20 22:58:27,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:27,046 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1884917361] [2020-07-20 22:58:27,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:27,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 22:58:27,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920688780] [2020-07-20 22:58:27,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 22:58:27,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:27,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 22:58:27,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 22:58:27,048 INFO L87 Difference]: Start difference. First operand 3754 states and 4982 transitions. Second operand 5 states. [2020-07-20 22:58:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:27,740 INFO L93 Difference]: Finished difference Result 7999 states and 11487 transitions. [2020-07-20 22:58:27,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 22:58:27,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2020-07-20 22:58:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:27,790 INFO L225 Difference]: With dead ends: 7999 [2020-07-20 22:58:27,790 INFO L226 Difference]: Without dead ends: 4268 [2020-07-20 22:58:27,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 207 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 22:58:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2020-07-20 22:58:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 3966. [2020-07-20 22:58:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3966 states. [2020-07-20 22:58:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 5160 transitions. [2020-07-20 22:58:28,142 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 5160 transitions. Word has length 211 [2020-07-20 22:58:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:28,143 INFO L479 AbstractCegarLoop]: Abstraction has 3966 states and 5160 transitions. [2020-07-20 22:58:28,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 22:58:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 5160 transitions. [2020-07-20 22:58:28,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-07-20 22:58:28,157 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:28,157 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] [2020-07-20 22:58:28,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:28,372 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:28,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1810431176, now seen corresponding path program 1 times [2020-07-20 22:58:28,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:28,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1568077904] [2020-07-20 22:58:28,373 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:28,505 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 22:58:28,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:28,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 22:58:28,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2020-07-20 22:58:28,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:28,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1568077904] [2020-07-20 22:58:28,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:28,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 22:58:28,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591176879] [2020-07-20 22:58:28,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 22:58:28,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:28,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 22:58:28,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 22:58:28,562 INFO L87 Difference]: Start difference. First operand 3966 states and 5160 transitions. Second operand 5 states. [2020-07-20 22:58:29,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:29,107 INFO L93 Difference]: Finished difference Result 7909 states and 10368 transitions. [2020-07-20 22:58:29,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 22:58:29,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2020-07-20 22:58:29,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:29,133 INFO L225 Difference]: With dead ends: 7909 [2020-07-20 22:58:29,133 INFO L226 Difference]: Without dead ends: 3966 [2020-07-20 22:58:29,150 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 207 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 22:58:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2020-07-20 22:58:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3966. [2020-07-20 22:58:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3966 states. [2020-07-20 22:58:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 5088 transitions. [2020-07-20 22:58:29,350 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 5088 transitions. Word has length 211 [2020-07-20 22:58:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:29,351 INFO L479 AbstractCegarLoop]: Abstraction has 3966 states and 5088 transitions. [2020-07-20 22:58:29,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 22:58:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 5088 transitions. [2020-07-20 22:58:29,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-07-20 22:58:29,364 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:29,365 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] [2020-07-20 22:58:29,579 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:29,580 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:29,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:29,580 INFO L82 PathProgramCache]: Analyzing trace with hash 349510092, now seen corresponding path program 1 times [2020-07-20 22:58:29,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:29,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1534792540] [2020-07-20 22:58:29,581 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:29,697 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 22:58:29,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:29,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 22:58:29,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2020-07-20 22:58:29,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:29,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1534792540] [2020-07-20 22:58:29,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:29,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 22:58:29,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511413580] [2020-07-20 22:58:29,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 22:58:29,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:29,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 22:58:29,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 22:58:29,763 INFO L87 Difference]: Start difference. First operand 3966 states and 5088 transitions. Second operand 5 states. [2020-07-20 22:58:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:30,353 INFO L93 Difference]: Finished difference Result 7909 states and 10224 transitions. [2020-07-20 22:58:30,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 22:58:30,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2020-07-20 22:58:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:30,391 INFO L225 Difference]: With dead ends: 7909 [2020-07-20 22:58:30,392 INFO L226 Difference]: Without dead ends: 3966 [2020-07-20 22:58:30,403 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 207 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 22:58:30,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2020-07-20 22:58:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3966. [2020-07-20 22:58:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3966 states. [2020-07-20 22:58:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 5016 transitions. [2020-07-20 22:58:30,595 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 5016 transitions. Word has length 211 [2020-07-20 22:58:30,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:30,596 INFO L479 AbstractCegarLoop]: Abstraction has 3966 states and 5016 transitions. [2020-07-20 22:58:30,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 22:58:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 5016 transitions. [2020-07-20 22:58:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-07-20 22:58:30,609 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:30,609 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] [2020-07-20 22:58:30,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:30,825 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:30,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:30,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1724723062, now seen corresponding path program 1 times [2020-07-20 22:58:30,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:30,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [579430336] [2020-07-20 22:58:30,827 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:30,941 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 22:58:30,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:30,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 22:58:30,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2020-07-20 22:58:30,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:30,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [579430336] [2020-07-20 22:58:30,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:30,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 22:58:30,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284352053] [2020-07-20 22:58:30,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 22:58:30,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:30,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 22:58:30,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 22:58:31,000 INFO L87 Difference]: Start difference. First operand 3966 states and 5016 transitions. Second operand 5 states. [2020-07-20 22:58:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:31,797 INFO L93 Difference]: Finished difference Result 8633 states and 11639 transitions. [2020-07-20 22:58:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 22:58:31,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2020-07-20 22:58:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:31,824 INFO L225 Difference]: With dead ends: 8633 [2020-07-20 22:58:31,825 INFO L226 Difference]: Without dead ends: 4690 [2020-07-20 22:58:31,844 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 207 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 22:58:31,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4690 states. [2020-07-20 22:58:32,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4690 to 4450. [2020-07-20 22:58:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4450 states. [2020-07-20 22:58:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4450 states to 4450 states and 5574 transitions. [2020-07-20 22:58:32,093 INFO L78 Accepts]: Start accepts. Automaton has 4450 states and 5574 transitions. Word has length 211 [2020-07-20 22:58:32,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:32,093 INFO L479 AbstractCegarLoop]: Abstraction has 4450 states and 5574 transitions. [2020-07-20 22:58:32,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 22:58:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 4450 states and 5574 transitions. [2020-07-20 22:58:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-07-20 22:58:32,109 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:32,109 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] [2020-07-20 22:58:32,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:32,324 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:32,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:32,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1017018370, now seen corresponding path program 1 times [2020-07-20 22:58:32,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:32,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1883702295] [2020-07-20 22:58:32,325 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:32,402 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:58:32,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:32,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 22:58:32,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-20 22:58:32,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:32,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1883702295] [2020-07-20 22:58:32,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:32,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:32,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073390303] [2020-07-20 22:58:32,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:32,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:32,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:32,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:32,443 INFO L87 Difference]: Start difference. First operand 4450 states and 5574 transitions. Second operand 3 states. [2020-07-20 22:58:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:32,565 INFO L93 Difference]: Finished difference Result 6867 states and 8950 transitions. [2020-07-20 22:58:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:32,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2020-07-20 22:58:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:32,585 INFO L225 Difference]: With dead ends: 6867 [2020-07-20 22:58:32,585 INFO L226 Difference]: Without dead ends: 4454 [2020-07-20 22:58:32,594 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 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 22:58:32,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2020-07-20 22:58:33,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4440. [2020-07-20 22:58:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4440 states. [2020-07-20 22:58:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 5497 transitions. [2020-07-20 22:58:33,248 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 5497 transitions. Word has length 211 [2020-07-20 22:58:33,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:33,249 INFO L479 AbstractCegarLoop]: Abstraction has 4440 states and 5497 transitions. [2020-07-20 22:58:33,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:33,249 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 5497 transitions. [2020-07-20 22:58:33,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-07-20 22:58:33,262 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:33,263 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 22:58:33,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:33,477 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:33,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:33,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1548832364, now seen corresponding path program 1 times [2020-07-20 22:58:33,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:33,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [786006286] [2020-07-20 22:58:33,479 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:33,542 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 22:58:33,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:33,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 22:58:33,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:33,585 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-20 22:58:33,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:33,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [786006286] [2020-07-20 22:58:33,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:33,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:33,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739211750] [2020-07-20 22:58:33,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:33,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:33,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:33,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:33,587 INFO L87 Difference]: Start difference. First operand 4440 states and 5497 transitions. Second operand 3 states. [2020-07-20 22:58:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:33,867 INFO L93 Difference]: Finished difference Result 11787 states and 15103 transitions. [2020-07-20 22:58:33,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:33,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-07-20 22:58:33,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:33,908 INFO L225 Difference]: With dead ends: 11787 [2020-07-20 22:58:33,908 INFO L226 Difference]: Without dead ends: 7374 [2020-07-20 22:58:33,926 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 22:58:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7374 states. [2020-07-20 22:58:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7374 to 7370. [2020-07-20 22:58:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7370 states. [2020-07-20 22:58:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7370 states to 7370 states and 9125 transitions. [2020-07-20 22:58:34,520 INFO L78 Accepts]: Start accepts. Automaton has 7370 states and 9125 transitions. Word has length 212 [2020-07-20 22:58:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:34,521 INFO L479 AbstractCegarLoop]: Abstraction has 7370 states and 9125 transitions. [2020-07-20 22:58:34,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 7370 states and 9125 transitions. [2020-07-20 22:58:34,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-07-20 22:58:34,543 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:34,543 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] [2020-07-20 22:58:34,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:34,759 INFO L427 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:34,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:34,759 INFO L82 PathProgramCache]: Analyzing trace with hash -75101762, now seen corresponding path program 1 times [2020-07-20 22:58:34,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:34,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2132099368] [2020-07-20 22:58:34,760 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:34,834 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:58:34,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:34,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 22:58:34,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:34,870 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 22:58:34,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:34,870 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2132099368] [2020-07-20 22:58:34,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:34,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:34,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755295997] [2020-07-20 22:58:34,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:34,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:34,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:34,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:34,872 INFO L87 Difference]: Start difference. First operand 7370 states and 9125 transitions. Second operand 3 states. [2020-07-20 22:58:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:35,114 INFO L93 Difference]: Finished difference Result 13129 states and 17010 transitions. [2020-07-20 22:58:35,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:35,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-07-20 22:58:35,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:35,148 INFO L225 Difference]: With dead ends: 13129 [2020-07-20 22:58:35,148 INFO L226 Difference]: Without dead ends: 7270 [2020-07-20 22:58:35,166 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 22:58:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7270 states. [2020-07-20 22:58:35,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7270 to 7254. [2020-07-20 22:58:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7254 states. [2020-07-20 22:58:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7254 states to 7254 states and 8889 transitions. [2020-07-20 22:58:35,534 INFO L78 Accepts]: Start accepts. Automaton has 7254 states and 8889 transitions. Word has length 212 [2020-07-20 22:58:35,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:35,535 INFO L479 AbstractCegarLoop]: Abstraction has 7254 states and 8889 transitions. [2020-07-20 22:58:35,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 7254 states and 8889 transitions. [2020-07-20 22:58:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2020-07-20 22:58:35,553 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:35,553 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 22:58:35,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:35,768 INFO L427 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:35,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:35,769 INFO L82 PathProgramCache]: Analyzing trace with hash 573363623, now seen corresponding path program 1 times [2020-07-20 22:58:35,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:35,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [430258912] [2020-07-20 22:58:35,770 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:35,853 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 22:58:35,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:35,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 22:58:35,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:36,025 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 22:58:36,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:36,025 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [430258912] [2020-07-20 22:58:36,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:36,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:36,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424134095] [2020-07-20 22:58:36,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:36,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:36,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:36,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:36,027 INFO L87 Difference]: Start difference. First operand 7254 states and 8889 transitions. Second operand 3 states. [2020-07-20 22:58:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:36,192 INFO L93 Difference]: Finished difference Result 12877 states and 15736 transitions. [2020-07-20 22:58:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:36,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2020-07-20 22:58:36,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:36,219 INFO L225 Difference]: With dead ends: 12877 [2020-07-20 22:58:36,219 INFO L226 Difference]: Without dead ends: 5649 [2020-07-20 22:58:36,235 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 22:58:36,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5649 states. [2020-07-20 22:58:36,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5649 to 5627. [2020-07-20 22:58:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5627 states. [2020-07-20 22:58:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5627 states to 5627 states and 6822 transitions. [2020-07-20 22:58:36,525 INFO L78 Accepts]: Start accepts. Automaton has 5627 states and 6822 transitions. Word has length 306 [2020-07-20 22:58:36,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:36,526 INFO L479 AbstractCegarLoop]: Abstraction has 5627 states and 6822 transitions. [2020-07-20 22:58:36,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 5627 states and 6822 transitions. [2020-07-20 22:58:36,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-20 22:58:36,542 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:36,542 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 22:58:36,756 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:36,757 INFO L427 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:36,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:36,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1093996489, now seen corresponding path program 1 times [2020-07-20 22:58:36,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:36,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1484374984] [2020-07-20 22:58:36,758 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:36,832 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:58:36,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:36,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 22:58:36,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-07-20 22:58:36,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:36,890 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1484374984] [2020-07-20 22:58:36,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:36,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 22:58:36,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643426547] [2020-07-20 22:58:36,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 22:58:36,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:36,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 22:58:36,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 22:58:36,891 INFO L87 Difference]: Start difference. First operand 5627 states and 6822 transitions. Second operand 6 states. [2020-07-20 22:58:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:37,230 INFO L93 Difference]: Finished difference Result 10555 states and 13222 transitions. [2020-07-20 22:58:37,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 22:58:37,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2020-07-20 22:58:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:37,258 INFO L225 Difference]: With dead ends: 10555 [2020-07-20 22:58:37,258 INFO L226 Difference]: Without dead ends: 4954 [2020-07-20 22:58:37,275 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 208 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 22:58:37,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4954 states. [2020-07-20 22:58:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4954 to 4954. [2020-07-20 22:58:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4954 states. [2020-07-20 22:58:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 5878 transitions. [2020-07-20 22:58:37,632 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 5878 transitions. Word has length 213 [2020-07-20 22:58:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:37,633 INFO L479 AbstractCegarLoop]: Abstraction has 4954 states and 5878 transitions. [2020-07-20 22:58:37,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 22:58:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 5878 transitions. [2020-07-20 22:58:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-20 22:58:37,647 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:37,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, 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 22:58:37,862 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:37,863 INFO L427 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:37,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:37,864 INFO L82 PathProgramCache]: Analyzing trace with hash 955922024, now seen corresponding path program 1 times [2020-07-20 22:58:37,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:37,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [386475655] [2020-07-20 22:58:37,865 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:37,974 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:58:37,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:37,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 22:58:37,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-07-20 22:58:38,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:38,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [386475655] [2020-07-20 22:58:38,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:38,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 22:58:38,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920710466] [2020-07-20 22:58:38,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 22:58:38,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:38,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 22:58:38,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 22:58:38,061 INFO L87 Difference]: Start difference. First operand 4954 states and 5878 transitions. Second operand 6 states. [2020-07-20 22:58:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:38,228 INFO L93 Difference]: Finished difference Result 7288 states and 8730 transitions. [2020-07-20 22:58:38,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 22:58:38,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2020-07-20 22:58:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:38,237 INFO L225 Difference]: With dead ends: 7288 [2020-07-20 22:58:38,237 INFO L226 Difference]: Without dead ends: 1134 [2020-07-20 22:58:38,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 208 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 22:58:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2020-07-20 22:58:38,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1133. [2020-07-20 22:58:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2020-07-20 22:58:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1281 transitions. [2020-07-20 22:58:38,314 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1281 transitions. Word has length 213 [2020-07-20 22:58:38,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:38,314 INFO L479 AbstractCegarLoop]: Abstraction has 1133 states and 1281 transitions. [2020-07-20 22:58:38,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 22:58:38,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1281 transitions. [2020-07-20 22:58:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2020-07-20 22:58:38,320 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:38,321 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 22:58:38,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:38,536 INFO L427 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:38,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:38,536 INFO L82 PathProgramCache]: Analyzing trace with hash 762071463, now seen corresponding path program 1 times [2020-07-20 22:58:38,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:38,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [51309295] [2020-07-20 22:58:38,536 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:38,679 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 22:58:38,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:38,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 22:58:38,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2020-07-20 22:58:38,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:38,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [51309295] [2020-07-20 22:58:38,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:38,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 22:58:38,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828633224] [2020-07-20 22:58:38,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 22:58:38,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:38,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 22:58:38,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 22:58:38,751 INFO L87 Difference]: Start difference. First operand 1133 states and 1281 transitions. Second operand 5 states. [2020-07-20 22:58:39,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:39,529 INFO L93 Difference]: Finished difference Result 3557 states and 4124 transitions. [2020-07-20 22:58:39,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 22:58:39,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 267 [2020-07-20 22:58:39,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:39,544 INFO L225 Difference]: With dead ends: 3557 [2020-07-20 22:58:39,545 INFO L226 Difference]: Without dead ends: 2444 [2020-07-20 22:58:39,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 263 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 22:58:39,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2020-07-20 22:58:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2240. [2020-07-20 22:58:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2240 states. [2020-07-20 22:58:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 2501 transitions. [2020-07-20 22:58:39,786 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 2501 transitions. Word has length 267 [2020-07-20 22:58:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:39,787 INFO L479 AbstractCegarLoop]: Abstraction has 2240 states and 2501 transitions. [2020-07-20 22:58:39,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 22:58:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2501 transitions. [2020-07-20 22:58:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2020-07-20 22:58:39,794 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:39,795 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 22:58:40,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:40,010 INFO L427 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:40,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:40,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1504425340, now seen corresponding path program 1 times [2020-07-20 22:58:40,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:40,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1073695969] [2020-07-20 22:58:40,012 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:40,114 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:58:40,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:40,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 22:58:40,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2020-07-20 22:58:40,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:40,200 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1073695969] [2020-07-20 22:58:40,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:40,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:40,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639702402] [2020-07-20 22:58:40,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:40,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:40,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:40,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:40,201 INFO L87 Difference]: Start difference. First operand 2240 states and 2501 transitions. Second operand 3 states. [2020-07-20 22:58:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:40,286 INFO L93 Difference]: Finished difference Result 4454 states and 5052 transitions. [2020-07-20 22:58:40,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:40,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2020-07-20 22:58:40,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:40,295 INFO L225 Difference]: With dead ends: 4454 [2020-07-20 22:58:40,295 INFO L226 Difference]: Without dead ends: 2236 [2020-07-20 22:58:40,300 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 370 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 22:58:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2020-07-20 22:58:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2236. [2020-07-20 22:58:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2236 states. [2020-07-20 22:58:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2483 transitions. [2020-07-20 22:58:40,415 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2483 transitions. Word has length 372 [2020-07-20 22:58:40,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:40,416 INFO L479 AbstractCegarLoop]: Abstraction has 2236 states and 2483 transitions. [2020-07-20 22:58:40,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2483 transitions. [2020-07-20 22:58:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2020-07-20 22:58:40,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:40,423 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:58:40,636 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:40,637 INFO L427 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:40,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:40,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1630965675, now seen corresponding path program 1 times [2020-07-20 22:58:40,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:40,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1509139176] [2020-07-20 22:58:40,638 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:40,740 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 22:58:40,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:40,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-20 22:58:40,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2020-07-20 22:58:40,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:40,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1509139176] [2020-07-20 22:58:40,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:40,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 22:58:40,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041163324] [2020-07-20 22:58:40,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 22:58:40,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:40,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 22:58:40,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 22:58:40,847 INFO L87 Difference]: Start difference. First operand 2236 states and 2483 transitions. Second operand 6 states. [2020-07-20 22:58:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:40,928 INFO L93 Difference]: Finished difference Result 3131 states and 3506 transitions. [2020-07-20 22:58:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 22:58:40,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 361 [2020-07-20 22:58:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:40,932 INFO L225 Difference]: With dead ends: 3131 [2020-07-20 22:58:40,932 INFO L226 Difference]: Without dead ends: 917 [2020-07-20 22:58:40,936 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 356 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 22:58:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2020-07-20 22:58:40,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 836. [2020-07-20 22:58:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2020-07-20 22:58:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 899 transitions. [2020-07-20 22:58:40,980 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 899 transitions. Word has length 361 [2020-07-20 22:58:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:40,980 INFO L479 AbstractCegarLoop]: Abstraction has 836 states and 899 transitions. [2020-07-20 22:58:40,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 22:58:40,981 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 899 transitions. [2020-07-20 22:58:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2020-07-20 22:58:40,985 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:40,985 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 22:58:41,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:41,201 INFO L427 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:41,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:41,201 INFO L82 PathProgramCache]: Analyzing trace with hash -373872983, now seen corresponding path program 1 times [2020-07-20 22:58:41,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:41,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [723217075] [2020-07-20 22:58:41,202 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:41,366 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 22:58:41,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:41,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-20 22:58:41,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:41,506 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 22:58:41,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 22:58:41,973 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 22:58:41,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [723217075] [2020-07-20 22:58:41,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 22:58:41,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 11 [2020-07-20 22:58:41,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616505098] [2020-07-20 22:58:41,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 22:58:41,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:41,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 22:58:41,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-20 22:58:41,977 INFO L87 Difference]: Start difference. First operand 836 states and 899 transitions. Second operand 9 states. [2020-07-20 22:58:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:43,028 INFO L93 Difference]: Finished difference Result 870 states and 945 transitions. [2020-07-20 22:58:43,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 22:58:43,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 267 [2020-07-20 22:58:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:43,032 INFO L225 Difference]: With dead ends: 870 [2020-07-20 22:58:43,032 INFO L226 Difference]: Without dead ends: 867 [2020-07-20 22:58:43,033 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 528 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2020-07-20 22:58:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2020-07-20 22:58:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 835. [2020-07-20 22:58:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2020-07-20 22:58:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 896 transitions. [2020-07-20 22:58:43,097 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 896 transitions. Word has length 267 [2020-07-20 22:58:43,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:43,098 INFO L479 AbstractCegarLoop]: Abstraction has 835 states and 896 transitions. [2020-07-20 22:58:43,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 22:58:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 896 transitions. [2020-07-20 22:58:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2020-07-20 22:58:43,101 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:43,102 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 22:58:43,315 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:43,316 INFO L427 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:43,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:43,316 INFO L82 PathProgramCache]: Analyzing trace with hash -271251823, now seen corresponding path program 1 times [2020-07-20 22:58:43,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:43,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [488329967] [2020-07-20 22:58:43,317 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:43,451 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 22:58:43,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 22:58:43,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 22:58:43,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 22:58:43,517 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 22:58:43,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 22:58:43,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [488329967] [2020-07-20 22:58:43,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 22:58:43,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 22:58:43,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594874729] [2020-07-20 22:58:43,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 22:58:43,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 22:58:43,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 22:58:43,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 22:58:43,519 INFO L87 Difference]: Start difference. First operand 835 states and 896 transitions. Second operand 3 states. [2020-07-20 22:58:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 22:58:43,572 INFO L93 Difference]: Finished difference Result 1420 states and 1532 transitions. [2020-07-20 22:58:43,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 22:58:43,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2020-07-20 22:58:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 22:58:43,576 INFO L225 Difference]: With dead ends: 1420 [2020-07-20 22:58:43,576 INFO L226 Difference]: Without dead ends: 849 [2020-07-20 22:58:43,577 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 22:58:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2020-07-20 22:58:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 843. [2020-07-20 22:58:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2020-07-20 22:58:43,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 905 transitions. [2020-07-20 22:58:43,625 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 905 transitions. Word has length 271 [2020-07-20 22:58:43,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 22:58:43,625 INFO L479 AbstractCegarLoop]: Abstraction has 843 states and 905 transitions. [2020-07-20 22:58:43,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 22:58:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 905 transitions. [2020-07-20 22:58:43,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-07-20 22:58:43,628 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 22:58:43,628 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 22:58:43,843 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:43,844 INFO L427 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 22:58:43,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 22:58:43,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1410375831, now seen corresponding path program 1 times [2020-07-20 22:58:43,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 22:58:43,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [45732829] [2020-07-20 22:58:43,845 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) 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 22:58:44,002 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 22:58:44,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-20 22:58:44,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 22:58:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 22:58:44,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 22:58:44,413 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-20 22:58:44,414 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 22:58:44,626 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 22:58:44,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 10:58:44 BoogieIcfgContainer [2020-07-20 22:58:44,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 22:58:44,872 INFO L168 Benchmark]: Toolchain (without parser) took 26494.91 ms. Allocated memory was 142.6 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 100.3 MB in the beginning and 383.9 MB in the end (delta: -283.6 MB). Peak memory consumption was 735.6 MB. Max. memory is 7.1 GB. [2020-07-20 22:58:44,872 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 142.6 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-20 22:58:44,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 557.89 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 99.8 MB in the beginning and 176.7 MB in the end (delta: -76.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2020-07-20 22:58:44,873 INFO L168 Benchmark]: Boogie Preprocessor took 51.05 ms. Allocated memory is still 199.8 MB. Free memory was 176.7 MB in the beginning and 174.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-07-20 22:58:44,873 INFO L168 Benchmark]: RCFGBuilder took 682.58 ms. Allocated memory is still 199.8 MB. Free memory was 173.4 MB in the beginning and 134.8 MB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB. [2020-07-20 22:58:44,874 INFO L168 Benchmark]: TraceAbstraction took 25196.79 ms. Allocated memory was 199.8 MB in the beginning and 1.2 GB in the end (delta: 962.1 MB). Free memory was 134.0 MB in the beginning and 383.9 MB in the end (delta: -249.9 MB). Peak memory consumption was 712.2 MB. Max. memory is 7.1 GB. [2020-07-20 22:58:44,875 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.53 ms. Allocated memory is still 142.6 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 557.89 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 99.8 MB in the beginning and 176.7 MB in the end (delta: -76.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.05 ms. Allocated memory is still 199.8 MB. Free memory was 176.7 MB in the beginning and 174.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 682.58 ms. Allocated memory is still 199.8 MB. Free memory was 173.4 MB in the beginning and 134.8 MB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25196.79 ms. Allocated memory was 199.8 MB in the beginning and 1.2 GB in the end (delta: 962.1 MB). Free memory was 134.0 MB in the beginning and 383.9 MB in the end (delta: -249.9 MB). Peak memory consumption was 712.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)=4, \old(E_M)=16, \old(local)=9, \old(M_E)=8, \old(m_i)=20, \old(m_pc)=6, \old(m_st)=11, \old(T1_E)=19, \old(t1_i)=15, \old(t1_pc)=12, \old(t1_st)=14, \old(T2_E)=10, \old(t2_i)=13, \old(t2_pc)=17, \old(t2_st)=7, \old(token)=3, 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: 24.8s, OverallIterations: 28, TraceHistogramMax: 7, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7327 SDtfs, 5134 SDslu, 8704 SDs, 0 SdLazy, 2372 SolverSat, 892 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6056 GetRequests, 5968 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7370occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 1244 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 6063 NumberOfCodeBlocks, 3452 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 6030 ConstructedInterpolants, 0 QuantifiedInterpolants, 1781758 SizeOfPredicates, 31 NumberOfNonLiveVariables, 12628 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 28 InterpolantComputations, 27 PerfectInterpolantSequences, 4532/4598 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...