/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:51:56,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:51:56,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:51:56,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:51:56,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:51:56,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:51:56,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:51:56,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:51:56,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:51:56,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:51:56,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:51:56,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:51:56,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:51:56,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:51:56,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:51:56,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:51:56,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:51:56,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:51:56,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:51:56,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:51:56,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:51:56,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:51:56,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:51:56,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:51:56,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:51:56,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:51:56,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:51:56,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:51:56,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:51:56,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:51:56,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:51:56,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:51:56,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:51:56,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:51:56,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:51:56,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:51:56,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:51:56,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:51:56,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:51:56,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:51:56,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:51:56,766 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:51:56,778 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:51:56,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:51:56,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:51:56,780 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:51:56,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:51:56,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:51:56,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:51:56,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:51:56,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:51:56,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:51:56,782 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:51:56,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:51:56,782 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:51:56,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:51:56,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:51:56,783 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:51:56,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:51:56,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:51:56,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:51:56,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:51:56,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:51:56,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:51:56,785 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 06:51:57,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:51:57,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:51:57,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:51:57,201 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:51:57,201 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:51:57,202 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-11-07 06:51:57,285 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0da0cd91/4f529b68b3394c11960b0b634e2c476c/FLAGdeb44212e [2020-11-07 06:51:57,962 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:51:57,963 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-11-07 06:51:57,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0da0cd91/4f529b68b3394c11960b0b634e2c476c/FLAGdeb44212e [2020-11-07 06:51:58,257 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0da0cd91/4f529b68b3394c11960b0b634e2c476c [2020-11-07 06:51:58,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:51:58,270 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:51:58,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:51:58,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:51:58,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:51:58,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb9b189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58, skipping insertion in model container [2020-11-07 06:51:58,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:51:58,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:51:58,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:51:58,532 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:51:58,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:51:58,607 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:51:58,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58 WrapperNode [2020-11-07 06:51:58,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:51:58,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:51:58,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:51:58,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:51:58,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (1/1) ... [2020-11-07 06:51:58,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:51:58,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:51:58,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:51:58,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:51:58,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:51:58,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:51:58,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:51:58,750 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:51:58,751 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-11-07 06:51:58,751 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-11-07 06:51:58,751 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-11-07 06:51:58,751 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-11-07 06:51:58,751 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-11-07 06:51:58,752 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-11-07 06:51:58,752 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-11-07 06:51:58,752 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-11-07 06:51:58,752 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-11-07 06:51:58,752 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-11-07 06:51:58,753 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-11-07 06:51:58,753 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-11-07 06:51:58,753 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-11-07 06:51:58,753 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-11-07 06:51:58,753 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-11-07 06:51:58,754 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-11-07 06:51:58,754 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-11-07 06:51:58,754 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-11-07 06:51:58,754 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:51:58,754 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:51:58,755 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:51:58,755 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:51:58,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:51:58,755 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-11-07 06:51:58,755 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-11-07 06:51:58,756 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-11-07 06:51:58,756 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-11-07 06:51:58,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:51:58,756 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-11-07 06:51:58,756 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-11-07 06:51:58,757 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-11-07 06:51:58,757 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-11-07 06:51:58,757 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-11-07 06:51:58,757 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-11-07 06:51:58,757 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-11-07 06:51:58,758 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-11-07 06:51:58,758 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-11-07 06:51:58,758 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-11-07 06:51:58,758 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-11-07 06:51:58,758 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-11-07 06:51:58,758 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-11-07 06:51:58,759 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-11-07 06:51:58,759 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:51:58,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:51:58,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:51:58,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:51:58,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:51:58,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:51:58,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:51:59,603 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:51:59,603 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-11-07 06:51:59,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:51:59 BoogieIcfgContainer [2020-11-07 06:51:59,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:51:59,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:51:59,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:51:59,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:51:59,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:51:58" (1/3) ... [2020-11-07 06:51:59,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c869fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:51:59, skipping insertion in model container [2020-11-07 06:51:59,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:51:58" (2/3) ... [2020-11-07 06:51:59,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c869fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:51:59, skipping insertion in model container [2020-11-07 06:51:59,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:51:59" (3/3) ... [2020-11-07 06:51:59,618 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-11-07 06:51:59,635 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:51:59,639 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:51:59,652 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:51:59,678 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:51:59,678 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:51:59,678 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:51:59,679 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:51:59,679 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:51:59,682 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:51:59,682 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:51:59,682 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:51:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states. [2020-11-07 06:51:59,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-11-07 06:51:59,722 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:59,723 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, 1, 1, 1, 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-11-07 06:51:59,723 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:59,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:59,730 INFO L82 PathProgramCache]: Analyzing trace with hash -394934797, now seen corresponding path program 1 times [2020-11-07 06:51:59,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:59,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [325387250] [2020-11-07 06:51:59,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:52:00,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [325387250] [2020-11-07 06:52:00,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:00,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 06:52:00,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263537552] [2020-11-07 06:52:00,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:52:00,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:00,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:52:00,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:52:00,457 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 7 states. [2020-11-07 06:52:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:03,058 INFO L93 Difference]: Finished difference Result 807 states and 1081 transitions. [2020-11-07 06:52:03,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 06:52:03,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2020-11-07 06:52:03,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:03,084 INFO L225 Difference]: With dead ends: 807 [2020-11-07 06:52:03,084 INFO L226 Difference]: Without dead ends: 593 [2020-11-07 06:52:03,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:52:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-11-07 06:52:03,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 412. [2020-11-07 06:52:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-11-07 06:52:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 501 transitions. [2020-11-07 06:52:03,313 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 501 transitions. Word has length 119 [2020-11-07 06:52:03,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:03,314 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 501 transitions. [2020-11-07 06:52:03,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:52:03,315 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 501 transitions. [2020-11-07 06:52:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-07 06:52:03,321 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:03,321 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:52:03,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:52:03,322 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:03,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:03,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1396639943, now seen corresponding path program 1 times [2020-11-07 06:52:03,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:03,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [850437561] [2020-11-07 06:52:03,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 06:52:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:52:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-11-07 06:52:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-11-07 06:52:03,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [850437561] [2020-11-07 06:52:03,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:03,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 06:52:03,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808313974] [2020-11-07 06:52:03,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:52:03,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:03,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:52:03,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:52:03,914 INFO L87 Difference]: Start difference. First operand 412 states and 501 transitions. Second operand 10 states. [2020-11-07 06:52:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:07,907 INFO L93 Difference]: Finished difference Result 1573 states and 2156 transitions. [2020-11-07 06:52:07,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 06:52:07,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2020-11-07 06:52:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:07,938 INFO L225 Difference]: With dead ends: 1573 [2020-11-07 06:52:07,938 INFO L226 Difference]: Without dead ends: 1209 [2020-11-07 06:52:07,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2020-11-07 06:52:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-11-07 06:52:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 786. [2020-11-07 06:52:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-11-07 06:52:08,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 994 transitions. [2020-11-07 06:52:08,198 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 994 transitions. Word has length 185 [2020-11-07 06:52:08,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:08,199 INFO L481 AbstractCegarLoop]: Abstraction has 786 states and 994 transitions. [2020-11-07 06:52:08,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:52:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 994 transitions. [2020-11-07 06:52:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-07 06:52:08,205 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:08,206 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:52:08,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:52:08,206 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash 396419367, now seen corresponding path program 1 times [2020-11-07 06:52:08,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:08,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2118178076] [2020-11-07 06:52:08,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 06:52:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:52:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-11-07 06:52:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-11-07 06:52:08,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2118178076] [2020-11-07 06:52:08,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:08,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 06:52:08,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148632685] [2020-11-07 06:52:08,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:52:08,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:08,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:52:08,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:52:08,509 INFO L87 Difference]: Start difference. First operand 786 states and 994 transitions. Second operand 9 states. [2020-11-07 06:52:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:10,799 INFO L93 Difference]: Finished difference Result 1834 states and 2385 transitions. [2020-11-07 06:52:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 06:52:10,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 185 [2020-11-07 06:52:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:10,809 INFO L225 Difference]: With dead ends: 1834 [2020-11-07 06:52:10,810 INFO L226 Difference]: Without dead ends: 1094 [2020-11-07 06:52:10,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2020-11-07 06:52:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2020-11-07 06:52:10,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 780. [2020-11-07 06:52:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-11-07 06:52:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 983 transitions. [2020-11-07 06:52:11,002 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 983 transitions. Word has length 185 [2020-11-07 06:52:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:11,002 INFO L481 AbstractCegarLoop]: Abstraction has 780 states and 983 transitions. [2020-11-07 06:52:11,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:52:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 983 transitions. [2020-11-07 06:52:11,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-11-07 06:52:11,007 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:11,007 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:52:11,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:52:11,008 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:11,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1530509083, now seen corresponding path program 1 times [2020-11-07 06:52:11,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:11,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [128047510] [2020-11-07 06:52:11,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 06:52:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:52:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 06:52:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-11-07 06:52:11,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [128047510] [2020-11-07 06:52:11,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:11,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 06:52:11,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821300112] [2020-11-07 06:52:11,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:52:11,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:11,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:52:11,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:52:11,335 INFO L87 Difference]: Start difference. First operand 780 states and 983 transitions. Second operand 11 states. [2020-11-07 06:52:19,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:19,072 INFO L93 Difference]: Finished difference Result 4529 states and 6151 transitions. [2020-11-07 06:52:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-11-07 06:52:19,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 190 [2020-11-07 06:52:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:19,101 INFO L225 Difference]: With dead ends: 4529 [2020-11-07 06:52:19,101 INFO L226 Difference]: Without dead ends: 3794 [2020-11-07 06:52:19,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2020-11-07 06:52:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2020-11-07 06:52:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3005. [2020-11-07 06:52:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2020-11-07 06:52:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 3804 transitions. [2020-11-07 06:52:19,866 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 3804 transitions. Word has length 190 [2020-11-07 06:52:19,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:19,867 INFO L481 AbstractCegarLoop]: Abstraction has 3005 states and 3804 transitions. [2020-11-07 06:52:19,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:52:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 3804 transitions. [2020-11-07 06:52:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2020-11-07 06:52:19,878 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:19,878 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:52:19,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:52:19,879 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:19,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:19,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1734794295, now seen corresponding path program 1 times [2020-11-07 06:52:19,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:19,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [867095403] [2020-11-07 06:52:19,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:19,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-11-07 06:52:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:52:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-11-07 06:52:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-11-07 06:52:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:52:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2020-11-07 06:52:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:52:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2020-11-07 06:52:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2020-11-07 06:52:20,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [867095403] [2020-11-07 06:52:20,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:20,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 06:52:20,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156753343] [2020-11-07 06:52:20,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:52:20,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:20,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:52:20,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:52:20,347 INFO L87 Difference]: Start difference. First operand 3005 states and 3804 transitions. Second operand 10 states. [2020-11-07 06:52:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:23,108 INFO L93 Difference]: Finished difference Result 6209 states and 7876 transitions. [2020-11-07 06:52:23,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 06:52:23,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 297 [2020-11-07 06:52:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:23,137 INFO L225 Difference]: With dead ends: 6209 [2020-11-07 06:52:23,137 INFO L226 Difference]: Without dead ends: 3249 [2020-11-07 06:52:23,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2020-11-07 06:52:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2020-11-07 06:52:23,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 2383. [2020-11-07 06:52:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2383 states. [2020-11-07 06:52:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 2986 transitions. [2020-11-07 06:52:23,621 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 2986 transitions. Word has length 297 [2020-11-07 06:52:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:23,621 INFO L481 AbstractCegarLoop]: Abstraction has 2383 states and 2986 transitions. [2020-11-07 06:52:23,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:52:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 2986 transitions. [2020-11-07 06:52:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-11-07 06:52:23,627 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:23,628 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:52:23,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:52:23,628 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:23,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:23,629 INFO L82 PathProgramCache]: Analyzing trace with hash 873811227, now seen corresponding path program 1 times [2020-11-07 06:52:23,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:23,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1838817518] [2020-11-07 06:52:23,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 06:52:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:52:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 06:52:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:52:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:23,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:24,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:24,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 06:52:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:24,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2020-11-07 06:52:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:24,176 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-11-07 06:52:24,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1838817518] [2020-11-07 06:52:24,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:24,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 06:52:24,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257024872] [2020-11-07 06:52:24,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:52:24,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:24,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:52:24,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:52:24,180 INFO L87 Difference]: Start difference. First operand 2383 states and 2986 transitions. Second operand 13 states. [2020-11-07 06:52:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:30,016 INFO L93 Difference]: Finished difference Result 6964 states and 9081 transitions. [2020-11-07 06:52:30,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-07 06:52:30,016 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 233 [2020-11-07 06:52:30,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:30,048 INFO L225 Difference]: With dead ends: 6964 [2020-11-07 06:52:30,048 INFO L226 Difference]: Without dead ends: 4626 [2020-11-07 06:52:30,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=492, Invalid=1400, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 06:52:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2020-11-07 06:52:30,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 3629. [2020-11-07 06:52:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3629 states. [2020-11-07 06:52:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 4477 transitions. [2020-11-07 06:52:30,890 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 4477 transitions. Word has length 233 [2020-11-07 06:52:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:30,891 INFO L481 AbstractCegarLoop]: Abstraction has 3629 states and 4477 transitions. [2020-11-07 06:52:30,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:52:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 4477 transitions. [2020-11-07 06:52:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2020-11-07 06:52:30,901 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:30,901 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:52:30,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:52:30,902 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:30,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:30,902 INFO L82 PathProgramCache]: Analyzing trace with hash 584382557, now seen corresponding path program 1 times [2020-11-07 06:52:30,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:30,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [826634060] [2020-11-07 06:52:30,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-11-07 06:52:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:52:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-11-07 06:52:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2020-11-07 06:52:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2020-11-07 06:52:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:52:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:52:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2020-11-07 06:52:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 38 proven. 5 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2020-11-07 06:52:31,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [826634060] [2020-11-07 06:52:31,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:52:31,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:52:31,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075785611] [2020-11-07 06:52:31,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:52:31,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:31,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:52:31,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:52:31,329 INFO L87 Difference]: Start difference. First operand 3629 states and 4477 transitions. Second operand 12 states. [2020-11-07 06:52:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:39,759 INFO L93 Difference]: Finished difference Result 7176 states and 8978 transitions. [2020-11-07 06:52:39,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-11-07 06:52:39,765 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 262 [2020-11-07 06:52:39,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:39,793 INFO L225 Difference]: With dead ends: 7176 [2020-11-07 06:52:39,793 INFO L226 Difference]: Without dead ends: 4643 [2020-11-07 06:52:39,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=689, Invalid=3217, Unknown=0, NotChecked=0, Total=3906 [2020-11-07 06:52:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4643 states. [2020-11-07 06:52:40,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4643 to 3737. [2020-11-07 06:52:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3737 states. [2020-11-07 06:52:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3737 states to 3737 states and 4499 transitions. [2020-11-07 06:52:40,754 INFO L78 Accepts]: Start accepts. Automaton has 3737 states and 4499 transitions. Word has length 262 [2020-11-07 06:52:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:40,755 INFO L481 AbstractCegarLoop]: Abstraction has 3737 states and 4499 transitions. [2020-11-07 06:52:40,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:52:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3737 states and 4499 transitions. [2020-11-07 06:52:40,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2020-11-07 06:52:40,765 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:40,765 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 06:52:40,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:52:40,766 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:40,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:40,766 INFO L82 PathProgramCache]: Analyzing trace with hash -93130599, now seen corresponding path program 1 times [2020-11-07 06:52:40,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:40,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2015977472] [2020-11-07 06:52:40,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:40,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:40,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:40,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:40,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:40,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:40,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:40,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:40,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:40,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:40,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:40,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:52:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:40,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:52:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:40,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-11-07 06:52:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:41,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:52:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:41,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:41,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:41,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:41,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-11-07 06:52:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:41,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:52:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:41,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:41,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:41,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:52:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:41,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2020-11-07 06:52:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 59 proven. 14 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-11-07 06:52:41,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2015977472] [2020-11-07 06:52:41,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:52:41,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 06:52:41,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728644646] [2020-11-07 06:52:41,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:52:41,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:41,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:52:41,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:52:41,214 INFO L87 Difference]: Start difference. First operand 3737 states and 4499 transitions. Second operand 13 states. [2020-11-07 06:52:47,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:52:47,540 INFO L93 Difference]: Finished difference Result 8528 states and 10635 transitions. [2020-11-07 06:52:47,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-11-07 06:52:47,541 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 267 [2020-11-07 06:52:47,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:52:47,572 INFO L225 Difference]: With dead ends: 8528 [2020-11-07 06:52:47,572 INFO L226 Difference]: Without dead ends: 4836 [2020-11-07 06:52:47,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=532, Invalid=1630, Unknown=0, NotChecked=0, Total=2162 [2020-11-07 06:52:47,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4836 states. [2020-11-07 06:52:48,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4836 to 3921. [2020-11-07 06:52:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3921 states. [2020-11-07 06:52:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 4623 transitions. [2020-11-07 06:52:48,276 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 4623 transitions. Word has length 267 [2020-11-07 06:52:48,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:52:48,277 INFO L481 AbstractCegarLoop]: Abstraction has 3921 states and 4623 transitions. [2020-11-07 06:52:48,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:52:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 4623 transitions. [2020-11-07 06:52:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2020-11-07 06:52:48,285 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:52:48,285 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:52:48,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:52:48,285 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:52:48,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:52:48,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2145955759, now seen corresponding path program 1 times [2020-11-07 06:52:48,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:52:48,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1797176648] [2020-11-07 06:52:48,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:52:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,464 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-07 06:52:48,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:52:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:52:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:52:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:52:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:52:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:52:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:52:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:52:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:52:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-11-07 06:52:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:52:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:52:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-11-07 06:52:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:52:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:52:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:52:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:52:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-11-07 06:52:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:52:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-11-07 06:52:48,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1797176648] [2020-11-07 06:52:48,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:52:48,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 06:52:48,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113797587] [2020-11-07 06:52:48,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 06:52:48,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:52:48,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 06:52:48,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:52:48,788 INFO L87 Difference]: Start difference. First operand 3921 states and 4623 transitions. Second operand 17 states. [2020-11-07 06:53:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:00,206 INFO L93 Difference]: Finished difference Result 8117 states and 10043 transitions. [2020-11-07 06:53:00,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2020-11-07 06:53:00,207 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 269 [2020-11-07 06:53:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:00,246 INFO L225 Difference]: With dead ends: 8117 [2020-11-07 06:53:00,246 INFO L226 Difference]: Without dead ends: 4240 [2020-11-07 06:53:00,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1782, Invalid=8724, Unknown=0, NotChecked=0, Total=10506 [2020-11-07 06:53:00,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4240 states. [2020-11-07 06:53:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4240 to 3287. [2020-11-07 06:53:00,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3287 states. [2020-11-07 06:53:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 3761 transitions. [2020-11-07 06:53:01,006 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 3761 transitions. Word has length 269 [2020-11-07 06:53:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:01,007 INFO L481 AbstractCegarLoop]: Abstraction has 3287 states and 3761 transitions. [2020-11-07 06:53:01,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 06:53:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 3761 transitions. [2020-11-07 06:53:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2020-11-07 06:53:01,012 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:01,013 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:53:01,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:53:01,013 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:01,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:01,014 INFO L82 PathProgramCache]: Analyzing trace with hash -299533614, now seen corresponding path program 1 times [2020-11-07 06:53:01,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:01,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1004627881] [2020-11-07 06:53:01,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:53:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:53:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:53:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:53:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:53:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:53:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:53:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:53:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-11-07 06:53:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:53:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-11-07 06:53:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:53:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:53:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-11-07 06:53:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-11-07 06:53:01,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1004627881] [2020-11-07 06:53:01,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:01,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:53:01,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56258778] [2020-11-07 06:53:01,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:53:01,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:01,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:53:01,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:53:01,480 INFO L87 Difference]: Start difference. First operand 3287 states and 3761 transitions. Second operand 12 states. [2020-11-07 06:53:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:07,005 INFO L93 Difference]: Finished difference Result 7303 states and 8426 transitions. [2020-11-07 06:53:07,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-07 06:53:07,005 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 269 [2020-11-07 06:53:07,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:07,024 INFO L225 Difference]: With dead ends: 7303 [2020-11-07 06:53:07,025 INFO L226 Difference]: Without dead ends: 4600 [2020-11-07 06:53:07,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=328, Invalid=1154, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 06:53:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4600 states. [2020-11-07 06:53:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4600 to 3858. [2020-11-07 06:53:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3858 states. [2020-11-07 06:53:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 4431 transitions. [2020-11-07 06:53:07,792 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 4431 transitions. Word has length 269 [2020-11-07 06:53:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:07,793 INFO L481 AbstractCegarLoop]: Abstraction has 3858 states and 4431 transitions. [2020-11-07 06:53:07,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:53:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 4431 transitions. [2020-11-07 06:53:07,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2020-11-07 06:53:07,799 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:07,799 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:53:07,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:53:07,799 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:07,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1616846890, now seen corresponding path program 1 times [2020-11-07 06:53:07,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:07,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1170638776] [2020-11-07 06:53:07,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:07,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:07,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-07 06:53:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:07,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:53:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:07,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 06:53:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:07,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:53:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:07,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:53:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:07,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:07,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:07,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 06:53:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:07,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:53:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:07,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-07 06:53:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:07,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-07 06:53:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-11-07 06:53:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 06:53:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 06:53:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-11-07 06:53:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-07 06:53:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:53:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 06:53:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:53:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-11-07 06:53:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:53:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-11-07 06:53:08,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1170638776] [2020-11-07 06:53:08,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:53:08,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:53:08,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790252612] [2020-11-07 06:53:08,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:53:08,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:53:08,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:53:08,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:53:08,130 INFO L87 Difference]: Start difference. First operand 3858 states and 4431 transitions. Second operand 9 states. [2020-11-07 06:53:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:53:10,889 INFO L93 Difference]: Finished difference Result 7054 states and 8196 transitions. [2020-11-07 06:53:10,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 06:53:10,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 273 [2020-11-07 06:53:10,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:53:10,906 INFO L225 Difference]: With dead ends: 7054 [2020-11-07 06:53:10,906 INFO L226 Difference]: Without dead ends: 4606 [2020-11-07 06:53:10,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2020-11-07 06:53:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4606 states. [2020-11-07 06:53:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4606 to 3894. [2020-11-07 06:53:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3894 states. [2020-11-07 06:53:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3894 states to 3894 states and 4475 transitions. [2020-11-07 06:53:11,710 INFO L78 Accepts]: Start accepts. Automaton has 3894 states and 4475 transitions. Word has length 273 [2020-11-07 06:53:11,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:53:11,710 INFO L481 AbstractCegarLoop]: Abstraction has 3894 states and 4475 transitions. [2020-11-07 06:53:11,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:53:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3894 states and 4475 transitions. [2020-11-07 06:53:11,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2020-11-07 06:53:11,716 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:53:11,717 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:53:11,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 06:53:11,717 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:53:11,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:53:11,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1966525787, now seen corresponding path program 1 times [2020-11-07 06:53:11,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:53:11,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1052028583] [2020-11-07 06:53:11,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:53:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 06:53:11,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 06:53:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 06:53:11,764 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 06:53:11,898 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 06:53:11,899 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 06:53:11,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 06:53:12,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:53:12 BoogieIcfgContainer [2020-11-07 06:53:12,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:53:12,114 INFO L168 Benchmark]: Toolchain (without parser) took 73848.98 ms. Allocated memory was 152.0 MB in the beginning and 1.1 GB in the end (delta: 949.0 MB). Free memory was 128.3 MB in the beginning and 422.4 MB in the end (delta: -294.1 MB). Peak memory consumption was 656.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:53:12,115 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 152.0 MB. Free memory is still 126.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:53:12,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.06 ms. Allocated memory is still 152.0 MB. Free memory was 127.6 MB in the beginning and 114.9 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-07 06:53:12,121 INFO L168 Benchmark]: Boogie Preprocessor took 53.54 ms. Allocated memory is still 152.0 MB. Free memory was 114.7 MB in the beginning and 112.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 06:53:12,122 INFO L168 Benchmark]: RCFGBuilder took 942.73 ms. Allocated memory is still 152.0 MB. Free memory was 112.7 MB in the beginning and 106.0 MB in the end (delta: 6.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-11-07 06:53:12,125 INFO L168 Benchmark]: TraceAbstraction took 72504.15 ms. Allocated memory was 152.0 MB in the beginning and 1.1 GB in the end (delta: 949.0 MB). Free memory was 105.5 MB in the beginning and 422.4 MB in the end (delta: -316.9 MB). Peak memory consumption was 631.9 MB. Max. memory is 8.0 GB. [2020-11-07 06:53:12,133 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 152.0 MB. Free memory is still 126.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 337.06 ms. Allocated memory is still 152.0 MB. Free memory was 127.6 MB in the beginning and 114.9 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 53.54 ms. Allocated memory is still 152.0 MB. Free memory was 114.7 MB in the beginning and 112.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 942.73 ms. Allocated memory is still 152.0 MB. Free memory was 112.7 MB in the beginning and 106.0 MB in the end (delta: 6.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 72504.15 ms. Allocated memory was 152.0 MB in the beginning and 1.1 GB in the end (delta: 949.0 MB). Free memory was 105.5 MB in the beginning and 422.4 MB in the end (delta: -316.9 MB). Peak memory consumption was 631.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L16] int m_pc = 0; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=53, m_pc=0, m_st=56, T1_E=50, t1_i=64, t1_pc=54, t1_st=51, token=68] [L17] int t1_pc = 0; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=53, m_pc=0, m_st=56, T1_E=50, t1_i=64, t1_pc=0, t1_st=51, token=68] [L18] int m_st ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=53, m_pc=0, m_st=0, T1_E=50, t1_i=64, t1_pc=0, t1_st=51, token=68] [L19] int t1_st ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=53, m_pc=0, m_st=0, T1_E=50, t1_i=64, t1_pc=0, t1_st=0, token=68] [L20] int m_i ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=64, t1_pc=0, t1_st=0, token=68] [L21] int t1_i ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=0, t1_pc=0, t1_st=0, token=68] [L22] int M_E = 2; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=0, t1_pc=0, t1_st=0, token=68] [L23] int T1_E = 2; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=68] [L24] int E_M = 2; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=2, local=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=68] [L25] int E_1 = 2; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=2, E_M=2, local=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=68] [L29] int token ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=2, E_M=2, local=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L31] int local ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=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, token=0] [L477] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L481] CALL init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L392] m_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L393] t1_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L481] RET init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L482] CALL start_simulation() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L418] int kernel_st ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L419] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L420] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] kernel_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L425] FCALL update_channels() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L426] CALL init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L174] COND TRUE m_i == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L175] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L179] COND TRUE t1_i == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L180] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] RET init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L427] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L263] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L268] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L273] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L278] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L428] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L316] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L317] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L125] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L128] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L140] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L321] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=0, token=0] [L323] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L329] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L144] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L147] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L159] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=0, token=0] [L329] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=0, tmp___0=0, token=0] [L331] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L428] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L429] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L291] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L296] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L301] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L306] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L429] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L432] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L435] kernel_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L436] CALL eval() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L210] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L214] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L189] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L192] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L193] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L205] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, token=0] [L217] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, token=0] [L219] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L224] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L225] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L226] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L227] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L238] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L239] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L240] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L241] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L243] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L244] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=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(token)=0, E_1=2, E_M=2, local=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, token=0] [L92] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=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(token)=0, E_1=2, E_M=2, local=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, token=0] [L103] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=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(token)=0, E_1=2, E_M=2, local=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, token=0] [L105] t1_pc = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=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(token)=0, E_1=2, E_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=1, token=0] [L106] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=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(token)=0, E_1=2, E_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, token=0] [L244] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L214] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L217] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_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, token=0] [L189] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_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, token=0] [L192] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_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, token=0] [L193] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_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, token=0] [L205] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_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, token=0] [L217] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L217] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L219] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L224] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L225] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_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, tmp=1, tmp_ndt_2=1, token=0] [L226] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L227] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L229] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=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, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L230] CALL master() VAL [\old(E_1)=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(token)=0, E_1=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, token=0] [L34] int tmp_var = __VERIFIER_nondet_int(); VAL [\old(E_1)=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(token)=0, __VERIFIER_nondet_int()=0, E_1=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, tmp_var=0, token=0] [L36] COND TRUE m_pc == 0 VAL [\old(E_1)=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(token)=0, E_1=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, tmp_var=0, token=0] [L47] COND TRUE 1 VAL [\old(E_1)=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(token)=0, E_1=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, tmp_var=0, token=0] [L50] token = __VERIFIER_nondet_int() VAL [\old(E_1)=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(token)=0, __VERIFIER_nondet_int()=0, E_1=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, tmp_var=0, token=0] [L51] local = token VAL [\old(E_1)=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(token)=0, E_1=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, tmp_var=0, token=0] [L52] E_1 = 1 VAL [\old(E_1)=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(token)=0, E_1=1, 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, tmp_var=0, token=0] [L53] CALL immediate_notify() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L345] CALL activate_threads() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L316] int tmp ; VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L317] int tmp___0 ; VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L321] CALL, EXPR is_master_triggered() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L125] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L128] COND FALSE !(m_pc == 1) VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L138] __retres1 = 0 VAL [\old(E_1)=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(token)=0, __retres1=0, E_1=1, 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, token=0] [L140] return (__retres1); VAL [\old(E_1)=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(token)=0, \result=0, __retres1=0, E_1=1, 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, token=0] [L321] RET, EXPR is_master_triggered() VAL [\old(E_1)=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(token)=0, E_1=1, E_M=2, is_master_triggered()=0, 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, token=0] [L321] tmp = is_master_triggered() VAL [\old(E_1)=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(token)=0, E_1=1, E_M=2, is_master_triggered()=0, 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, tmp=0, token=0] [L323] COND FALSE !(\read(tmp)) VAL [\old(E_1)=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(token)=0, E_1=1, 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, tmp=0, token=0] [L329] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L144] int __retres1 ; VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L147] COND TRUE t1_pc == 1 VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L148] COND TRUE E_1 == 1 VAL [\old(E_1)=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(token)=0, E_1=1, 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, token=0] [L149] __retres1 = 1 VAL [\old(E_1)=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(token)=0, __retres1=1, E_1=1, 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, token=0] [L159] return (__retres1); VAL [\old(E_1)=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(token)=0, \result=1, __retres1=1, E_1=1, 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, token=0] [L329] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=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(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, 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, tmp=0, token=0] [L329] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=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(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, 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, tmp=0, tmp___0=1, token=0] [L331] COND TRUE \read(tmp___0) VAL [\old(E_1)=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(token)=0, E_1=1, 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, tmp=0, tmp___0=1, token=0] [L332] t1_st = 0 VAL [\old(E_1)=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(token)=0, E_1=1, 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=0, tmp=0, tmp___0=1, token=0] [L345] RET activate_threads() VAL [\old(E_1)=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(token)=0, E_1=1, 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=0, token=0] [L53] RET immediate_notify() VAL [\old(E_1)=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(token)=0, E_1=1, 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=0, tmp_var=0, token=0] [L54] E_1 = 2 VAL [\old(E_1)=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(token)=0, E_1=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=0, tmp_var=0, token=0] [L55] m_pc = 1 VAL [\old(E_1)=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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L56] m_st = 2 VAL [\old(E_1)=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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L230] RET master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L238] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L239] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, token=0] [L240] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L241] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L243] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L244] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L92] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L95] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L111] token += 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L113] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L345] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L316] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L317] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L125] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L128] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L129] COND TRUE E_M == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L130] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L140] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, \result=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L323] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L324] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L329] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L144] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L147] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L148] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L159] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, \result=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L329] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L329] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L331] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L345] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L113] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L114] E_M = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L105] t1_pc = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L106] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=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(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L244] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L214] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L217] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L189] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L192] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L193] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L205] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L217] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L217] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L219] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L224] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L225] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_2=1, token=1] [L226] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L227] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L229] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L230] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L34] int tmp_var = __VERIFIER_nondet_int(); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=1, __VERIFIER_nondet_int()=5, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L36] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L39] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L61] COND FALSE !(token != local + 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L66] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L67] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L72] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L73] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L74] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L75] CALL error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L12] CALL reach_error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L3] __assert_fail("0", "token_ring.01.cil-2.c", 3, "reach_error") VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \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(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 239 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 72.2s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 60.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3453 SDtfs, 18101 SDslu, 1883 SDs, 0 SdLazy, 22789 SolverSat, 6549 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1047 GetRequests, 602 SyntacticMatches, 2 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7832 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3921occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 7798 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2823 NumberOfCodeBlocks, 2823 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2538 ConstructedInterpolants, 0 QuantifiedInterpolants, 1311322 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 1219/1240 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...