/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_FUNCTIONS --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-19 23:55:23,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-19 23:55:23,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-19 23:55:23,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-19 23:55:23,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-19 23:55:23,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-19 23:55:23,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-19 23:55:23,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-19 23:55:23,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-19 23:55:23,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-19 23:55:23,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-19 23:55:23,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-19 23:55:23,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-19 23:55:23,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-19 23:55:23,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-19 23:55:23,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-19 23:55:23,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-19 23:55:23,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-19 23:55:23,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-19 23:55:23,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-19 23:55:23,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-19 23:55:23,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-19 23:55:23,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-19 23:55:23,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-19 23:55:23,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-19 23:55:23,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-19 23:55:23,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-19 23:55:23,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-19 23:55:23,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-19 23:55:23,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-19 23:55:23,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-19 23:55:23,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-19 23:55:23,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-19 23:55:23,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-19 23:55:23,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-19 23:55:23,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-19 23:55:23,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-19 23:55:23,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-19 23:55:23,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-19 23:55:23,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-19 23:55:23,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-19 23:55:23,529 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-19 23:55:23,545 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-19 23:55:23,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-19 23:55:23,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-19 23:55:23,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-19 23:55:23,547 INFO L138 SettingsManager]: * Use SBE=true [2020-07-19 23:55:23,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-19 23:55:23,548 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-19 23:55:23,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-19 23:55:23,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-19 23:55:23,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-19 23:55:23,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-19 23:55:23,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-19 23:55:23,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-19 23:55:23,549 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-19 23:55:23,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-19 23:55:23,549 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-19 23:55:23,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-19 23:55:23,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-19 23:55:23,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-19 23:55:23,550 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-19 23:55:23,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-19 23:55:23,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-19 23:55:23,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-19 23:55:23,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-19 23:55:23,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-19 23:55:23,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-19 23:55:23,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-19 23:55:23,552 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-19 23:55:23,552 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-19 23:55:23,552 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_FUNCTIONS 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-19 23:55:23,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-19 23:55:23,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-19 23:55:23,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-19 23:55:23,881 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-19 23:55:23,881 INFO L275 PluginConnector]: CDTParser initialized [2020-07-19 23:55:23,883 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-19 23:55:23,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56bb28124/1f4ca5661bbe4084b6bbfc159489b8fe/FLAG0869370cf [2020-07-19 23:55:24,533 INFO L306 CDTParser]: Found 1 translation units. [2020-07-19 23:55:24,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-07-19 23:55:24,547 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56bb28124/1f4ca5661bbe4084b6bbfc159489b8fe/FLAG0869370cf [2020-07-19 23:55:24,861 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56bb28124/1f4ca5661bbe4084b6bbfc159489b8fe [2020-07-19 23:55:24,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-19 23:55:24,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-19 23:55:24,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-19 23:55:24,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-19 23:55:24,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-19 23:55:24,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:55:24" (1/1) ... [2020-07-19 23:55:24,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5425b694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:24, skipping insertion in model container [2020-07-19 23:55:24,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:55:24" (1/1) ... [2020-07-19 23:55:24,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-19 23:55:24,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-19 23:55:25,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 23:55:25,201 INFO L203 MainTranslator]: Completed pre-run [2020-07-19 23:55:25,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 23:55:25,281 INFO L208 MainTranslator]: Completed translation [2020-07-19 23:55:25,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:25 WrapperNode [2020-07-19 23:55:25,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-19 23:55:25,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-19 23:55:25,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-19 23:55:25,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-19 23:55:25,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:25" (1/1) ... [2020-07-19 23:55:25,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:25" (1/1) ... [2020-07-19 23:55:25,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:25" (1/1) ... [2020-07-19 23:55:25,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:25" (1/1) ... [2020-07-19 23:55:25,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:25" (1/1) ... [2020-07-19 23:55:25,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:25" (1/1) ... [2020-07-19 23:55:25,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:25" (1/1) ... [2020-07-19 23:55:25,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-19 23:55:25,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-19 23:55:25,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-19 23:55:25,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-19 23:55:25,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:25" (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-19 23:55:25,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-19 23:55:25,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-19 23:55:25,537 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-19 23:55:25,537 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-19 23:55:25,538 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-19 23:55:25,538 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-07-19 23:55:25,538 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-19 23:55:25,539 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-19 23:55:25,539 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-07-19 23:55:25,539 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-19 23:55:25,539 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-19 23:55:25,540 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-19 23:55:25,540 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-19 23:55:25,540 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-19 23:55:25,541 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-19 23:55:25,541 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-19 23:55:25,541 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-19 23:55:25,541 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-19 23:55:25,542 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-19 23:55:25,542 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-19 23:55:25,542 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-19 23:55:25,542 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-19 23:55:25,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-19 23:55:25,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-19 23:55:25,543 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-19 23:55:25,543 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-19 23:55:25,544 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-19 23:55:25,544 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-07-19 23:55:25,544 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-19 23:55:25,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-19 23:55:25,544 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-19 23:55:25,544 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-19 23:55:25,545 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-07-19 23:55:25,545 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-19 23:55:25,545 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-19 23:55:25,545 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-19 23:55:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-19 23:55:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-19 23:55:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-19 23:55:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-19 23:55:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-19 23:55:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-19 23:55:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-19 23:55:25,547 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-19 23:55:25,547 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-19 23:55:25,547 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-19 23:55:25,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-19 23:55:25,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-19 23:55:26,273 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-19 23:55:26,274 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-19 23:55:26,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:55:26 BoogieIcfgContainer [2020-07-19 23:55:26,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-19 23:55:26,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-19 23:55:26,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-19 23:55:26,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-19 23:55:26,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:55:24" (1/3) ... [2020-07-19 23:55:26,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263f5737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:55:26, skipping insertion in model container [2020-07-19 23:55:26,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:55:25" (2/3) ... [2020-07-19 23:55:26,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263f5737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:55:26, skipping insertion in model container [2020-07-19 23:55:26,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:55:26" (3/3) ... [2020-07-19 23:55:26,294 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-07-19 23:55:26,309 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-19 23:55:26,320 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-19 23:55:26,342 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-19 23:55:26,372 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-19 23:55:26,372 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-19 23:55:26,372 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-19 23:55:26,373 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-19 23:55:26,373 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-19 23:55:26,373 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-19 23:55:26,373 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-19 23:55:26,374 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-19 23:55:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2020-07-19 23:55:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-19 23:55:26,417 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:26,419 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-19 23:55:26,419 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:26,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:26,428 INFO L82 PathProgramCache]: Analyzing trace with hash -67309704, now seen corresponding path program 1 times [2020-07-19 23:55:26,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:26,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630227187] [2020-07-19 23:55:26,438 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:55:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:27,195 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-19 23:55:27,196 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630227187] [2020-07-19 23:55:27,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:27,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-19 23:55:27,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253714435] [2020-07-19 23:55:27,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-19 23:55:27,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:27,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-19 23:55:27,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-07-19 23:55:27,226 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 14 states. [2020-07-19 23:55:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:30,418 INFO L93 Difference]: Finished difference Result 449 states and 710 transitions. [2020-07-19 23:55:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-19 23:55:30,420 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2020-07-19 23:55:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:30,439 INFO L225 Difference]: With dead ends: 449 [2020-07-19 23:55:30,439 INFO L226 Difference]: Without dead ends: 276 [2020-07-19 23:55:30,446 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2020-07-19 23:55:30,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-07-19 23:55:30,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 177. [2020-07-19 23:55:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-19 23:55:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 237 transitions. [2020-07-19 23:55:30,533 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 237 transitions. Word has length 92 [2020-07-19 23:55:30,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:30,534 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 237 transitions. [2020-07-19 23:55:30,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-19 23:55:30,535 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 237 transitions. [2020-07-19 23:55:30,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-19 23:55:30,539 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:30,540 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-19 23:55:30,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-19 23:55:30,540 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:30,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:30,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2098275908, now seen corresponding path program 1 times [2020-07-19 23:55:30,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:30,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705317855] [2020-07-19 23:55:30,542 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:55:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:30,817 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-19 23:55:30,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705317855] [2020-07-19 23:55:30,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:30,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:55:30,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359975900] [2020-07-19 23:55:30,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:55:30,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:30,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:55:30,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:55:30,827 INFO L87 Difference]: Start difference. First operand 177 states and 237 transitions. Second operand 10 states. [2020-07-19 23:55:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:32,458 INFO L93 Difference]: Finished difference Result 425 states and 610 transitions. [2020-07-19 23:55:32,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-19 23:55:32,459 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-19 23:55:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:32,466 INFO L225 Difference]: With dead ends: 425 [2020-07-19 23:55:32,467 INFO L226 Difference]: Without dead ends: 268 [2020-07-19 23:55:32,472 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-19 23:55:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-07-19 23:55:32,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 177. [2020-07-19 23:55:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-07-19 23:55:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2020-07-19 23:55:32,572 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 92 [2020-07-19 23:55:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:32,572 INFO L479 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2020-07-19 23:55:32,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:55:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2020-07-19 23:55:32,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-19 23:55:32,576 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:32,576 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-19 23:55:32,576 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-19 23:55:32,576 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:32,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:32,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1653808840, now seen corresponding path program 1 times [2020-07-19 23:55:32,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:32,578 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660619052] [2020-07-19 23:55:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:55:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:32,783 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-19 23:55:32,784 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660619052] [2020-07-19 23:55:32,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:32,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:55:32,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169939264] [2020-07-19 23:55:32,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:55:32,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:32,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:55:32,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:55:32,786 INFO L87 Difference]: Start difference. First operand 177 states and 234 transitions. Second operand 10 states. [2020-07-19 23:55:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:34,880 INFO L93 Difference]: Finished difference Result 504 states and 747 transitions. [2020-07-19 23:55:34,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-19 23:55:34,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-19 23:55:34,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:34,885 INFO L225 Difference]: With dead ends: 504 [2020-07-19 23:55:34,886 INFO L226 Difference]: Without dead ends: 347 [2020-07-19 23:55:34,888 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-19 23:55:34,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-07-19 23:55:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 213. [2020-07-19 23:55:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-07-19 23:55:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 274 transitions. [2020-07-19 23:55:34,926 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 274 transitions. Word has length 92 [2020-07-19 23:55:34,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:34,927 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 274 transitions. [2020-07-19 23:55:34,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:55:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 274 transitions. [2020-07-19 23:55:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-19 23:55:34,929 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:34,929 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-19 23:55:34,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-19 23:55:34,930 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash -550041895, now seen corresponding path program 1 times [2020-07-19 23:55:34,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:34,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643418642] [2020-07-19 23:55:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:55:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:35,150 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-19 23:55:35,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643418642] [2020-07-19 23:55:35,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:35,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:55:35,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846321475] [2020-07-19 23:55:35,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:55:35,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:35,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:55:35,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:55:35,154 INFO L87 Difference]: Start difference. First operand 213 states and 274 transitions. Second operand 10 states. [2020-07-19 23:55:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:37,145 INFO L93 Difference]: Finished difference Result 586 states and 840 transitions. [2020-07-19 23:55:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-19 23:55:37,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-19 23:55:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:37,153 INFO L225 Difference]: With dead ends: 586 [2020-07-19 23:55:37,154 INFO L226 Difference]: Without dead ends: 393 [2020-07-19 23:55:37,157 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-19 23:55:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-07-19 23:55:37,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 249. [2020-07-19 23:55:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2020-07-19 23:55:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 312 transitions. [2020-07-19 23:55:37,233 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 312 transitions. Word has length 92 [2020-07-19 23:55:37,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:37,234 INFO L479 AbstractCegarLoop]: Abstraction has 249 states and 312 transitions. [2020-07-19 23:55:37,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:55:37,235 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 312 transitions. [2020-07-19 23:55:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-19 23:55:37,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:37,241 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-19 23:55:37,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-19 23:55:37,254 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:37,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:37,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1219969707, now seen corresponding path program 1 times [2020-07-19 23:55:37,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:37,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660584148] [2020-07-19 23:55:37,256 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:55:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:37,499 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-19 23:55:37,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660584148] [2020-07-19 23:55:37,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:37,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:55:37,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322357009] [2020-07-19 23:55:37,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:55:37,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:37,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:55:37,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:55:37,504 INFO L87 Difference]: Start difference. First operand 249 states and 312 transitions. Second operand 10 states. [2020-07-19 23:55:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:39,532 INFO L93 Difference]: Finished difference Result 663 states and 922 transitions. [2020-07-19 23:55:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-19 23:55:39,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-19 23:55:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:39,538 INFO L225 Difference]: With dead ends: 663 [2020-07-19 23:55:39,538 INFO L226 Difference]: Without dead ends: 434 [2020-07-19 23:55:39,540 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-19 23:55:39,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-07-19 23:55:39,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 282. [2020-07-19 23:55:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-07-19 23:55:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 345 transitions. [2020-07-19 23:55:39,605 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 345 transitions. Word has length 92 [2020-07-19 23:55:39,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:39,606 INFO L479 AbstractCegarLoop]: Abstraction has 282 states and 345 transitions. [2020-07-19 23:55:39,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:55:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 345 transitions. [2020-07-19 23:55:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-19 23:55:39,608 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:39,608 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-19 23:55:39,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-19 23:55:39,608 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:39,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:39,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1929357560, now seen corresponding path program 1 times [2020-07-19 23:55:39,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:39,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488495956] [2020-07-19 23:55:39,610 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:55:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:39,848 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-19 23:55:39,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488495956] [2020-07-19 23:55:39,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:39,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:55:39,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274864917] [2020-07-19 23:55:39,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:55:39,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:39,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:55:39,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:55:39,853 INFO L87 Difference]: Start difference. First operand 282 states and 345 transitions. Second operand 10 states. [2020-07-19 23:55:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:41,747 INFO L93 Difference]: Finished difference Result 674 states and 877 transitions. [2020-07-19 23:55:41,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-19 23:55:41,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-19 23:55:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:41,752 INFO L225 Difference]: With dead ends: 674 [2020-07-19 23:55:41,752 INFO L226 Difference]: Without dead ends: 413 [2020-07-19 23:55:41,754 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-19 23:55:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-07-19 23:55:41,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 287. [2020-07-19 23:55:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2020-07-19 23:55:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 347 transitions. [2020-07-19 23:55:41,788 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 347 transitions. Word has length 92 [2020-07-19 23:55:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:41,789 INFO L479 AbstractCegarLoop]: Abstraction has 287 states and 347 transitions. [2020-07-19 23:55:41,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:55:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 347 transitions. [2020-07-19 23:55:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-19 23:55:41,791 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:41,791 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 23:55:41,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-19 23:55:41,791 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:41,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:41,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1031964282, now seen corresponding path program 1 times [2020-07-19 23:55:41,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:41,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544772294] [2020-07-19 23:55:41,793 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:55:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:42,001 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-19 23:55:42,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544772294] [2020-07-19 23:55:42,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:42,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:55:42,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608082635] [2020-07-19 23:55:42,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:55:42,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:42,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:55:42,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:55:42,004 INFO L87 Difference]: Start difference. First operand 287 states and 347 transitions. Second operand 10 states. [2020-07-19 23:55:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:44,737 INFO L93 Difference]: Finished difference Result 1068 states and 1350 transitions. [2020-07-19 23:55:44,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-19 23:55:44,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2020-07-19 23:55:44,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:44,750 INFO L225 Difference]: With dead ends: 1068 [2020-07-19 23:55:44,751 INFO L226 Difference]: Without dead ends: 801 [2020-07-19 23:55:44,754 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-19 23:55:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2020-07-19 23:55:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 591. [2020-07-19 23:55:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-19 23:55:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 707 transitions. [2020-07-19 23:55:44,841 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 707 transitions. Word has length 92 [2020-07-19 23:55:44,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:44,841 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 707 transitions. [2020-07-19 23:55:44,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:55:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 707 transitions. [2020-07-19 23:55:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-19 23:55:44,843 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:44,843 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-19 23:55:44,843 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-19 23:55:44,844 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:44,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:44,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1054596536, now seen corresponding path program 1 times [2020-07-19 23:55:44,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:44,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343443059] [2020-07-19 23:55:44,846 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:55:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:45,090 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-19 23:55:45,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343443059] [2020-07-19 23:55:45,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:45,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-19 23:55:45,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095819437] [2020-07-19 23:55:45,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-19 23:55:45,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:45,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-19 23:55:45,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-19 23:55:45,094 INFO L87 Difference]: Start difference. First operand 591 states and 707 transitions. Second operand 7 states. [2020-07-19 23:55:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:46,964 INFO L93 Difference]: Finished difference Result 2051 states and 2640 transitions. [2020-07-19 23:55:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-19 23:55:46,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2020-07-19 23:55:46,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:46,976 INFO L225 Difference]: With dead ends: 2051 [2020-07-19 23:55:46,976 INFO L226 Difference]: Without dead ends: 1481 [2020-07-19 23:55:46,978 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-19 23:55:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2020-07-19 23:55:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1207. [2020-07-19 23:55:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2020-07-19 23:55:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1495 transitions. [2020-07-19 23:55:47,104 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1495 transitions. Word has length 92 [2020-07-19 23:55:47,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:47,104 INFO L479 AbstractCegarLoop]: Abstraction has 1207 states and 1495 transitions. [2020-07-19 23:55:47,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-19 23:55:47,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1495 transitions. [2020-07-19 23:55:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-07-19 23:55:47,110 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:47,111 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-19 23:55:47,111 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-19 23:55:47,111 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:47,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:47,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1357284192, now seen corresponding path program 1 times [2020-07-19 23:55:47,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:47,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048026350] [2020-07-19 23:55:47,113 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:55:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:47,411 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-19 23:55:47,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048026350] [2020-07-19 23:55:47,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:47,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-19 23:55:47,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195569640] [2020-07-19 23:55:47,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-19 23:55:47,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:47,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-19 23:55:47,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-19 23:55:47,414 INFO L87 Difference]: Start difference. First operand 1207 states and 1495 transitions. Second operand 9 states. [2020-07-19 23:55:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:50,137 INFO L93 Difference]: Finished difference Result 3860 states and 4987 transitions. [2020-07-19 23:55:50,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-19 23:55:50,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2020-07-19 23:55:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:50,159 INFO L225 Difference]: With dead ends: 3860 [2020-07-19 23:55:50,159 INFO L226 Difference]: Without dead ends: 2675 [2020-07-19 23:55:50,166 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-19 23:55:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2675 states. [2020-07-19 23:55:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2675 to 2303. [2020-07-19 23:55:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2303 states. [2020-07-19 23:55:50,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 2940 transitions. [2020-07-19 23:55:50,429 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 2940 transitions. Word has length 147 [2020-07-19 23:55:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:50,431 INFO L479 AbstractCegarLoop]: Abstraction has 2303 states and 2940 transitions. [2020-07-19 23:55:50,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-19 23:55:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2940 transitions. [2020-07-19 23:55:50,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2020-07-19 23:55:50,439 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:50,440 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-19 23:55:50,440 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-19 23:55:50,440 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:50,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:50,441 INFO L82 PathProgramCache]: Analyzing trace with hash 674078602, now seen corresponding path program 1 times [2020-07-19 23:55:50,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:50,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349664875] [2020-07-19 23:55:50,443 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:55:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:50,871 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-19 23:55:50,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349664875] [2020-07-19 23:55:50,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:50,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:55:50,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048517168] [2020-07-19 23:55:50,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:55:50,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:50,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:55:50,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:55:50,874 INFO L87 Difference]: Start difference. First operand 2303 states and 2940 transitions. Second operand 10 states. [2020-07-19 23:55:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:53,704 INFO L93 Difference]: Finished difference Result 6901 states and 9607 transitions. [2020-07-19 23:55:53,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-19 23:55:53,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2020-07-19 23:55:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:53,735 INFO L225 Difference]: With dead ends: 6901 [2020-07-19 23:55:53,736 INFO L226 Difference]: Without dead ends: 4625 [2020-07-19 23:55:53,749 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-19 23:55:53,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4625 states. [2020-07-19 23:55:54,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4625 to 4205. [2020-07-19 23:55:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4205 states. [2020-07-19 23:55:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4205 states to 4205 states and 5340 transitions. [2020-07-19 23:55:54,175 INFO L78 Accepts]: Start accepts. Automaton has 4205 states and 5340 transitions. Word has length 191 [2020-07-19 23:55:54,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:54,176 INFO L479 AbstractCegarLoop]: Abstraction has 4205 states and 5340 transitions. [2020-07-19 23:55:54,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:55:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand 4205 states and 5340 transitions. [2020-07-19 23:55:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2020-07-19 23:55:54,185 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:54,186 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-19 23:55:54,186 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-19 23:55:54,186 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:54,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:54,187 INFO L82 PathProgramCache]: Analyzing trace with hash -635516700, now seen corresponding path program 1 times [2020-07-19 23:55:54,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:54,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909013664] [2020-07-19 23:55:54,187 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:55:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:54,687 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-19 23:55:54,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909013664] [2020-07-19 23:55:54,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:55:54,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:55:54,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730584962] [2020-07-19 23:55:54,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:55:54,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:54,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:55:54,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:55:54,691 INFO L87 Difference]: Start difference. First operand 4205 states and 5340 transitions. Second operand 10 states. [2020-07-19 23:55:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:55:56,567 INFO L93 Difference]: Finished difference Result 8766 states and 11212 transitions. [2020-07-19 23:55:56,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-19 23:55:56,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 249 [2020-07-19 23:55:56,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:55:56,596 INFO L225 Difference]: With dead ends: 8766 [2020-07-19 23:55:56,596 INFO L226 Difference]: Without dead ends: 4582 [2020-07-19 23:55:56,611 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 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-19 23:55:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4582 states. [2020-07-19 23:55:57,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4582 to 4198. [2020-07-19 23:55:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4198 states. [2020-07-19 23:55:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 5326 transitions. [2020-07-19 23:55:57,053 INFO L78 Accepts]: Start accepts. Automaton has 4198 states and 5326 transitions. Word has length 249 [2020-07-19 23:55:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:55:57,053 INFO L479 AbstractCegarLoop]: Abstraction has 4198 states and 5326 transitions. [2020-07-19 23:55:57,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:55:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4198 states and 5326 transitions. [2020-07-19 23:55:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-07-19 23:55:57,059 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:55:57,059 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-19 23:55:57,060 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-19 23:55:57,060 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:55:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:55:57,060 INFO L82 PathProgramCache]: Analyzing trace with hash -2111585836, now seen corresponding path program 1 times [2020-07-19 23:55:57,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:55:57,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812389726] [2020-07-19 23:55:57,061 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:55:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:55:57,536 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-19 23:55:57,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812389726] [2020-07-19 23:55:57,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552012002] [2020-07-19 23:55:57,538 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3d80c712 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-19 23:55:57,827 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3d80c712 issued 4 check-sat command(s) [2020-07-19 23:55:57,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:55:57,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-19 23:55:57,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:55:58,161 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-19 23:55:58,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:55:58,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2020-07-19 23:55:58,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917321839] [2020-07-19 23:55:58,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-19 23:55:58,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:55:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-19 23:55:58,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-07-19 23:55:58,165 INFO L87 Difference]: Start difference. First operand 4198 states and 5326 transitions. Second operand 16 states. [2020-07-19 23:56:05,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:56:05,830 INFO L93 Difference]: Finished difference Result 15095 states and 21496 transitions. [2020-07-19 23:56:05,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-07-19 23:56:05,831 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 192 [2020-07-19 23:56:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:56:05,878 INFO L225 Difference]: With dead ends: 15095 [2020-07-19 23:56:05,879 INFO L226 Difference]: Without dead ends: 8265 [2020-07-19 23:56:05,917 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-19 23:56:05,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8265 states. [2020-07-19 23:56:06,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8265 to 7141. [2020-07-19 23:56:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7141 states. [2020-07-19 23:56:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7141 states to 7141 states and 9184 transitions. [2020-07-19 23:56:06,867 INFO L78 Accepts]: Start accepts. Automaton has 7141 states and 9184 transitions. Word has length 192 [2020-07-19 23:56:06,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:56:06,868 INFO L479 AbstractCegarLoop]: Abstraction has 7141 states and 9184 transitions. [2020-07-19 23:56:06,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-19 23:56:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 7141 states and 9184 transitions. [2020-07-19 23:56:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-07-19 23:56:06,880 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:56:06,880 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-19 23:56:07,093 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-19 23:56:07,094 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:56:07,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:56:07,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1676255660, now seen corresponding path program 1 times [2020-07-19 23:56:07,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:56:07,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903210824] [2020-07-19 23:56:07,096 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:56:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:07,465 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-19 23:56:07,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903210824] [2020-07-19 23:56:07,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714075663] [2020-07-19 23:56:07,467 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d0626b8 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-19 23:56:07,633 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d0626b8 issued 2 check-sat command(s) [2020-07-19 23:56:07,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:56:07,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-19 23:56:07,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:56:07,693 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-19 23:56:07,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 23:56:07,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-07-19 23:56:07,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621192986] [2020-07-19 23:56:07,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 23:56:07,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:56:07,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 23:56:07,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-19 23:56:07,696 INFO L87 Difference]: Start difference. First operand 7141 states and 9184 transitions. Second operand 3 states. [2020-07-19 23:56:08,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:56:08,489 INFO L93 Difference]: Finished difference Result 14236 states and 18792 transitions. [2020-07-19 23:56:08,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 23:56:08,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-07-19 23:56:08,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:56:08,549 INFO L225 Difference]: With dead ends: 14236 [2020-07-19 23:56:08,550 INFO L226 Difference]: Without dead ends: 7117 [2020-07-19 23:56:08,587 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-19 23:56:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7117 states. [2020-07-19 23:56:09,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7117 to 7105. [2020-07-19 23:56:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7105 states. [2020-07-19 23:56:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 9036 transitions. [2020-07-19 23:56:09,517 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 9036 transitions. Word has length 212 [2020-07-19 23:56:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:56:09,518 INFO L479 AbstractCegarLoop]: Abstraction has 7105 states and 9036 transitions. [2020-07-19 23:56:09,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 23:56:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 9036 transitions. [2020-07-19 23:56:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-07-19 23:56:09,527 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:56:09,528 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-19 23:56:09,741 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-19 23:56:09,742 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:56:09,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:56:09,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1451826661, now seen corresponding path program 1 times [2020-07-19 23:56:09,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:56:09,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692477698] [2020-07-19 23:56:09,743 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:56:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:10,007 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-19 23:56:10,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692477698] [2020-07-19 23:56:10,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299814843] [2020-07-19 23:56:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@d47d62a 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-19 23:56:10,073 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@d47d62a issued 1 check-sat command(s) [2020-07-19 23:56:10,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:56:10,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-19 23:56:10,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:56:10,129 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-19 23:56:10,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 23:56:10,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2020-07-19 23:56:10,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350124117] [2020-07-19 23:56:10,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 23:56:10,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:56:10,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 23:56:10,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-07-19 23:56:10,131 INFO L87 Difference]: Start difference. First operand 7105 states and 9036 transitions. Second operand 3 states. [2020-07-19 23:56:11,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:56:11,606 INFO L93 Difference]: Finished difference Result 19760 states and 26461 transitions. [2020-07-19 23:56:11,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 23:56:11,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-07-19 23:56:11,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:56:11,671 INFO L225 Difference]: With dead ends: 19760 [2020-07-19 23:56:11,671 INFO L226 Difference]: Without dead ends: 12677 [2020-07-19 23:56:11,697 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-07-19 23:56:11,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12677 states. [2020-07-19 23:56:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12677 to 12653. [2020-07-19 23:56:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12653 states. [2020-07-19 23:56:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12653 states to 12653 states and 16418 transitions. [2020-07-19 23:56:12,846 INFO L78 Accepts]: Start accepts. Automaton has 12653 states and 16418 transitions. Word has length 212 [2020-07-19 23:56:12,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:56:12,846 INFO L479 AbstractCegarLoop]: Abstraction has 12653 states and 16418 transitions. [2020-07-19 23:56:12,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 23:56:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 12653 states and 16418 transitions. [2020-07-19 23:56:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-19 23:56:12,862 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:56:12,863 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-19 23:56:13,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-19 23:56:13,076 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:56:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:56:13,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1892464406, now seen corresponding path program 1 times [2020-07-19 23:56:13,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:56:13,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686234200] [2020-07-19 23:56:13,077 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:56:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:13,380 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-19 23:56:13,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686234200] [2020-07-19 23:56:13,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752783064] [2020-07-19 23:56:13,381 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7aa61403 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-19 23:56:13,511 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7aa61403 issued 3 check-sat command(s) [2020-07-19 23:56:13,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:56:13,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-19 23:56:13,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:56:13,729 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-19 23:56:13,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 23:56:13,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2020-07-19 23:56:13,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212822232] [2020-07-19 23:56:13,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-19 23:56:13,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:56:13,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-19 23:56:13,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-07-19 23:56:13,733 INFO L87 Difference]: Start difference. First operand 12653 states and 16418 transitions. Second operand 4 states. [2020-07-19 23:56:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:56:16,952 INFO L93 Difference]: Finished difference Result 38152 states and 58479 transitions. [2020-07-19 23:56:16,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-19 23:56:16,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2020-07-19 23:56:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:56:17,080 INFO L225 Difference]: With dead ends: 38152 [2020-07-19 23:56:17,081 INFO L226 Difference]: Without dead ends: 25526 [2020-07-19 23:56:17,152 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-07-19 23:56:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25526 states. [2020-07-19 23:56:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25526 to 24468. [2020-07-19 23:56:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24468 states. [2020-07-19 23:56:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24468 states to 24468 states and 34057 transitions. [2020-07-19 23:56:20,551 INFO L78 Accepts]: Start accepts. Automaton has 24468 states and 34057 transitions. Word has length 213 [2020-07-19 23:56:20,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:56:20,551 INFO L479 AbstractCegarLoop]: Abstraction has 24468 states and 34057 transitions. [2020-07-19 23:56:20,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-19 23:56:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 24468 states and 34057 transitions. [2020-07-19 23:56:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2020-07-19 23:56:20,576 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:56:20,576 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-19 23:56:20,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:56:20,790 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:56:20,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:56:20,791 INFO L82 PathProgramCache]: Analyzing trace with hash 407200168, now seen corresponding path program 1 times [2020-07-19 23:56:20,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:56:20,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768988531] [2020-07-19 23:56:20,791 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:56:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:21,028 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-19 23:56:21,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768988531] [2020-07-19 23:56:21,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:56:21,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-19 23:56:21,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102221411] [2020-07-19 23:56:21,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:56:21,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:56:21,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:56:21,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:56:21,030 INFO L87 Difference]: Start difference. First operand 24468 states and 34057 transitions. Second operand 10 states. [2020-07-19 23:56:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:56:24,148 INFO L93 Difference]: Finished difference Result 46436 states and 66054 transitions. [2020-07-19 23:56:24,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-19 23:56:24,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 213 [2020-07-19 23:56:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:56:24,238 INFO L225 Difference]: With dead ends: 46436 [2020-07-19 23:56:24,238 INFO L226 Difference]: Without dead ends: 21995 [2020-07-19 23:56:24,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-07-19 23:56:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21995 states. [2020-07-19 23:56:27,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21995 to 21307. [2020-07-19 23:56:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21307 states. [2020-07-19 23:56:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21307 states to 21307 states and 29945 transitions. [2020-07-19 23:56:27,169 INFO L78 Accepts]: Start accepts. Automaton has 21307 states and 29945 transitions. Word has length 213 [2020-07-19 23:56:27,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:56:27,170 INFO L479 AbstractCegarLoop]: Abstraction has 21307 states and 29945 transitions. [2020-07-19 23:56:27,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:56:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 21307 states and 29945 transitions. [2020-07-19 23:56:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-07-19 23:56:27,183 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:56:27,184 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-19 23:56:27,184 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-19 23:56:27,184 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:56:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:56:27,184 INFO L82 PathProgramCache]: Analyzing trace with hash 592829452, now seen corresponding path program 1 times [2020-07-19 23:56:27,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:56:27,185 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620149076] [2020-07-19 23:56:27,185 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:56:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:27,479 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-19 23:56:27,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620149076] [2020-07-19 23:56:27,480 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353362884] [2020-07-19 23:56:27,480 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@55ed499d 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-19 23:56:27,625 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@55ed499d issued 4 check-sat command(s) [2020-07-19 23:56:27,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:56:27,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-19 23:56:27,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:56:27,695 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-19 23:56:27,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 23:56:27,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 12 [2020-07-19 23:56:27,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424967991] [2020-07-19 23:56:27,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 23:56:27,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:56:27,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 23:56:27,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-07-19 23:56:27,698 INFO L87 Difference]: Start difference. First operand 21307 states and 29945 transitions. Second operand 6 states. [2020-07-19 23:56:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:56:29,226 INFO L93 Difference]: Finished difference Result 37164 states and 55592 transitions. [2020-07-19 23:56:29,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-19 23:56:29,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2020-07-19 23:56:29,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:56:29,290 INFO L225 Difference]: With dead ends: 37164 [2020-07-19 23:56:29,291 INFO L226 Difference]: Without dead ends: 15878 [2020-07-19 23:56:29,368 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-19 23:56:29,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2020-07-19 23:56:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 15824. [2020-07-19 23:56:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15824 states. [2020-07-19 23:56:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15824 states to 15824 states and 21583 transitions. [2020-07-19 23:56:30,794 INFO L78 Accepts]: Start accepts. Automaton has 15824 states and 21583 transitions. Word has length 215 [2020-07-19 23:56:30,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:56:30,795 INFO L479 AbstractCegarLoop]: Abstraction has 15824 states and 21583 transitions. [2020-07-19 23:56:30,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 23:56:30,795 INFO L276 IsEmpty]: Start isEmpty. Operand 15824 states and 21583 transitions. [2020-07-19 23:56:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2020-07-19 23:56:30,814 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:56:30,814 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:56:31,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-19 23:56:31,022 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:56:31,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:56:31,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1468475205, now seen corresponding path program 1 times [2020-07-19 23:56:31,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:56:31,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007905094] [2020-07-19 23:56:31,024 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:56:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 48 proven. 15 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2020-07-19 23:56:31,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007905094] [2020-07-19 23:56:31,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119878583] [2020-07-19 23:56:31,434 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@42f4fd8b 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-19 23:56:31,525 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@42f4fd8b issued 1 check-sat command(s) [2020-07-19 23:56:31,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:56:31,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-19 23:56:31,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:56:31,608 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2020-07-19 23:56:31,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 23:56:31,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2020-07-19 23:56:31,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362291854] [2020-07-19 23:56:31,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 23:56:31,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:56:31,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 23:56:31,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-07-19 23:56:31,611 INFO L87 Difference]: Start difference. First operand 15824 states and 21583 transitions. Second operand 3 states. [2020-07-19 23:56:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:56:32,134 INFO L93 Difference]: Finished difference Result 21844 states and 29944 transitions. [2020-07-19 23:56:32,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 23:56:32,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2020-07-19 23:56:32,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:56:32,153 INFO L225 Difference]: With dead ends: 21844 [2020-07-19 23:56:32,153 INFO L226 Difference]: Without dead ends: 3509 [2020-07-19 23:56:32,206 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-07-19 23:56:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3509 states. [2020-07-19 23:56:32,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3509 to 3489. [2020-07-19 23:56:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2020-07-19 23:56:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 3953 transitions. [2020-07-19 23:56:32,716 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 3953 transitions. Word has length 372 [2020-07-19 23:56:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:56:32,717 INFO L479 AbstractCegarLoop]: Abstraction has 3489 states and 3953 transitions. [2020-07-19 23:56:32,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 23:56:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 3953 transitions. [2020-07-19 23:56:32,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2020-07-19 23:56:32,724 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:56:32,724 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:56:32,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-19 23:56:32,940 INFO L427 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:56:32,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:56:32,941 INFO L82 PathProgramCache]: Analyzing trace with hash -87618749, now seen corresponding path program 1 times [2020-07-19 23:56:32,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:56:32,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990465168] [2020-07-19 23:56:32,942 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:56:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-07-19 23:56:34,132 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990465168] [2020-07-19 23:56:34,132 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183018173] [2020-07-19 23:56:34,133 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f5b217a 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-19 23:56:34,297 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f5b217a issued 2 check-sat command(s) [2020-07-19 23:56:34,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:56:34,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-19 23:56:34,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:56:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2020-07-19 23:56:34,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 23:56:34,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2020-07-19 23:56:34,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076644212] [2020-07-19 23:56:34,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 23:56:34,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:56:34,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 23:56:34,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-07-19 23:56:34,463 INFO L87 Difference]: Start difference. First operand 3489 states and 3953 transitions. Second operand 3 states. [2020-07-19 23:56:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:56:34,877 INFO L93 Difference]: Finished difference Result 5004 states and 5747 transitions. [2020-07-19 23:56:34,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 23:56:34,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2020-07-19 23:56:34,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:56:34,892 INFO L225 Difference]: With dead ends: 5004 [2020-07-19 23:56:34,892 INFO L226 Difference]: Without dead ends: 2835 [2020-07-19 23:56:34,898 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-07-19 23:56:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2020-07-19 23:56:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2835. [2020-07-19 23:56:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2835 states. [2020-07-19 23:56:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 3190 transitions. [2020-07-19 23:56:35,177 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 3190 transitions. Word has length 371 [2020-07-19 23:56:35,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:56:35,180 INFO L479 AbstractCegarLoop]: Abstraction has 2835 states and 3190 transitions. [2020-07-19 23:56:35,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 23:56:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3190 transitions. [2020-07-19 23:56:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2020-07-19 23:56:35,185 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:56:35,186 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-19 23:56:35,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:56:35,395 INFO L427 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:56:35,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:56:35,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1326962735, now seen corresponding path program 1 times [2020-07-19 23:56:35,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:56:35,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771061166] [2020-07-19 23:56:35,398 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:56:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:35,899 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-19 23:56:35,899 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771061166] [2020-07-19 23:56:35,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217539977] [2020-07-19 23:56:35,900 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7ff57d06 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-19 23:56:36,070 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7ff57d06 issued 2 check-sat command(s) [2020-07-19 23:56:36,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:56:36,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-19 23:56:36,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:56:36,175 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-19 23:56:36,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 23:56:36,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 14 [2020-07-19 23:56:36,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304951057] [2020-07-19 23:56:36,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-19 23:56:36,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:56:36,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-19 23:56:36,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-07-19 23:56:36,180 INFO L87 Difference]: Start difference. First operand 2835 states and 3190 transitions. Second operand 6 states. [2020-07-19 23:56:36,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:56:36,354 INFO L93 Difference]: Finished difference Result 3853 states and 4369 transitions. [2020-07-19 23:56:36,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-19 23:56:36,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 374 [2020-07-19 23:56:36,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:56:36,359 INFO L225 Difference]: With dead ends: 3853 [2020-07-19 23:56:36,359 INFO L226 Difference]: Without dead ends: 1040 [2020-07-19 23:56:36,364 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-07-19 23:56:36,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2020-07-19 23:56:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 935. [2020-07-19 23:56:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2020-07-19 23:56:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1017 transitions. [2020-07-19 23:56:36,452 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1017 transitions. Word has length 374 [2020-07-19 23:56:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:56:36,452 INFO L479 AbstractCegarLoop]: Abstraction has 935 states and 1017 transitions. [2020-07-19 23:56:36,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-19 23:56:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1017 transitions. [2020-07-19 23:56:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2020-07-19 23:56:36,455 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:56:36,455 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-19 23:56:36,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:56:36,669 INFO L427 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:56:36,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:56:36,670 INFO L82 PathProgramCache]: Analyzing trace with hash -373872983, now seen corresponding path program 1 times [2020-07-19 23:56:36,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:56:36,670 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259180395] [2020-07-19 23:56:36,670 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:56:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:37,211 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-19 23:56:37,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259180395] [2020-07-19 23:56:37,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671682558] [2020-07-19 23:56:37,212 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@65a7c2bc 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-19 23:56:37,460 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@65a7c2bc issued 4 check-sat command(s) [2020-07-19 23:56:37,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:56:37,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-19 23:56:37,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:56:37,646 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-19 23:56:37,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:56:37,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 14 [2020-07-19 23:56:37,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744236349] [2020-07-19 23:56:37,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-19 23:56:37,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:56:37,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-19 23:56:37,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-19 23:56:37,649 INFO L87 Difference]: Start difference. First operand 935 states and 1017 transitions. Second operand 14 states. [2020-07-19 23:56:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:56:40,024 INFO L93 Difference]: Finished difference Result 983 states and 1082 transitions. [2020-07-19 23:56:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-19 23:56:40,024 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 267 [2020-07-19 23:56:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:56:40,026 INFO L225 Difference]: With dead ends: 983 [2020-07-19 23:56:40,027 INFO L226 Difference]: Without dead ends: 980 [2020-07-19 23:56:40,028 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-19 23:56:40,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2020-07-19 23:56:40,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 934. [2020-07-19 23:56:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2020-07-19 23:56:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1014 transitions. [2020-07-19 23:56:40,093 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1014 transitions. Word has length 267 [2020-07-19 23:56:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:56:40,093 INFO L479 AbstractCegarLoop]: Abstraction has 934 states and 1014 transitions. [2020-07-19 23:56:40,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-19 23:56:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1014 transitions. [2020-07-19 23:56:40,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2020-07-19 23:56:40,095 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:56:40,095 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-19 23:56:40,301 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:56:40,302 INFO L427 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:56:40,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:56:40,303 INFO L82 PathProgramCache]: Analyzing trace with hash -271251823, now seen corresponding path program 1 times [2020-07-19 23:56:40,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:56:40,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448952572] [2020-07-19 23:56:40,304 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:56:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:56:40,601 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-19 23:56:40,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448952572] [2020-07-19 23:56:40,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498422130] [2020-07-19 23:56:40,602 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@481bae95 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-19 23:56:40,771 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@481bae95 issued 4 check-sat command(s) [2020-07-19 23:56:40,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:56:40,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-19 23:56:40,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:56:40,817 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-19 23:56:40,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-19 23:56:40,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-19 23:56:40,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389665067] [2020-07-19 23:56:40,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-19 23:56:40,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:56:40,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-19 23:56:40,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:56:40,819 INFO L87 Difference]: Start difference. First operand 934 states and 1014 transitions. Second operand 3 states. [2020-07-19 23:56:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:56:40,894 INFO L93 Difference]: Finished difference Result 1655 states and 1809 transitions. [2020-07-19 23:56:40,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-19 23:56:40,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2020-07-19 23:56:40,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:56:40,898 INFO L225 Difference]: With dead ends: 1655 [2020-07-19 23:56:40,898 INFO L226 Difference]: Without dead ends: 948 [2020-07-19 23:56:40,900 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-19 23:56:40,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2020-07-19 23:56:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 942. [2020-07-19 23:56:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2020-07-19 23:56:40,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1025 transitions. [2020-07-19 23:56:40,978 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1025 transitions. Word has length 271 [2020-07-19 23:56:40,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:56:40,979 INFO L479 AbstractCegarLoop]: Abstraction has 942 states and 1025 transitions. [2020-07-19 23:56:40,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-19 23:56:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1025 transitions. [2020-07-19 23:56:40,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-07-19 23:56:40,981 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:56:40,981 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-19 23:56:41,196 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:56:41,197 INFO L427 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:56:41,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:56:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1410375831, now seen corresponding path program 1 times [2020-07-19 23:56:41,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:56:41,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263342386] [2020-07-19 23:56:41,199 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4f5dcbe6 [2020-07-19 23:56:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-19 23:56:41,227 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-19 23:56:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-19 23:56:41,255 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-19 23:56:41,350 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-19 23:56:41,350 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-19 23:56:41,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-19 23:56:41,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 11:56:41 BoogieIcfgContainer [2020-07-19 23:56:41,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-19 23:56:41,559 INFO L168 Benchmark]: Toolchain (without parser) took 76682.72 ms. Allocated memory was 136.8 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 101.7 MB in the beginning and 689.0 MB in the end (delta: -587.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2020-07-19 23:56:41,560 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-19 23:56:41,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.70 ms. Allocated memory is still 136.8 MB. Free memory was 101.3 MB in the beginning and 86.5 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-07-19 23:56:41,563 INFO L168 Benchmark]: Boogie Preprocessor took 169.24 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 86.5 MB in the beginning and 178.0 MB in the end (delta: -91.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-19 23:56:41,563 INFO L168 Benchmark]: RCFGBuilder took 823.53 ms. Allocated memory is still 200.8 MB. Free memory was 176.9 MB in the beginning and 138.0 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2020-07-19 23:56:41,564 INFO L168 Benchmark]: TraceAbstraction took 75272.41 ms. Allocated memory was 200.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 138.0 MB in the beginning and 689.0 MB in the end (delta: -551.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2020-07-19 23:56:41,570 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.30 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 399.70 ms. Allocated memory is still 136.8 MB. Free memory was 101.3 MB in the beginning and 86.5 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 169.24 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 86.5 MB in the beginning and 178.0 MB in the end (delta: -91.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 823.53 ms. Allocated memory is still 200.8 MB. Free memory was 176.9 MB in the beginning and 138.0 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75272.41 ms. Allocated memory was 200.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 138.0 MB in the beginning and 689.0 MB in the end (delta: -551.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 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=0, token=0] [L51] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L54] token = __VERIFIER_nondet_int() [L55] local = token [L56] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L57] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L168] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_master_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=-1] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L188] COND TRUE E_1 == 1 [L189] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=1, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit1_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=-1] [L433] tmp___0 = is_transmit1_triggered() [L435] COND TRUE \read(tmp___0) [L436] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=-1] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L207] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit2_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=-1] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=-1] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L57] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L58] E_1 = 2 [L59] m_pc = 1 [L60] m_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L299] RET master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=-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: 74.9s, OverallIterations: 23, TraceHistogramMax: 7, AutomataDifference: 47.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4833 SDtfs, 13659 SDslu, 3652 SDs, 0 SdLazy, 20084 SolverSat, 6216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4147 GetRequests, 3747 SyntacticMatches, 15 SemanticMatches, 385 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1974 ImplicationChecksByTransitivity, 8.5s 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: 13.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 5543 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 7206 NumberOfCodeBlocks, 6240 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 6902 ConstructedInterpolants, 0 QuantifiedInterpolants, 3243253 SizeOfPredicates, 16 NumberOfNonLiveVariables, 7482 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 32 InterpolantComputations, 20 PerfectInterpolantSequences, 5613/5828 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...