/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_VARIABLES --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -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-79ed534 [2020-07-20 02:04:14,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 02:04:14,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 02:04:14,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 02:04:14,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 02:04:14,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 02:04:14,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 02:04:14,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 02:04:14,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 02:04:14,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 02:04:14,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 02:04:14,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 02:04:14,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 02:04:14,474 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 02:04:14,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 02:04:14,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 02:04:14,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 02:04:14,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 02:04:14,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 02:04:14,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 02:04:14,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 02:04:14,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 02:04:14,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 02:04:14,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 02:04:14,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 02:04:14,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 02:04:14,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 02:04:14,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 02:04:14,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 02:04:14,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 02:04:14,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 02:04:14,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 02:04:14,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 02:04:14,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 02:04:14,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 02:04:14,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 02:04:14,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 02:04:14,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 02:04:14,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 02:04:14,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 02:04:14,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 02:04:14,516 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 02:04:14,548 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 02:04:14,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 02:04:14,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 02:04:14,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 02:04:14,551 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 02:04:14,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 02:04:14,551 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 02:04:14,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 02:04:14,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 02:04:14,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 02:04:14,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 02:04:14,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 02:04:14,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 02:04:14,554 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 02:04:14,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 02:04:14,554 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 02:04:14,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 02:04:14,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 02:04:14,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 02:04:14,555 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 02:04:14,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 02:04:14,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 02:04:14,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 02:04:14,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 02:04:14,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 02:04:14,556 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 02:04:14,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 02:04:14,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 02:04:14,557 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 02:04:14,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_VARIABLES 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 02:04:14,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 02:04:14,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 02:04:14,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 02:04:14,868 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 02:04:14,869 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 02:04:14,869 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 02:04:14,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94aebd28f/7092ae4937e74c3c86da6c236174a88e/FLAG8b99df376 [2020-07-20 02:04:15,432 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 02:04:15,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-07-20 02:04:15,443 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94aebd28f/7092ae4937e74c3c86da6c236174a88e/FLAG8b99df376 [2020-07-20 02:04:15,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94aebd28f/7092ae4937e74c3c86da6c236174a88e [2020-07-20 02:04:15,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 02:04:15,806 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 02:04:15,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 02:04:15,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 02:04:15,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 02:04:15,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:04:15" (1/1) ... [2020-07-20 02:04:15,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ec8aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:15, skipping insertion in model container [2020-07-20 02:04:15,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:04:15" (1/1) ... [2020-07-20 02:04:15,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 02:04:15,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 02:04:16,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 02:04:16,126 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 02:04:16,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 02:04:16,289 INFO L208 MainTranslator]: Completed translation [2020-07-20 02:04:16,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:16 WrapperNode [2020-07-20 02:04:16,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 02:04:16,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 02:04:16,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 02:04:16,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 02:04:16,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:16" (1/1) ... [2020-07-20 02:04:16,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:16" (1/1) ... [2020-07-20 02:04:16,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:16" (1/1) ... [2020-07-20 02:04:16,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:16" (1/1) ... [2020-07-20 02:04:16,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:16" (1/1) ... [2020-07-20 02:04:16,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:16" (1/1) ... [2020-07-20 02:04:16,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:16" (1/1) ... [2020-07-20 02:04:16,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 02:04:16,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 02:04:16,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 02:04:16,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 02:04:16,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 02:04:16,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 02:04:16,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 02:04:16,427 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 02:04:16,427 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-20 02:04:16,427 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-20 02:04:16,427 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-07-20 02:04:16,427 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-20 02:04:16,428 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-20 02:04:16,428 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-07-20 02:04:16,428 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 02:04:16,428 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 02:04:16,428 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 02:04:16,428 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 02:04:16,429 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 02:04:16,429 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 02:04:16,429 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 02:04:16,429 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-20 02:04:16,429 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 02:04:16,429 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 02:04:16,430 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 02:04:16,430 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 02:04:16,430 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 02:04:16,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 02:04:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 02:04:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 02:04:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-20 02:04:16,431 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-20 02:04:16,431 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-07-20 02:04:16,431 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-20 02:04:16,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 02:04:16,431 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-20 02:04:16,431 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-20 02:04:16,432 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-07-20 02:04:16,432 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 02:04:16,432 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 02:04:16,432 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 02:04:16,432 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 02:04:16,432 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 02:04:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 02:04:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 02:04:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 02:04:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 02:04:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 02:04:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 02:04:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 02:04:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 02:04:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 02:04:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 02:04:17,070 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 02:04:17,071 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-20 02:04:17,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:04:17 BoogieIcfgContainer [2020-07-20 02:04:17,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 02:04:17,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 02:04:17,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 02:04:17,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 02:04:17,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 02:04:15" (1/3) ... [2020-07-20 02:04:17,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193e57c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:04:17, skipping insertion in model container [2020-07-20 02:04:17,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:04:16" (2/3) ... [2020-07-20 02:04:17,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193e57c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:04:17, skipping insertion in model container [2020-07-20 02:04:17,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:04:17" (3/3) ... [2020-07-20 02:04:17,086 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-07-20 02:04:17,098 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 02:04:17,106 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 02:04:17,118 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 02:04:17,141 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 02:04:17,141 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 02:04:17,141 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 02:04:17,142 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 02:04:17,142 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 02:04:17,142 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 02:04:17,142 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 02:04:17,142 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 02:04:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2020-07-20 02:04:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-20 02:04:17,177 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:17,178 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 02:04:17,179 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:17,185 INFO L82 PathProgramCache]: Analyzing trace with hash -67309704, now seen corresponding path program 1 times [2020-07-20 02:04:17,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:17,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369062030] [2020-07-20 02:04:17,196 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:04:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:17,971 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 02:04:17,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369062030] [2020-07-20 02:04:17,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:17,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-20 02:04:17,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611243097] [2020-07-20 02:04:17,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-20 02:04:17,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:17,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-20 02:04:17,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-07-20 02:04:18,000 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 14 states. [2020-07-20 02:04:20,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:20,889 INFO L93 Difference]: Finished difference Result 449 states and 710 transitions. [2020-07-20 02:04:20,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-20 02:04:20,892 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2020-07-20 02:04:20,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:20,924 INFO L225 Difference]: With dead ends: 449 [2020-07-20 02:04:20,924 INFO L226 Difference]: Without dead ends: 276 [2020-07-20 02:04:20,937 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2020-07-20 02:04:20,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-07-20 02:04:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 177. [2020-07-20 02:04:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-20 02:04:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 237 transitions. [2020-07-20 02:04:21,022 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 237 transitions. Word has length 92 [2020-07-20 02:04:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:21,023 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 237 transitions. [2020-07-20 02:04:21,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-20 02:04:21,023 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 237 transitions. [2020-07-20 02:04:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-20 02:04:21,028 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:21,029 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 02:04:21,029 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 02:04:21,029 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:21,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:21,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2098275908, now seen corresponding path program 1 times [2020-07-20 02:04:21,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:21,030 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623371963] [2020-07-20 02:04:21,031 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:04:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:21,257 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 02:04:21,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623371963] [2020-07-20 02:04:21,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:21,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:21,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029255377] [2020-07-20 02:04:21,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:21,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:21,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:21,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:21,261 INFO L87 Difference]: Start difference. First operand 177 states and 237 transitions. Second operand 10 states. [2020-07-20 02:04:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:22,810 INFO L93 Difference]: Finished difference Result 425 states and 610 transitions. [2020-07-20 02:04:22,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 02:04:22,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-20 02:04:22,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:22,816 INFO L225 Difference]: With dead ends: 425 [2020-07-20 02:04:22,820 INFO L226 Difference]: Without dead ends: 268 [2020-07-20 02:04:22,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-07-20 02:04:22,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-07-20 02:04:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 177. [2020-07-20 02:04:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-20 02:04:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2020-07-20 02:04:22,900 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 92 [2020-07-20 02:04:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:22,901 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2020-07-20 02:04:22,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2020-07-20 02:04:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-20 02:04:22,915 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:22,916 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 02:04:22,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 02:04:22,916 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:22,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1653808840, now seen corresponding path program 1 times [2020-07-20 02:04:22,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:22,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943397801] [2020-07-20 02:04:22,918 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:04:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:23,185 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 02:04:23,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943397801] [2020-07-20 02:04:23,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:23,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:23,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368095529] [2020-07-20 02:04:23,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:23,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:23,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:23,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:23,189 INFO L87 Difference]: Start difference. First operand 177 states and 234 transitions. Second operand 10 states. [2020-07-20 02:04:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:25,264 INFO L93 Difference]: Finished difference Result 504 states and 747 transitions. [2020-07-20 02:04:25,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 02:04:25,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-20 02:04:25,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:25,275 INFO L225 Difference]: With dead ends: 504 [2020-07-20 02:04:25,276 INFO L226 Difference]: Without dead ends: 347 [2020-07-20 02:04:25,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-07-20 02:04:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-07-20 02:04:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 213. [2020-07-20 02:04:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-07-20 02:04:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 274 transitions. [2020-07-20 02:04:25,333 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 274 transitions. Word has length 92 [2020-07-20 02:04:25,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:25,333 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 274 transitions. [2020-07-20 02:04:25,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 274 transitions. [2020-07-20 02:04:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-20 02:04:25,335 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:25,336 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 02:04:25,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 02:04:25,336 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:25,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash -550041895, now seen corresponding path program 1 times [2020-07-20 02:04:25,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:25,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249343575] [2020-07-20 02:04:25,337 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:04:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:25,574 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 02:04:25,575 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249343575] [2020-07-20 02:04:25,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:25,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:25,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83125876] [2020-07-20 02:04:25,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:25,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:25,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:25,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:25,580 INFO L87 Difference]: Start difference. First operand 213 states and 274 transitions. Second operand 10 states. [2020-07-20 02:04:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:27,552 INFO L93 Difference]: Finished difference Result 586 states and 840 transitions. [2020-07-20 02:04:27,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 02:04:27,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-20 02:04:27,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:27,562 INFO L225 Difference]: With dead ends: 586 [2020-07-20 02:04:27,562 INFO L226 Difference]: Without dead ends: 393 [2020-07-20 02:04:27,565 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2020-07-20 02:04:27,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-07-20 02:04:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 249. [2020-07-20 02:04:27,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2020-07-20 02:04:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 312 transitions. [2020-07-20 02:04:27,627 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 312 transitions. Word has length 92 [2020-07-20 02:04:27,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:27,628 INFO L479 AbstractCegarLoop]: Abstraction has 249 states and 312 transitions. [2020-07-20 02:04:27,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 312 transitions. [2020-07-20 02:04:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-20 02:04:27,632 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:27,633 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 02:04:27,639 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 02:04:27,639 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:27,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:27,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1219969707, now seen corresponding path program 1 times [2020-07-20 02:04:27,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:27,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683199331] [2020-07-20 02:04:27,642 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:04:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:27,836 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 02:04:27,836 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683199331] [2020-07-20 02:04:27,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:27,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:27,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128231798] [2020-07-20 02:04:27,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:27,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:27,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:27,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:27,840 INFO L87 Difference]: Start difference. First operand 249 states and 312 transitions. Second operand 10 states. [2020-07-20 02:04:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:29,794 INFO L93 Difference]: Finished difference Result 663 states and 922 transitions. [2020-07-20 02:04:29,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 02:04:29,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-20 02:04:29,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:29,799 INFO L225 Difference]: With dead ends: 663 [2020-07-20 02:04:29,800 INFO L226 Difference]: Without dead ends: 434 [2020-07-20 02:04:29,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-07-20 02:04:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-07-20 02:04:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 282. [2020-07-20 02:04:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-07-20 02:04:29,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 345 transitions. [2020-07-20 02:04:29,835 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 345 transitions. Word has length 92 [2020-07-20 02:04:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:29,835 INFO L479 AbstractCegarLoop]: Abstraction has 282 states and 345 transitions. [2020-07-20 02:04:29,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:29,835 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 345 transitions. [2020-07-20 02:04:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-20 02:04:29,837 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:29,837 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 02:04:29,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 02:04:29,837 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:29,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:29,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1929357560, now seen corresponding path program 1 times [2020-07-20 02:04:29,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:29,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767142869] [2020-07-20 02:04:29,838 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:04:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:30,095 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 02:04:30,096 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767142869] [2020-07-20 02:04:30,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:30,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:30,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785118682] [2020-07-20 02:04:30,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:30,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:30,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:30,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:30,099 INFO L87 Difference]: Start difference. First operand 282 states and 345 transitions. Second operand 10 states. [2020-07-20 02:04:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:32,002 INFO L93 Difference]: Finished difference Result 674 states and 877 transitions. [2020-07-20 02:04:32,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 02:04:32,003 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-20 02:04:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:32,007 INFO L225 Difference]: With dead ends: 674 [2020-07-20 02:04:32,008 INFO L226 Difference]: Without dead ends: 413 [2020-07-20 02:04:32,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-07-20 02:04:32,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-07-20 02:04:32,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 287. [2020-07-20 02:04:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2020-07-20 02:04:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 347 transitions. [2020-07-20 02:04:32,042 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 347 transitions. Word has length 92 [2020-07-20 02:04:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:32,042 INFO L479 AbstractCegarLoop]: Abstraction has 287 states and 347 transitions. [2020-07-20 02:04:32,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:32,043 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 347 transitions. [2020-07-20 02:04:32,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-20 02:04:32,044 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:32,044 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 02:04:32,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 02:04:32,045 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:32,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1031964282, now seen corresponding path program 1 times [2020-07-20 02:04:32,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:32,046 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566528143] [2020-07-20 02:04:32,047 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:04:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:32,294 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 02:04:32,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566528143] [2020-07-20 02:04:32,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:32,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:32,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667409314] [2020-07-20 02:04:32,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:32,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:32,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:32,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:32,297 INFO L87 Difference]: Start difference. First operand 287 states and 347 transitions. Second operand 10 states. [2020-07-20 02:04:34,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:34,692 INFO L93 Difference]: Finished difference Result 1068 states and 1350 transitions. [2020-07-20 02:04:34,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-20 02:04:34,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-20 02:04:34,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:34,705 INFO L225 Difference]: With dead ends: 1068 [2020-07-20 02:04:34,709 INFO L226 Difference]: Without dead ends: 801 [2020-07-20 02:04:34,711 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-20 02:04:34,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2020-07-20 02:04:34,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 591. [2020-07-20 02:04:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-20 02:04:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 707 transitions. [2020-07-20 02:04:34,781 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 707 transitions. Word has length 92 [2020-07-20 02:04:34,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:34,782 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 707 transitions. [2020-07-20 02:04:34,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:34,782 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 707 transitions. [2020-07-20 02:04:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-20 02:04:34,785 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:34,785 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 02:04:34,785 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 02:04:34,785 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:34,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:34,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1054596536, now seen corresponding path program 1 times [2020-07-20 02:04:34,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:34,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924098493] [2020-07-20 02:04:34,787 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:04:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:34,961 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 02:04:34,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924098493] [2020-07-20 02:04:34,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:34,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-20 02:04:34,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876946643] [2020-07-20 02:04:34,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 02:04:34,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:34,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 02:04:34,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-20 02:04:34,963 INFO L87 Difference]: Start difference. First operand 591 states and 707 transitions. Second operand 7 states. [2020-07-20 02:04:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:36,876 INFO L93 Difference]: Finished difference Result 2051 states and 2640 transitions. [2020-07-20 02:04:36,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 02:04:36,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2020-07-20 02:04:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:36,887 INFO L225 Difference]: With dead ends: 2051 [2020-07-20 02:04:36,887 INFO L226 Difference]: Without dead ends: 1481 [2020-07-20 02:04:36,890 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-20 02:04:36,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2020-07-20 02:04:37,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1207. [2020-07-20 02:04:37,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2020-07-20 02:04:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1495 transitions. [2020-07-20 02:04:37,017 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1495 transitions. Word has length 92 [2020-07-20 02:04:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:37,017 INFO L479 AbstractCegarLoop]: Abstraction has 1207 states and 1495 transitions. [2020-07-20 02:04:37,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 02:04:37,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1495 transitions. [2020-07-20 02:04:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-07-20 02:04:37,020 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:37,021 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:37,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-20 02:04:37,021 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:37,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:37,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1357284192, now seen corresponding path program 1 times [2020-07-20 02:04:37,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:37,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241373275] [2020-07-20 02:04:37,022 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:04:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-07-20 02:04:37,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241373275] [2020-07-20 02:04:37,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:37,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-20 02:04:37,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438662852] [2020-07-20 02:04:37,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 02:04:37,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:37,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 02:04:37,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-20 02:04:37,233 INFO L87 Difference]: Start difference. First operand 1207 states and 1495 transitions. Second operand 9 states. [2020-07-20 02:04:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:40,329 INFO L93 Difference]: Finished difference Result 3860 states and 4987 transitions. [2020-07-20 02:04:40,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-20 02:04:40,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2020-07-20 02:04:40,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:40,347 INFO L225 Difference]: With dead ends: 3860 [2020-07-20 02:04:40,347 INFO L226 Difference]: Without dead ends: 2675 [2020-07-20 02:04:40,353 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2020-07-20 02:04:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2675 states. [2020-07-20 02:04:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2675 to 2303. [2020-07-20 02:04:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2303 states. [2020-07-20 02:04:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 2940 transitions. [2020-07-20 02:04:40,638 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 2940 transitions. Word has length 147 [2020-07-20 02:04:40,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:40,640 INFO L479 AbstractCegarLoop]: Abstraction has 2303 states and 2940 transitions. [2020-07-20 02:04:40,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 02:04:40,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2940 transitions. [2020-07-20 02:04:40,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-20 02:04:40,653 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:40,653 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 02:04:40,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-20 02:04:40,654 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:40,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:40,655 INFO L82 PathProgramCache]: Analyzing trace with hash 674078602, now seen corresponding path program 1 times [2020-07-20 02:04:40,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:40,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149040691] [2020-07-20 02:04:40,656 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:04:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-07-20 02:04:41,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149040691] [2020-07-20 02:04:41,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:41,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:41,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137376282] [2020-07-20 02:04:41,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:41,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:41,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:41,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:41,098 INFO L87 Difference]: Start difference. First operand 2303 states and 2940 transitions. Second operand 10 states. [2020-07-20 02:04:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:44,040 INFO L93 Difference]: Finished difference Result 6901 states and 9607 transitions. [2020-07-20 02:04:44,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 02:04:44,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2020-07-20 02:04:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:44,066 INFO L225 Difference]: With dead ends: 6901 [2020-07-20 02:04:44,067 INFO L226 Difference]: Without dead ends: 4625 [2020-07-20 02:04:44,080 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2020-07-20 02:04:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4625 states. [2020-07-20 02:04:44,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4625 to 4205. [2020-07-20 02:04:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4205 states. [2020-07-20 02:04:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4205 states to 4205 states and 5340 transitions. [2020-07-20 02:04:44,494 INFO L78 Accepts]: Start accepts. Automaton has 4205 states and 5340 transitions. Word has length 191 [2020-07-20 02:04:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:44,496 INFO L479 AbstractCegarLoop]: Abstraction has 4205 states and 5340 transitions. [2020-07-20 02:04:44,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4205 states and 5340 transitions. [2020-07-20 02:04:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-07-20 02:04:44,505 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:44,505 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:44,505 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-20 02:04:44,505 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:44,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:44,506 INFO L82 PathProgramCache]: Analyzing trace with hash -635516700, now seen corresponding path program 1 times [2020-07-20 02:04:44,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:44,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055154075] [2020-07-20 02:04:44,507 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:04:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:44,890 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-07-20 02:04:44,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055154075] [2020-07-20 02:04:44,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:04:44,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:04:44,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720825303] [2020-07-20 02:04:44,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:04:44,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:44,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:04:44,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:04:44,894 INFO L87 Difference]: Start difference. First operand 4205 states and 5340 transitions. Second operand 10 states. [2020-07-20 02:04:45,072 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-20 02:04:46,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:46,611 INFO L93 Difference]: Finished difference Result 8766 states and 11212 transitions. [2020-07-20 02:04:46,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 02:04:46,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 249 [2020-07-20 02:04:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:46,637 INFO L225 Difference]: With dead ends: 8766 [2020-07-20 02:04:46,637 INFO L226 Difference]: Without dead ends: 4582 [2020-07-20 02:04:46,651 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-07-20 02:04:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4582 states. [2020-07-20 02:04:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4582 to 4198. [2020-07-20 02:04:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4198 states. [2020-07-20 02:04:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 5326 transitions. [2020-07-20 02:04:47,102 INFO L78 Accepts]: Start accepts. Automaton has 4198 states and 5326 transitions. Word has length 249 [2020-07-20 02:04:47,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:47,103 INFO L479 AbstractCegarLoop]: Abstraction has 4198 states and 5326 transitions. [2020-07-20 02:04:47,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:04:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 4198 states and 5326 transitions. [2020-07-20 02:04:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-07-20 02:04:47,110 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:47,111 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:04:47,111 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-20 02:04:47,111 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:47,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:47,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2111585836, now seen corresponding path program 1 times [2020-07-20 02:04:47,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:47,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854856586] [2020-07-20 02:04:47,114 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:04:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2020-07-20 02:04:47,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854856586] [2020-07-20 02:04:47,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535175737] [2020-07-20 02:04:47,460 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@15e90880 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:04:47,770 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@15e90880 issued 4 check-sat command(s) [2020-07-20 02:04:47,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:04:47,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 02:04:47,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:04:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 63 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-20 02:04:47,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 02:04:47,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2020-07-20 02:04:47,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215949559] [2020-07-20 02:04:47,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 02:04:47,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:47,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 02:04:47,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-07-20 02:04:47,948 INFO L87 Difference]: Start difference. First operand 4198 states and 5326 transitions. Second operand 16 states. [2020-07-20 02:04:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:56,883 INFO L93 Difference]: Finished difference Result 15095 states and 21496 transitions. [2020-07-20 02:04:56,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-07-20 02:04:56,884 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 192 [2020-07-20 02:04:56,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:56,939 INFO L225 Difference]: With dead ends: 15095 [2020-07-20 02:04:56,940 INFO L226 Difference]: Without dead ends: 8265 [2020-07-20 02:04:56,980 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=652, Invalid=2540, Unknown=0, NotChecked=0, Total=3192 [2020-07-20 02:04:56,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8265 states. [2020-07-20 02:04:57,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8265 to 7141. [2020-07-20 02:04:57,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7141 states. [2020-07-20 02:04:57,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7141 states to 7141 states and 9184 transitions. [2020-07-20 02:04:57,978 INFO L78 Accepts]: Start accepts. Automaton has 7141 states and 9184 transitions. Word has length 192 [2020-07-20 02:04:57,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:04:57,979 INFO L479 AbstractCegarLoop]: Abstraction has 7141 states and 9184 transitions. [2020-07-20 02:04:57,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 02:04:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 7141 states and 9184 transitions. [2020-07-20 02:04:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-07-20 02:04:57,989 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:04:57,990 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] [2020-07-20 02:04:58,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-20 02:04:58,206 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:04:58,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:04:58,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1676255660, now seen corresponding path program 1 times [2020-07-20 02:04:58,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:04:58,208 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641678644] [2020-07-20 02:04:58,208 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:04:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:04:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2020-07-20 02:04:58,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641678644] [2020-07-20 02:04:58,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465970717] [2020-07-20 02:04:58,463 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@753db1cd No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:04:58,566 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@753db1cd issued 2 check-sat command(s) [2020-07-20 02:04:58,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:04:58,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 02:04:58,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:04:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-07-20 02:04:58,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 02:04:58,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-07-20 02:04:58,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018286652] [2020-07-20 02:04:58,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 02:04:58,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:04:58,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 02:04:58,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 02:04:58,612 INFO L87 Difference]: Start difference. First operand 7141 states and 9184 transitions. Second operand 3 states. [2020-07-20 02:04:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:04:59,517 INFO L93 Difference]: Finished difference Result 14236 states and 18792 transitions. [2020-07-20 02:04:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 02:04:59,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-07-20 02:04:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:04:59,554 INFO L225 Difference]: With dead ends: 14236 [2020-07-20 02:04:59,554 INFO L226 Difference]: Without dead ends: 7117 [2020-07-20 02:04:59,585 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 02:04:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7117 states. [2020-07-20 02:05:00,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7117 to 7105. [2020-07-20 02:05:00,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7105 states. [2020-07-20 02:05:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 9036 transitions. [2020-07-20 02:05:00,605 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 9036 transitions. Word has length 212 [2020-07-20 02:05:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:00,605 INFO L479 AbstractCegarLoop]: Abstraction has 7105 states and 9036 transitions. [2020-07-20 02:05:00,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 02:05:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 9036 transitions. [2020-07-20 02:05:00,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-07-20 02:05:00,616 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:00,616 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:00,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-20 02:05:00,830 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:00,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:00,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1451826661, now seen corresponding path program 1 times [2020-07-20 02:05:00,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:00,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604207686] [2020-07-20 02:05:00,833 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:05:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:01,179 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-07-20 02:05:01,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604207686] [2020-07-20 02:05:01,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463598446] [2020-07-20 02:05:01,180 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@27f227d8 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:05:01,261 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@27f227d8 issued 1 check-sat command(s) [2020-07-20 02:05:01,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:05:01,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 02:05:01,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:05:01,434 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2020-07-20 02:05:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-20 02:05:01,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 02:05:01,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2020-07-20 02:05:01,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870378876] [2020-07-20 02:05:01,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 02:05:01,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:01,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 02:05:01,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-07-20 02:05:01,458 INFO L87 Difference]: Start difference. First operand 7105 states and 9036 transitions. Second operand 3 states. [2020-07-20 02:05:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:03,114 INFO L93 Difference]: Finished difference Result 19760 states and 26461 transitions. [2020-07-20 02:05:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 02:05:03,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-07-20 02:05:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:03,188 INFO L225 Difference]: With dead ends: 19760 [2020-07-20 02:05:03,189 INFO L226 Difference]: Without dead ends: 12677 [2020-07-20 02:05:03,213 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-07-20 02:05:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12677 states. [2020-07-20 02:05:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12677 to 12653. [2020-07-20 02:05:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12653 states. [2020-07-20 02:05:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12653 states to 12653 states and 16418 transitions. [2020-07-20 02:05:05,802 INFO L78 Accepts]: Start accepts. Automaton has 12653 states and 16418 transitions. Word has length 212 [2020-07-20 02:05:05,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:05,802 INFO L479 AbstractCegarLoop]: Abstraction has 12653 states and 16418 transitions. [2020-07-20 02:05:05,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 02:05:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 12653 states and 16418 transitions. [2020-07-20 02:05:05,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-20 02:05:05,819 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:05,820 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 02:05:06,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-20 02:05:06,034 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:06,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:06,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1892464406, now seen corresponding path program 1 times [2020-07-20 02:05:06,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:06,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130911015] [2020-07-20 02:05:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:05:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-07-20 02:05:06,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130911015] [2020-07-20 02:05:06,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116719488] [2020-07-20 02:05:06,516 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@d1eb46a No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:05:06,720 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@d1eb46a issued 3 check-sat command(s) [2020-07-20 02:05:06,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:05:06,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-20 02:05:06,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:05:06,836 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 02:05:06,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 02:05:06,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2020-07-20 02:05:06,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488964423] [2020-07-20 02:05:06,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-20 02:05:06,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:06,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-20 02:05:06,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-07-20 02:05:06,841 INFO L87 Difference]: Start difference. First operand 12653 states and 16418 transitions. Second operand 4 states. [2020-07-20 02:05:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:09,370 INFO L93 Difference]: Finished difference Result 38152 states and 58479 transitions. [2020-07-20 02:05:09,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 02:05:09,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2020-07-20 02:05:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:09,511 INFO L225 Difference]: With dead ends: 38152 [2020-07-20 02:05:09,511 INFO L226 Difference]: Without dead ends: 25526 [2020-07-20 02:05:09,589 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-07-20 02:05:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25526 states. [2020-07-20 02:05:12,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25526 to 24468. [2020-07-20 02:05:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24468 states. [2020-07-20 02:05:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24468 states to 24468 states and 34057 transitions. [2020-07-20 02:05:12,176 INFO L78 Accepts]: Start accepts. Automaton has 24468 states and 34057 transitions. Word has length 213 [2020-07-20 02:05:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:12,177 INFO L479 AbstractCegarLoop]: Abstraction has 24468 states and 34057 transitions. [2020-07-20 02:05:12,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-20 02:05:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 24468 states and 34057 transitions. [2020-07-20 02:05:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-20 02:05:12,210 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:12,210 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 02:05:12,425 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:05:12,425 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:12,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:12,426 INFO L82 PathProgramCache]: Analyzing trace with hash 407200168, now seen corresponding path program 1 times [2020-07-20 02:05:12,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:12,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974834846] [2020-07-20 02:05:12,426 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:05:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-07-20 02:05:12,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974834846] [2020-07-20 02:05:12,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 02:05:12,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-20 02:05:12,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749257621] [2020-07-20 02:05:12,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 02:05:12,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:12,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 02:05:12,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:05:12,714 INFO L87 Difference]: Start difference. First operand 24468 states and 34057 transitions. Second operand 10 states. [2020-07-20 02:05:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:16,565 INFO L93 Difference]: Finished difference Result 46436 states and 66054 transitions. [2020-07-20 02:05:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 02:05:16,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2020-07-20 02:05:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:16,686 INFO L225 Difference]: With dead ends: 46436 [2020-07-20 02:05:16,686 INFO L226 Difference]: Without dead ends: 21995 [2020-07-20 02:05:16,761 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-07-20 02:05:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21995 states. [2020-07-20 02:05:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21995 to 21307. [2020-07-20 02:05:18,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21307 states. [2020-07-20 02:05:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21307 states to 21307 states and 29945 transitions. [2020-07-20 02:05:18,607 INFO L78 Accepts]: Start accepts. Automaton has 21307 states and 29945 transitions. Word has length 213 [2020-07-20 02:05:18,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:18,608 INFO L479 AbstractCegarLoop]: Abstraction has 21307 states and 29945 transitions. [2020-07-20 02:05:18,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 02:05:18,608 INFO L276 IsEmpty]: Start isEmpty. Operand 21307 states and 29945 transitions. [2020-07-20 02:05:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-07-20 02:05:18,630 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:18,630 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:18,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-20 02:05:18,631 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:18,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:18,631 INFO L82 PathProgramCache]: Analyzing trace with hash 592829452, now seen corresponding path program 1 times [2020-07-20 02:05:18,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:18,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582184509] [2020-07-20 02:05:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:05:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-07-20 02:05:18,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582184509] [2020-07-20 02:05:18,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834682483] [2020-07-20 02:05:18,959 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1fcb1dc5 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:05:19,099 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1fcb1dc5 issued 4 check-sat command(s) [2020-07-20 02:05:19,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:05:19,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 02:05:19,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:05:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2020-07-20 02:05:19,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 02:05:19,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 12 [2020-07-20 02:05:19,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707900160] [2020-07-20 02:05:19,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 02:05:19,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:19,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 02:05:19,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-07-20 02:05:19,166 INFO L87 Difference]: Start difference. First operand 21307 states and 29945 transitions. Second operand 6 states. [2020-07-20 02:05:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:20,697 INFO L93 Difference]: Finished difference Result 37164 states and 55592 transitions. [2020-07-20 02:05:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 02:05:20,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2020-07-20 02:05:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:20,773 INFO L225 Difference]: With dead ends: 37164 [2020-07-20 02:05:20,774 INFO L226 Difference]: Without dead ends: 15878 [2020-07-20 02:05:20,856 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 262 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-20 02:05:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2020-07-20 02:05:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 15824. [2020-07-20 02:05:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15824 states. [2020-07-20 02:05:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15824 states to 15824 states and 21583 transitions. [2020-07-20 02:05:23,094 INFO L78 Accepts]: Start accepts. Automaton has 15824 states and 21583 transitions. Word has length 215 [2020-07-20 02:05:23,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:23,095 INFO L479 AbstractCegarLoop]: Abstraction has 15824 states and 21583 transitions. [2020-07-20 02:05:23,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 02:05:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 15824 states and 21583 transitions. [2020-07-20 02:05:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2020-07-20 02:05:23,120 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:23,120 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 02:05:23,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-20 02:05:23,337 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:23,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1271924138, now seen corresponding path program 1 times [2020-07-20 02:05:23,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:23,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791815437] [2020-07-20 02:05:23,339 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:05:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 69 proven. 4 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2020-07-20 02:05:23,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791815437] [2020-07-20 02:05:23,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727213176] [2020-07-20 02:05:23,832 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@74a13647 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:05:23,936 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@74a13647 issued 1 check-sat command(s) [2020-07-20 02:05:23,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:05:23,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 02:05:23,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:05:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-07-20 02:05:24,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 02:05:24,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-07-20 02:05:24,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166610619] [2020-07-20 02:05:24,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 02:05:24,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:24,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 02:05:24,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-07-20 02:05:24,081 INFO L87 Difference]: Start difference. First operand 15824 states and 21583 transitions. Second operand 3 states. [2020-07-20 02:05:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:24,805 INFO L93 Difference]: Finished difference Result 21844 states and 29944 transitions. [2020-07-20 02:05:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 02:05:24,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2020-07-20 02:05:24,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:24,828 INFO L225 Difference]: With dead ends: 21844 [2020-07-20 02:05:24,828 INFO L226 Difference]: Without dead ends: 3509 [2020-07-20 02:05:24,873 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-07-20 02:05:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3509 states. [2020-07-20 02:05:25,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3509 to 3489. [2020-07-20 02:05:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2020-07-20 02:05:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 3953 transitions. [2020-07-20 02:05:25,372 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 3953 transitions. Word has length 391 [2020-07-20 02:05:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:25,373 INFO L479 AbstractCegarLoop]: Abstraction has 3489 states and 3953 transitions. [2020-07-20 02:05:25,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 02:05:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 3953 transitions. [2020-07-20 02:05:25,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-07-20 02:05:25,386 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:25,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:05:25,604 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-20 02:05:25,605 INFO L427 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:25,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:25,606 INFO L82 PathProgramCache]: Analyzing trace with hash -446518419, now seen corresponding path program 1 times [2020-07-20 02:05:25,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:25,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944514005] [2020-07-20 02:05:25,607 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:05:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 52 proven. 37 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-07-20 02:05:26,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944514005] [2020-07-20 02:05:26,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030847914] [2020-07-20 02:05:26,072 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@305ed399 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:05:26,195 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@305ed399 issued 2 check-sat command(s) [2020-07-20 02:05:26,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:05:26,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 02:05:26,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:05:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2020-07-20 02:05:26,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 02:05:26,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-07-20 02:05:26,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37902773] [2020-07-20 02:05:26,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 02:05:26,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:26,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 02:05:26,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-20 02:05:26,255 INFO L87 Difference]: Start difference. First operand 3489 states and 3953 transitions. Second operand 3 states. [2020-07-20 02:05:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:26,623 INFO L93 Difference]: Finished difference Result 5004 states and 5747 transitions. [2020-07-20 02:05:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 02:05:26,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2020-07-20 02:05:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:26,635 INFO L225 Difference]: With dead ends: 5004 [2020-07-20 02:05:26,636 INFO L226 Difference]: Without dead ends: 2835 [2020-07-20 02:05:26,642 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-20 02:05:26,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2020-07-20 02:05:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2835. [2020-07-20 02:05:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2835 states. [2020-07-20 02:05:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 3190 transitions. [2020-07-20 02:05:27,066 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 3190 transitions. Word has length 265 [2020-07-20 02:05:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:27,068 INFO L479 AbstractCegarLoop]: Abstraction has 2835 states and 3190 transitions. [2020-07-20 02:05:27,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 02:05:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3190 transitions. [2020-07-20 02:05:27,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2020-07-20 02:05:27,076 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:27,077 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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 02:05:27,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:05:27,292 INFO L427 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:27,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:27,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1326962735, now seen corresponding path program 1 times [2020-07-20 02:05:27,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:27,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171072848] [2020-07-20 02:05:27,294 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:05:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 49 proven. 15 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2020-07-20 02:05:27,763 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171072848] [2020-07-20 02:05:27,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886584736] [2020-07-20 02:05:27,764 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@30af0465 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:05:27,911 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@30af0465 issued 2 check-sat command(s) [2020-07-20 02:05:27,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:05:27,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-20 02:05:27,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:05:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2020-07-20 02:05:28,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 02:05:28,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 14 [2020-07-20 02:05:28,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568882099] [2020-07-20 02:05:28,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 02:05:28,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:28,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 02:05:28,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-07-20 02:05:28,128 INFO L87 Difference]: Start difference. First operand 2835 states and 3190 transitions. Second operand 6 states. [2020-07-20 02:05:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:28,267 INFO L93 Difference]: Finished difference Result 3853 states and 4369 transitions. [2020-07-20 02:05:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 02:05:28,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 374 [2020-07-20 02:05:28,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:28,270 INFO L225 Difference]: With dead ends: 3853 [2020-07-20 02:05:28,270 INFO L226 Difference]: Without dead ends: 1040 [2020-07-20 02:05:28,274 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-07-20 02:05:28,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2020-07-20 02:05:28,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 935. [2020-07-20 02:05:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2020-07-20 02:05:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1017 transitions. [2020-07-20 02:05:28,358 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1017 transitions. Word has length 374 [2020-07-20 02:05:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:28,359 INFO L479 AbstractCegarLoop]: Abstraction has 935 states and 1017 transitions. [2020-07-20 02:05:28,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 02:05:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1017 transitions. [2020-07-20 02:05:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2020-07-20 02:05:28,361 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:28,361 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 02:05:28,575 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:05:28,576 INFO L427 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:28,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:28,577 INFO L82 PathProgramCache]: Analyzing trace with hash -373872983, now seen corresponding path program 1 times [2020-07-20 02:05:28,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:28,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43291597] [2020-07-20 02:05:28,578 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:05:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-07-20 02:05:29,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43291597] [2020-07-20 02:05:29,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682180558] [2020-07-20 02:05:29,012 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7873c534 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:05:29,197 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7873c534 issued 4 check-sat command(s) [2020-07-20 02:05:29,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:05:29,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-20 02:05:29,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:05:29,341 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 02:05:29,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 02:05:29,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 14 [2020-07-20 02:05:29,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605706595] [2020-07-20 02:05:29,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-20 02:05:29,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:29,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-20 02:05:29,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-20 02:05:29,343 INFO L87 Difference]: Start difference. First operand 935 states and 1017 transitions. Second operand 14 states. [2020-07-20 02:05:32,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:32,030 INFO L93 Difference]: Finished difference Result 983 states and 1082 transitions. [2020-07-20 02:05:32,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-20 02:05:32,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 267 [2020-07-20 02:05:32,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:32,037 INFO L225 Difference]: With dead ends: 983 [2020-07-20 02:05:32,038 INFO L226 Difference]: Without dead ends: 980 [2020-07-20 02:05:32,038 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 335 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2020-07-20 02:05:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2020-07-20 02:05:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 934. [2020-07-20 02:05:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2020-07-20 02:05:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1014 transitions. [2020-07-20 02:05:32,128 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1014 transitions. Word has length 267 [2020-07-20 02:05:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:32,129 INFO L479 AbstractCegarLoop]: Abstraction has 934 states and 1014 transitions. [2020-07-20 02:05:32,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-20 02:05:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1014 transitions. [2020-07-20 02:05:32,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2020-07-20 02:05:32,131 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:32,132 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 02:05:32,346 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:05:32,347 INFO L427 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:32,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash -271251823, now seen corresponding path program 1 times [2020-07-20 02:05:32,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:32,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975358668] [2020-07-20 02:05:32,349 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:05:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 02:05:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2020-07-20 02:05:32,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975358668] [2020-07-20 02:05:32,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423809514] [2020-07-20 02:05:32,652 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@b9f82fb No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:05:32,813 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@b9f82fb issued 4 check-sat command(s) [2020-07-20 02:05:32,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 02:05:32,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 02:05:32,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 02:05:32,862 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 02:05:32,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 02:05:32,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-20 02:05:32,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427228136] [2020-07-20 02:05:32,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 02:05:32,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 02:05:32,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 02:05:32,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:05:32,864 INFO L87 Difference]: Start difference. First operand 934 states and 1014 transitions. Second operand 3 states. [2020-07-20 02:05:32,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 02:05:32,964 INFO L93 Difference]: Finished difference Result 1655 states and 1809 transitions. [2020-07-20 02:05:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 02:05:32,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2020-07-20 02:05:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 02:05:32,968 INFO L225 Difference]: With dead ends: 1655 [2020-07-20 02:05:32,968 INFO L226 Difference]: Without dead ends: 948 [2020-07-20 02:05:32,969 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-20 02:05:32,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2020-07-20 02:05:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 942. [2020-07-20 02:05:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2020-07-20 02:05:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1025 transitions. [2020-07-20 02:05:33,046 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1025 transitions. Word has length 271 [2020-07-20 02:05:33,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 02:05:33,046 INFO L479 AbstractCegarLoop]: Abstraction has 942 states and 1025 transitions. [2020-07-20 02:05:33,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 02:05:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1025 transitions. [2020-07-20 02:05:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-07-20 02:05:33,049 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 02:05:33,049 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 02:05:33,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 02:05:33,264 INFO L427 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 02:05:33,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 02:05:33,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1410375831, now seen corresponding path program 1 times [2020-07-20 02:05:33,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 02:05:33,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982058774] [2020-07-20 02:05:33,266 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4e728b47 [2020-07-20 02:05:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 02:05:33,294 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 02:05:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 02:05:33,323 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 02:05:33,453 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 02:05:33,453 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 02:05:33,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-20 02:05:33,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 02:05:33 BoogieIcfgContainer [2020-07-20 02:05:33,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 02:05:33,673 INFO L168 Benchmark]: Toolchain (without parser) took 77869.85 ms. Allocated memory was 146.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 104.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2020-07-20 02:05:33,674 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 02:05:33,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 481.67 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 103.6 MB in the beginning and 180.5 MB in the end (delta: -76.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-07-20 02:05:33,675 INFO L168 Benchmark]: Boogie Preprocessor took 69.95 ms. Allocated memory is still 203.4 MB. Free memory was 180.5 MB in the beginning and 178.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-07-20 02:05:33,676 INFO L168 Benchmark]: RCFGBuilder took 716.35 ms. Allocated memory is still 203.4 MB. Free memory was 178.5 MB in the beginning and 139.0 MB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 7.1 GB. [2020-07-20 02:05:33,676 INFO L168 Benchmark]: TraceAbstraction took 76593.15 ms. Allocated memory was 203.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 139.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2020-07-20 02:05:33,678 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.20 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 481.67 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 103.6 MB in the beginning and 180.5 MB in the end (delta: -76.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.95 ms. Allocated memory is still 203.4 MB. Free memory was 180.5 MB in the beginning and 178.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 716.35 ms. Allocated memory is still 203.4 MB. Free memory was 178.5 MB in the beginning and 139.0 MB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76593.15 ms. Allocated memory was 203.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 139.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int t2_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int t2_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int T2_E = 2; [L26] int E_M = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; [L33] int token ; [L35] int local ; VAL [\old(E_1)=21, \old(E_2)=8, \old(E_M)=16, \old(local)=20, \old(M_E)=17, \old(m_i)=10, \old(m_pc)=14, \old(m_st)=15, \old(T1_E)=6, \old(t1_i)=19, \old(t1_pc)=11, \old(t1_st)=7, \old(T2_E)=18, \old(t2_i)=9, \old(t2_pc)=12, \old(t2_st)=13, \old(token)=22, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L600] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L604] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L514] m_i = 1 [L515] t1_i = 1 [L516] t2_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L604] RET init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L605] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L541] int kernel_st ; [L542] int tmp ; [L543] int tmp___0 ; [L547] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L548] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L233] COND TRUE m_i == 1 [L234] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L238] COND TRUE t1_i == 1 [L239] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L243] COND TRUE t2_i == 1 [L244] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] RET init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L346] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L351] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L361] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L366] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L371] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L551] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L168] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L187] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L206] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit2_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L551] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L552] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L384] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L389] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L399] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L404] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L409] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L552] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L555] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, kernel_st=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] CALL eval() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L279] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L313] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L96] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L107] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L109] t1_pc = 1 [L110] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L313] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=-2, 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=3, 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=3, 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=3, 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=3, 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=3, 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=-2, 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=-2, 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=-2, 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=-3, 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=-3, 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=-3, 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=-3, 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=-3, 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=-3, 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: 76.3s, OverallIterations: 23, TraceHistogramMax: 8, AutomataDifference: 49.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4833 SDtfs, 13257 SDslu, 3652 SDs, 0 SdLazy, 20405 SolverSat, 6102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4040 GetRequests, 3648 SyntacticMatches, 15 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1918 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24468occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 5543 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 7032 NumberOfCodeBlocks, 6106 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 6728 ConstructedInterpolants, 0 QuantifiedInterpolants, 3118502 SizeOfPredicates, 16 NumberOfNonLiveVariables, 7389 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 32 InterpolantComputations, 20 PerfectInterpolantSequences, 5226/5452 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...