java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 04:10:24,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 04:10:24,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 04:10:24,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 04:10:24,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 04:10:24,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 04:10:24,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 04:10:24,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 04:10:24,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 04:10:24,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 04:10:24,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 04:10:24,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 04:10:24,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 04:10:24,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 04:10:24,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 04:10:24,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 04:10:24,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 04:10:24,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 04:10:24,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 04:10:24,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 04:10:24,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 04:10:24,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 04:10:24,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 04:10:24,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 04:10:24,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 04:10:24,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 04:10:24,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 04:10:24,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 04:10:24,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 04:10:24,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 04:10:24,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 04:10:24,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 04:10:24,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 04:10:24,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 04:10:24,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 04:10:24,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 04:10:24,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 04:10:24,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 04:10:24,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 04:10:24,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 04:10:24,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 04:10:24,251 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 04:10:24,269 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 04:10:24,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 04:10:24,269 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 04:10:24,270 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 04:10:24,271 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 04:10:24,271 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 04:10:24,271 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 04:10:24,271 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 04:10:24,272 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 04:10:24,272 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 04:10:24,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 04:10:24,273 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 04:10:24,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 04:10:24,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 04:10:24,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 04:10:24,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 04:10:24,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 04:10:24,274 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 04:10:24,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 04:10:24,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 04:10:24,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 04:10:24,275 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 04:10:24,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 04:10:24,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:10:24,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 04:10:24,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 04:10:24,277 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 04:10:24,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 04:10:24,277 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 04:10:24,277 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 04:10:24,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 04:10:24,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 04:10:24,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 04:10:24,341 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 04:10:24,342 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 04:10:24,342 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-10-03 04:10:24,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fee447673/0ab343e4613e4f5a9e90f9bfffaafdc2/FLAG824adf2c3 [2019-10-03 04:10:24,872 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 04:10:24,873 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-10-03 04:10:24,891 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fee447673/0ab343e4613e4f5a9e90f9bfffaafdc2/FLAG824adf2c3 [2019-10-03 04:10:25,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fee447673/0ab343e4613e4f5a9e90f9bfffaafdc2 [2019-10-03 04:10:25,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 04:10:25,259 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 04:10:25,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 04:10:25,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 04:10:25,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 04:10:25,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:10:25" (1/1) ... [2019-10-03 04:10:25,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45070ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:25, skipping insertion in model container [2019-10-03 04:10:25,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:10:25" (1/1) ... [2019-10-03 04:10:25,275 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 04:10:25,309 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 04:10:25,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:10:25,567 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 04:10:25,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:10:25,746 INFO L192 MainTranslator]: Completed translation [2019-10-03 04:10:25,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:25 WrapperNode [2019-10-03 04:10:25,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 04:10:25,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 04:10:25,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 04:10:25,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 04:10:25,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:25" (1/1) ... [2019-10-03 04:10:25,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:25" (1/1) ... [2019-10-03 04:10:25,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:25" (1/1) ... [2019-10-03 04:10:25,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:25" (1/1) ... [2019-10-03 04:10:25,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:25" (1/1) ... [2019-10-03 04:10:25,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:25" (1/1) ... [2019-10-03 04:10:25,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:25" (1/1) ... [2019-10-03 04:10:25,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 04:10:25,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 04:10:25,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 04:10:25,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 04:10:25,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:10:25,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 04:10:25,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 04:10:25,869 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-03 04:10:25,870 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-03 04:10:25,870 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-03 04:10:25,870 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-03 04:10:25,870 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-03 04:10:25,870 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-03 04:10:25,870 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-03 04:10:25,871 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-03 04:10:25,871 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-03 04:10:25,871 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-03 04:10:25,871 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-03 04:10:25,871 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-03 04:10:25,871 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-03 04:10:25,872 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-03 04:10:25,872 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-03 04:10:25,872 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-03 04:10:25,872 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-03 04:10:25,872 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-03 04:10:25,872 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-03 04:10:25,873 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-03 04:10:25,873 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-03 04:10:25,873 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-03 04:10:25,873 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 04:10:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 04:10:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-03 04:10:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-03 04:10:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-03 04:10:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-03 04:10:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-03 04:10:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-03 04:10:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 04:10:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-03 04:10:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-03 04:10:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-03 04:10:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-03 04:10:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-03 04:10:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-03 04:10:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-03 04:10:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-03 04:10:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-03 04:10:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-03 04:10:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-03 04:10:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-03 04:10:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-03 04:10:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-03 04:10:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-03 04:10:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-03 04:10:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 04:10:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 04:10:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 04:10:26,507 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 04:10:26,508 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-03 04:10:26,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:10:26 BoogieIcfgContainer [2019-10-03 04:10:26,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 04:10:26,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 04:10:26,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 04:10:26,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 04:10:26,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 04:10:25" (1/3) ... [2019-10-03 04:10:26,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fa50ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:10:26, skipping insertion in model container [2019-10-03 04:10:26,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:25" (2/3) ... [2019-10-03 04:10:26,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fa50ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:10:26, skipping insertion in model container [2019-10-03 04:10:26,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:10:26" (3/3) ... [2019-10-03 04:10:26,520 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2019-10-03 04:10:26,529 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 04:10:26,538 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 04:10:26,555 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 04:10:26,589 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 04:10:26,590 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 04:10:26,590 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 04:10:26,590 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 04:10:26,590 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 04:10:26,591 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 04:10:26,591 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 04:10:26,591 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 04:10:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states. [2019-10-03 04:10:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:26,642 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:26,643 INFO L411 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] [2019-10-03 04:10:26,645 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:26,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:26,650 INFO L82 PathProgramCache]: Analyzing trace with hash -604727244, now seen corresponding path program 1 times [2019-10-03 04:10:26,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:26,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:26,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:26,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:26,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:27,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:27,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:27,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:27,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:27,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:27,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:27,089 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 5 states. [2019-10-03 04:10:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:27,737 INFO L93 Difference]: Finished difference Result 248 states and 352 transitions. [2019-10-03 04:10:27,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:27,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:10:27,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:27,770 INFO L225 Difference]: With dead ends: 248 [2019-10-03 04:10:27,770 INFO L226 Difference]: Without dead ends: 236 [2019-10-03 04:10:27,773 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:27,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-03 04:10:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 202. [2019-10-03 04:10:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-03 04:10:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 280 transitions. [2019-10-03 04:10:27,833 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 280 transitions. Word has length 106 [2019-10-03 04:10:27,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:27,834 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 280 transitions. [2019-10-03 04:10:27,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 280 transitions. [2019-10-03 04:10:27,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:27,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:27,838 INFO L411 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] [2019-10-03 04:10:27,838 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:27,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:27,839 INFO L82 PathProgramCache]: Analyzing trace with hash 720128950, now seen corresponding path program 1 times [2019-10-03 04:10:27,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:27,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:27,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:27,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:27,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:27,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:27,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:27,961 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:27,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:27,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:27,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:27,967 INFO L87 Difference]: Start difference. First operand 202 states and 280 transitions. Second operand 5 states. [2019-10-03 04:10:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:28,471 INFO L93 Difference]: Finished difference Result 236 states and 339 transitions. [2019-10-03 04:10:28,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:28,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:10:28,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:28,476 INFO L225 Difference]: With dead ends: 236 [2019-10-03 04:10:28,476 INFO L226 Difference]: Without dead ends: 236 [2019-10-03 04:10:28,477 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:28,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-03 04:10:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 202. [2019-10-03 04:10:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-03 04:10:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 279 transitions. [2019-10-03 04:10:28,498 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 279 transitions. Word has length 106 [2019-10-03 04:10:28,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:28,498 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 279 transitions. [2019-10-03 04:10:28,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 279 transitions. [2019-10-03 04:10:28,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:28,502 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:28,502 INFO L411 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] [2019-10-03 04:10:28,502 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:28,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:28,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2008080396, now seen corresponding path program 1 times [2019-10-03 04:10:28,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:28,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:28,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:28,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:28,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:28,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:28,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:28,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:28,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:28,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:28,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:28,615 INFO L87 Difference]: Start difference. First operand 202 states and 279 transitions. Second operand 5 states. [2019-10-03 04:10:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:29,083 INFO L93 Difference]: Finished difference Result 234 states and 334 transitions. [2019-10-03 04:10:29,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:29,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:10:29,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:29,088 INFO L225 Difference]: With dead ends: 234 [2019-10-03 04:10:29,088 INFO L226 Difference]: Without dead ends: 234 [2019-10-03 04:10:29,088 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:29,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-03 04:10:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 202. [2019-10-03 04:10:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-03 04:10:29,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 278 transitions. [2019-10-03 04:10:29,126 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 278 transitions. Word has length 106 [2019-10-03 04:10:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:29,127 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 278 transitions. [2019-10-03 04:10:29,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 278 transitions. [2019-10-03 04:10:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:29,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:29,135 INFO L411 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] [2019-10-03 04:10:29,136 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:29,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:29,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1229048822, now seen corresponding path program 1 times [2019-10-03 04:10:29,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:29,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:29,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:29,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:29,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:29,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:29,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:29,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:29,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:29,236 INFO L87 Difference]: Start difference. First operand 202 states and 278 transitions. Second operand 5 states. [2019-10-03 04:10:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:29,696 INFO L93 Difference]: Finished difference Result 252 states and 363 transitions. [2019-10-03 04:10:29,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:29,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:10:29,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:29,700 INFO L225 Difference]: With dead ends: 252 [2019-10-03 04:10:29,700 INFO L226 Difference]: Without dead ends: 252 [2019-10-03 04:10:29,700 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-10-03 04:10:29,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 202. [2019-10-03 04:10:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-03 04:10:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 277 transitions. [2019-10-03 04:10:29,716 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 277 transitions. Word has length 106 [2019-10-03 04:10:29,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:29,716 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 277 transitions. [2019-10-03 04:10:29,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 277 transitions. [2019-10-03 04:10:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:29,719 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:29,719 INFO L411 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] [2019-10-03 04:10:29,719 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:29,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:29,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1469288568, now seen corresponding path program 1 times [2019-10-03 04:10:29,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:29,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:29,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:29,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:29,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:29,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:29,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:29,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:29,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:29,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:29,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:29,895 INFO L87 Difference]: Start difference. First operand 202 states and 277 transitions. Second operand 5 states. [2019-10-03 04:10:30,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:30,320 INFO L93 Difference]: Finished difference Result 246 states and 353 transitions. [2019-10-03 04:10:30,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:30,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:10:30,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:30,324 INFO L225 Difference]: With dead ends: 246 [2019-10-03 04:10:30,324 INFO L226 Difference]: Without dead ends: 246 [2019-10-03 04:10:30,325 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-03 04:10:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 202. [2019-10-03 04:10:30,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-03 04:10:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 276 transitions. [2019-10-03 04:10:30,336 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 276 transitions. Word has length 106 [2019-10-03 04:10:30,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:30,337 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 276 transitions. [2019-10-03 04:10:30,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 276 transitions. [2019-10-03 04:10:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:30,338 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:30,339 INFO L411 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] [2019-10-03 04:10:30,339 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:30,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:30,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1986645066, now seen corresponding path program 1 times [2019-10-03 04:10:30,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:30,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:30,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:30,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:30,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:30,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:30,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:30,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:30,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:30,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:30,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:30,402 INFO L87 Difference]: Start difference. First operand 202 states and 276 transitions. Second operand 5 states. [2019-10-03 04:10:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:30,778 INFO L93 Difference]: Finished difference Result 248 states and 353 transitions. [2019-10-03 04:10:30,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:30,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:10:30,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:30,781 INFO L225 Difference]: With dead ends: 248 [2019-10-03 04:10:30,781 INFO L226 Difference]: Without dead ends: 248 [2019-10-03 04:10:30,782 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-03 04:10:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 202. [2019-10-03 04:10:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-03 04:10:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 275 transitions. [2019-10-03 04:10:30,792 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 275 transitions. Word has length 106 [2019-10-03 04:10:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:30,792 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 275 transitions. [2019-10-03 04:10:30,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 275 transitions. [2019-10-03 04:10:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:30,794 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:30,794 INFO L411 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] [2019-10-03 04:10:30,795 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:30,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:30,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1959579464, now seen corresponding path program 1 times [2019-10-03 04:10:30,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:30,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:30,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:30,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:30,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:30,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:30,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:30,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:30,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:30,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:30,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:30,868 INFO L87 Difference]: Start difference. First operand 202 states and 275 transitions. Second operand 5 states. [2019-10-03 04:10:31,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:31,315 INFO L93 Difference]: Finished difference Result 246 states and 348 transitions. [2019-10-03 04:10:31,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:31,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:10:31,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:31,319 INFO L225 Difference]: With dead ends: 246 [2019-10-03 04:10:31,319 INFO L226 Difference]: Without dead ends: 246 [2019-10-03 04:10:31,320 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-03 04:10:31,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 202. [2019-10-03 04:10:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-03 04:10:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 274 transitions. [2019-10-03 04:10:31,329 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 274 transitions. Word has length 106 [2019-10-03 04:10:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:31,330 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 274 transitions. [2019-10-03 04:10:31,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 274 transitions. [2019-10-03 04:10:31,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:31,331 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:31,331 INFO L411 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] [2019-10-03 04:10:31,332 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:31,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:31,332 INFO L82 PathProgramCache]: Analyzing trace with hash 258050934, now seen corresponding path program 1 times [2019-10-03 04:10:31,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:31,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:31,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:31,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:31,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:31,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:31,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:31,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:31,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:31,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:31,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:31,389 INFO L87 Difference]: Start difference. First operand 202 states and 274 transitions. Second operand 6 states. [2019-10-03 04:10:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:31,415 INFO L93 Difference]: Finished difference Result 218 states and 299 transitions. [2019-10-03 04:10:31,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:31,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2019-10-03 04:10:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:31,417 INFO L225 Difference]: With dead ends: 218 [2019-10-03 04:10:31,417 INFO L226 Difference]: Without dead ends: 218 [2019-10-03 04:10:31,418 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:10:31,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-03 04:10:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 207. [2019-10-03 04:10:31,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-10-03 04:10:31,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 279 transitions. [2019-10-03 04:10:31,426 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 279 transitions. Word has length 106 [2019-10-03 04:10:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:31,427 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 279 transitions. [2019-10-03 04:10:31,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 279 transitions. [2019-10-03 04:10:31,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:31,428 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:31,428 INFO L411 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] [2019-10-03 04:10:31,429 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:31,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:31,429 INFO L82 PathProgramCache]: Analyzing trace with hash -159345672, now seen corresponding path program 1 times [2019-10-03 04:10:31,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:31,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:31,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:31,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:31,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:31,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:31,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:31,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:31,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:31,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:31,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:31,488 INFO L87 Difference]: Start difference. First operand 207 states and 279 transitions. Second operand 6 states. [2019-10-03 04:10:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:31,514 INFO L93 Difference]: Finished difference Result 220 states and 299 transitions. [2019-10-03 04:10:31,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:31,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2019-10-03 04:10:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:31,518 INFO L225 Difference]: With dead ends: 220 [2019-10-03 04:10:31,518 INFO L226 Difference]: Without dead ends: 220 [2019-10-03 04:10:31,519 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:10:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-03 04:10:31,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 212. [2019-10-03 04:10:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-03 04:10:31,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2019-10-03 04:10:31,526 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 106 [2019-10-03 04:10:31,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:31,527 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2019-10-03 04:10:31,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:31,527 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2019-10-03 04:10:31,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:31,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:31,528 INFO L411 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] [2019-10-03 04:10:31,529 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:31,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:31,529 INFO L82 PathProgramCache]: Analyzing trace with hash 716673334, now seen corresponding path program 1 times [2019-10-03 04:10:31,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:31,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:31,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:31,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:31,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:31,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:31,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:31,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:31,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:31,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:31,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:31,590 INFO L87 Difference]: Start difference. First operand 212 states and 284 transitions. Second operand 6 states. [2019-10-03 04:10:31,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:31,621 INFO L93 Difference]: Finished difference Result 222 states and 299 transitions. [2019-10-03 04:10:31,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:31,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2019-10-03 04:10:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:31,625 INFO L225 Difference]: With dead ends: 222 [2019-10-03 04:10:31,625 INFO L226 Difference]: Without dead ends: 222 [2019-10-03 04:10:31,626 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:10:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-03 04:10:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2019-10-03 04:10:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-03 04:10:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2019-10-03 04:10:31,637 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 106 [2019-10-03 04:10:31,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:31,637 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2019-10-03 04:10:31,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2019-10-03 04:10:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:31,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:31,639 INFO L411 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] [2019-10-03 04:10:31,639 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:31,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1610159672, now seen corresponding path program 1 times [2019-10-03 04:10:31,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:31,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:31,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:31,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:31,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:31,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:31,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:31,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:31,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:31,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:31,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:31,709 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand 6 states. [2019-10-03 04:10:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:31,741 INFO L93 Difference]: Finished difference Result 224 states and 299 transitions. [2019-10-03 04:10:31,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:31,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2019-10-03 04:10:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:31,744 INFO L225 Difference]: With dead ends: 224 [2019-10-03 04:10:31,744 INFO L226 Difference]: Without dead ends: 224 [2019-10-03 04:10:31,745 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:10:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-03 04:10:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2019-10-03 04:10:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-10-03 04:10:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 294 transitions. [2019-10-03 04:10:31,756 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 294 transitions. Word has length 106 [2019-10-03 04:10:31,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:31,757 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 294 transitions. [2019-10-03 04:10:31,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 294 transitions. [2019-10-03 04:10:31,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:31,758 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:31,759 INFO L411 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] [2019-10-03 04:10:31,759 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:31,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:31,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1215792886, now seen corresponding path program 1 times [2019-10-03 04:10:31,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:31,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:31,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:31,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:31,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:31,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:31,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:31,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:31,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:31,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:31,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:31,852 INFO L87 Difference]: Start difference. First operand 222 states and 294 transitions. Second operand 5 states. [2019-10-03 04:10:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:32,343 INFO L93 Difference]: Finished difference Result 310 states and 408 transitions. [2019-10-03 04:10:32,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:32,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:10:32,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:32,345 INFO L225 Difference]: With dead ends: 310 [2019-10-03 04:10:32,345 INFO L226 Difference]: Without dead ends: 310 [2019-10-03 04:10:32,345 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:10:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-10-03 04:10:32,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 285. [2019-10-03 04:10:32,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-03 04:10:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 367 transitions. [2019-10-03 04:10:32,356 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 367 transitions. Word has length 106 [2019-10-03 04:10:32,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:32,357 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 367 transitions. [2019-10-03 04:10:32,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 367 transitions. [2019-10-03 04:10:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:32,358 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:32,358 INFO L411 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] [2019-10-03 04:10:32,359 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:32,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:32,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1490552500, now seen corresponding path program 1 times [2019-10-03 04:10:32,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:32,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:32,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:32,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:32,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:32,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:32,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:32,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:32,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:32,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:32,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:32,422 INFO L87 Difference]: Start difference. First operand 285 states and 367 transitions. Second operand 5 states. [2019-10-03 04:10:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:32,821 INFO L93 Difference]: Finished difference Result 285 states and 365 transitions. [2019-10-03 04:10:32,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:32,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:10:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:32,824 INFO L225 Difference]: With dead ends: 285 [2019-10-03 04:10:32,824 INFO L226 Difference]: Without dead ends: 285 [2019-10-03 04:10:32,825 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-03 04:10:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2019-10-03 04:10:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-03 04:10:32,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 365 transitions. [2019-10-03 04:10:32,836 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 365 transitions. Word has length 106 [2019-10-03 04:10:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:32,837 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 365 transitions. [2019-10-03 04:10:32,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 365 transitions. [2019-10-03 04:10:32,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:32,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:32,840 INFO L411 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] [2019-10-03 04:10:32,840 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:32,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:32,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2102814922, now seen corresponding path program 1 times [2019-10-03 04:10:32,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:32,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:32,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:32,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:32,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:32,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:32,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:32,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:32,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:32,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:32,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:32,936 INFO L87 Difference]: Start difference. First operand 285 states and 365 transitions. Second operand 5 states. [2019-10-03 04:10:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:33,285 INFO L93 Difference]: Finished difference Result 285 states and 363 transitions. [2019-10-03 04:10:33,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:33,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:10:33,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:33,288 INFO L225 Difference]: With dead ends: 285 [2019-10-03 04:10:33,288 INFO L226 Difference]: Without dead ends: 285 [2019-10-03 04:10:33,288 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:33,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-03 04:10:33,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2019-10-03 04:10:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-03 04:10:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 363 transitions. [2019-10-03 04:10:33,299 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 363 transitions. Word has length 106 [2019-10-03 04:10:33,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:33,299 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 363 transitions. [2019-10-03 04:10:33,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 363 transitions. [2019-10-03 04:10:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:33,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:33,301 INFO L411 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] [2019-10-03 04:10:33,301 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:33,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:33,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2080182668, now seen corresponding path program 1 times [2019-10-03 04:10:33,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:33,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:33,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:33,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:33,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:33,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:33,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:33,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:33,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:33,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:33,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:33,365 INFO L87 Difference]: Start difference. First operand 285 states and 363 transitions. Second operand 5 states. [2019-10-03 04:10:33,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:33,841 INFO L93 Difference]: Finished difference Result 386 states and 496 transitions. [2019-10-03 04:10:33,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:33,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:10:33,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:33,844 INFO L225 Difference]: With dead ends: 386 [2019-10-03 04:10:33,844 INFO L226 Difference]: Without dead ends: 386 [2019-10-03 04:10:33,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:10:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-10-03 04:10:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 368. [2019-10-03 04:10:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-10-03 04:10:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 466 transitions. [2019-10-03 04:10:33,857 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 466 transitions. Word has length 106 [2019-10-03 04:10:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:33,857 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 466 transitions. [2019-10-03 04:10:33,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 466 transitions. [2019-10-03 04:10:33,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:33,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:33,859 INFO L411 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] [2019-10-03 04:10:33,860 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:33,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:33,860 INFO L82 PathProgramCache]: Analyzing trace with hash -693979274, now seen corresponding path program 1 times [2019-10-03 04:10:33,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:33,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:33,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:33,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:33,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:33,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:33,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:33,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:33,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:33,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:33,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:33,915 INFO L87 Difference]: Start difference. First operand 368 states and 466 transitions. Second operand 5 states. [2019-10-03 04:10:34,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:34,570 INFO L93 Difference]: Finished difference Result 511 states and 654 transitions. [2019-10-03 04:10:34,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:34,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:10:34,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:34,574 INFO L225 Difference]: With dead ends: 511 [2019-10-03 04:10:34,574 INFO L226 Difference]: Without dead ends: 511 [2019-10-03 04:10:34,577 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:10:34,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-10-03 04:10:34,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 419. [2019-10-03 04:10:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-10-03 04:10:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 522 transitions. [2019-10-03 04:10:34,600 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 522 transitions. Word has length 106 [2019-10-03 04:10:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:34,601 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 522 transitions. [2019-10-03 04:10:34,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 522 transitions. [2019-10-03 04:10:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:34,603 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:34,603 INFO L411 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] [2019-10-03 04:10:34,604 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:34,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:34,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1203452364, now seen corresponding path program 1 times [2019-10-03 04:10:34,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:34,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:34,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:34,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:34,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:34,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:34,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:34,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:34,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:34,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:34,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:34,686 INFO L87 Difference]: Start difference. First operand 419 states and 522 transitions. Second operand 5 states. [2019-10-03 04:10:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:35,192 INFO L93 Difference]: Finished difference Result 533 states and 673 transitions. [2019-10-03 04:10:35,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:35,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:10:35,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:35,196 INFO L225 Difference]: With dead ends: 533 [2019-10-03 04:10:35,196 INFO L226 Difference]: Without dead ends: 533 [2019-10-03 04:10:35,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:10:35,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-03 04:10:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 460. [2019-10-03 04:10:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-10-03 04:10:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 564 transitions. [2019-10-03 04:10:35,213 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 564 transitions. Word has length 106 [2019-10-03 04:10:35,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:35,213 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 564 transitions. [2019-10-03 04:10:35,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 564 transitions. [2019-10-03 04:10:35,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:35,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:35,215 INFO L411 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] [2019-10-03 04:10:35,216 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:35,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:35,216 INFO L82 PathProgramCache]: Analyzing trace with hash 719775670, now seen corresponding path program 1 times [2019-10-03 04:10:35,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:35,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:35,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:35,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:35,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:35,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:35,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:35,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:35,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:35,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:35,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:35,279 INFO L87 Difference]: Start difference. First operand 460 states and 564 transitions. Second operand 5 states. [2019-10-03 04:10:35,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:35,820 INFO L93 Difference]: Finished difference Result 538 states and 670 transitions. [2019-10-03 04:10:35,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:35,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-03 04:10:35,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:35,826 INFO L225 Difference]: With dead ends: 538 [2019-10-03 04:10:35,826 INFO L226 Difference]: Without dead ends: 538 [2019-10-03 04:10:35,827 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:10:35,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-10-03 04:10:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 491. [2019-10-03 04:10:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-10-03 04:10:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 592 transitions. [2019-10-03 04:10:35,849 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 592 transitions. Word has length 106 [2019-10-03 04:10:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:35,849 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 592 transitions. [2019-10-03 04:10:35,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 592 transitions. [2019-10-03 04:10:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 04:10:35,852 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:35,852 INFO L411 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] [2019-10-03 04:10:35,852 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:35,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:35,853 INFO L82 PathProgramCache]: Analyzing trace with hash 860324280, now seen corresponding path program 1 times [2019-10-03 04:10:35,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:35,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:35,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:35,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:35,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:35,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:35,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:10:35,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:35,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:10:35,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:10:35,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:35,940 INFO L87 Difference]: Start difference. First operand 491 states and 592 transitions. Second operand 3 states. [2019-10-03 04:10:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:35,967 INFO L93 Difference]: Finished difference Result 928 states and 1128 transitions. [2019-10-03 04:10:35,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:10:35,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-03 04:10:35,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:35,974 INFO L225 Difference]: With dead ends: 928 [2019-10-03 04:10:35,975 INFO L226 Difference]: Without dead ends: 928 [2019-10-03 04:10:35,975 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:10:35,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-10-03 04:10:36,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 927. [2019-10-03 04:10:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-10-03 04:10:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1127 transitions. [2019-10-03 04:10:36,005 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1127 transitions. Word has length 106 [2019-10-03 04:10:36,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:36,005 INFO L475 AbstractCegarLoop]: Abstraction has 927 states and 1127 transitions. [2019-10-03 04:10:36,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:10:36,005 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1127 transitions. [2019-10-03 04:10:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-03 04:10:36,009 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:36,009 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:10:36,009 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:36,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:36,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1778904697, now seen corresponding path program 1 times [2019-10-03 04:10:36,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:36,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:36,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:36,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:36,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-03 04:10:36,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:10:36,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:10:36,097 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2019-10-03 04:10:36,099 INFO L207 CegarAbsIntRunner]: [87], [92], [106], [109], [112], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [181], [183], [185], [186], [237], [238], [240], [245], [248], [253], [256], [259], [261], [264], [269], [271], [272], [275], [294], [295], [296], [299], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [515], [528], [541], [547], [548], [562], [564], [597], [598], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:10:36,161 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:10:36,161 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:10:36,479 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:10:36,481 INFO L272 AbstractInterpreter]: Visited 117 different actions 158 times. Never merged. Never widened. Performed 640 root evaluator evaluations with a maximum evaluation depth of 4. Performed 640 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 52 variables. [2019-10-03 04:10:36,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:36,485 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:10:36,766 INFO L227 lantSequenceWeakener]: Weakened 162 states. On average, predicates are now at 75.23% of their original sizes. [2019-10-03 04:10:36,766 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:10:38,528 INFO L420 sIntCurrentIteration]: We unified 171 AI predicates to 171 [2019-10-03 04:10:38,529 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:10:38,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:10:38,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [4] total 68 [2019-10-03 04:10:38,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:38,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-03 04:10:38,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-03 04:10:38,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=3918, Unknown=0, NotChecked=0, Total=4290 [2019-10-03 04:10:38,532 INFO L87 Difference]: Start difference. First operand 927 states and 1127 transitions. Second operand 66 states. [2019-10-03 04:11:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:06,516 INFO L93 Difference]: Finished difference Result 1346 states and 1580 transitions. [2019-10-03 04:11:06,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-03 04:11:06,516 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 172 [2019-10-03 04:11:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:06,524 INFO L225 Difference]: With dead ends: 1346 [2019-10-03 04:11:06,524 INFO L226 Difference]: Without dead ends: 1346 [2019-10-03 04:11:06,529 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5166 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1569, Invalid=15461, Unknown=0, NotChecked=0, Total=17030 [2019-10-03 04:11:06,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2019-10-03 04:11:06,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1328. [2019-10-03 04:11:06,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2019-10-03 04:11:06,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1561 transitions. [2019-10-03 04:11:06,563 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1561 transitions. Word has length 172 [2019-10-03 04:11:06,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:06,564 INFO L475 AbstractCegarLoop]: Abstraction has 1328 states and 1561 transitions. [2019-10-03 04:11:06,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-03 04:11:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1561 transitions. [2019-10-03 04:11:06,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-03 04:11:06,567 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:06,567 INFO L411 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, 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] [2019-10-03 04:11:06,568 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:06,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:06,568 INFO L82 PathProgramCache]: Analyzing trace with hash -270656328, now seen corresponding path program 1 times [2019-10-03 04:11:06,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:06,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:06,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:06,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:06,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-03 04:11:06,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:06,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:11:06,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:06,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:11:06,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:11:06,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:11:06,652 INFO L87 Difference]: Start difference. First operand 1328 states and 1561 transitions. Second operand 5 states. [2019-10-03 04:11:07,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:07,279 INFO L93 Difference]: Finished difference Result 2224 states and 2712 transitions. [2019-10-03 04:11:07,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 04:11:07,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-10-03 04:11:07,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:07,290 INFO L225 Difference]: With dead ends: 2224 [2019-10-03 04:11:07,290 INFO L226 Difference]: Without dead ends: 1864 [2019-10-03 04:11:07,291 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:11:07,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2019-10-03 04:11:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1789. [2019-10-03 04:11:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1789 states. [2019-10-03 04:11:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2128 transitions. [2019-10-03 04:11:07,343 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2128 transitions. Word has length 178 [2019-10-03 04:11:07,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:07,343 INFO L475 AbstractCegarLoop]: Abstraction has 1789 states and 2128 transitions. [2019-10-03 04:11:07,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:11:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2128 transitions. [2019-10-03 04:11:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-03 04:11:07,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:07,348 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:11:07,349 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:07,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:07,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1409136633, now seen corresponding path program 1 times [2019-10-03 04:11:07,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:07,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:07,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:07,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:07,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-03 04:11:07,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:11:07,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:11:07,455 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2019-10-03 04:11:07,456 INFO L207 CegarAbsIntRunner]: [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [506], [512], [519], [525], [532], [535], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:11:07,460 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:11:07,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:11:07,520 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:11:07,520 INFO L272 AbstractInterpreter]: Visited 123 different actions 163 times. Never merged. Never widened. Performed 709 root evaluator evaluations with a maximum evaluation depth of 4. Performed 709 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 54 variables. [2019-10-03 04:11:07,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:07,521 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:11:07,680 INFO L227 lantSequenceWeakener]: Weakened 170 states. On average, predicates are now at 74.15% of their original sizes. [2019-10-03 04:11:07,680 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:11:10,134 INFO L420 sIntCurrentIteration]: We unified 225 AI predicates to 225 [2019-10-03 04:11:10,134 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:11:10,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:11:10,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [70] imperfect sequences [6] total 74 [2019-10-03 04:11:10,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:10,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-03 04:11:10,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-03 04:11:10,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=4417, Unknown=0, NotChecked=0, Total=4830 [2019-10-03 04:11:10,138 INFO L87 Difference]: Start difference. First operand 1789 states and 2128 transitions. Second operand 70 states. [2019-10-03 04:11:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:37,189 INFO L93 Difference]: Finished difference Result 1835 states and 2186 transitions. [2019-10-03 04:11:37,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-03 04:11:37,190 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 226 [2019-10-03 04:11:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:37,199 INFO L225 Difference]: With dead ends: 1835 [2019-10-03 04:11:37,199 INFO L226 Difference]: Without dead ends: 1835 [2019-10-03 04:11:37,205 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5978 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1642, Invalid=18380, Unknown=0, NotChecked=0, Total=20022 [2019-10-03 04:11:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-10-03 04:11:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1792. [2019-10-03 04:11:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2019-10-03 04:11:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2132 transitions. [2019-10-03 04:11:37,290 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2132 transitions. Word has length 226 [2019-10-03 04:11:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:37,291 INFO L475 AbstractCegarLoop]: Abstraction has 1792 states and 2132 transitions. [2019-10-03 04:11:37,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-03 04:11:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2132 transitions. [2019-10-03 04:11:37,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-03 04:11:37,297 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:37,297 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:11:37,297 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:37,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:37,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1877939411, now seen corresponding path program 1 times [2019-10-03 04:11:37,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:37,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:37,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:37,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:37,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-03 04:11:37,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:11:37,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:11:37,421 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2019-10-03 04:11:37,422 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [506], [509], [528], [532], [535], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [631], [632], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:11:37,436 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:11:37,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:11:37,485 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:11:37,487 INFO L272 AbstractInterpreter]: Visited 124 different actions 164 times. Never merged. Never widened. Performed 698 root evaluator evaluations with a maximum evaluation depth of 4. Performed 698 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 52 variables. [2019-10-03 04:11:37,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:37,487 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:11:37,606 INFO L227 lantSequenceWeakener]: Weakened 171 states. On average, predicates are now at 74.12% of their original sizes. [2019-10-03 04:11:37,606 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:11:39,644 INFO L420 sIntCurrentIteration]: We unified 230 AI predicates to 230 [2019-10-03 04:11:39,645 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:11:39,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:11:39,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [68] imperfect sequences [5] total 71 [2019-10-03 04:11:39,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:39,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-03 04:11:39,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-03 04:11:39,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=4153, Unknown=0, NotChecked=0, Total=4556 [2019-10-03 04:11:39,648 INFO L87 Difference]: Start difference. First operand 1792 states and 2132 transitions. Second operand 68 states. [2019-10-03 04:12:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:11,187 INFO L93 Difference]: Finished difference Result 2061 states and 2433 transitions. [2019-10-03 04:12:11,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-03 04:12:11,187 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 231 [2019-10-03 04:12:11,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:11,197 INFO L225 Difference]: With dead ends: 2061 [2019-10-03 04:12:11,197 INFO L226 Difference]: Without dead ends: 2061 [2019-10-03 04:12:11,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5493 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1576, Invalid=16784, Unknown=0, NotChecked=0, Total=18360 [2019-10-03 04:12:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2019-10-03 04:12:11,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 2035. [2019-10-03 04:12:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-10-03 04:12:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2404 transitions. [2019-10-03 04:12:11,258 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2404 transitions. Word has length 231 [2019-10-03 04:12:11,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:11,258 INFO L475 AbstractCegarLoop]: Abstraction has 2035 states and 2404 transitions. [2019-10-03 04:12:11,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-03 04:12:11,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2404 transitions. [2019-10-03 04:12:11,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-03 04:12:11,264 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:11,264 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:12:11,264 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:11,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:11,265 INFO L82 PathProgramCache]: Analyzing trace with hash -51716659, now seen corresponding path program 1 times [2019-10-03 04:12:11,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:11,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:11,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:11,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:11,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-03 04:12:11,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:11,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:12:11,357 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2019-10-03 04:12:11,358 INFO L207 CegarAbsIntRunner]: [33], [36], [47], [49], [51], [53], [57], [60], [76], [78], [86], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [506], [512], [519], [522], [532], [535], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [633], [634], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:12:11,365 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:12:11,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:12:11,399 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:12:11,400 INFO L272 AbstractInterpreter]: Visited 129 different actions 169 times. Never merged. Never widened. Performed 761 root evaluator evaluations with a maximum evaluation depth of 4. Performed 761 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 54 variables. [2019-10-03 04:12:11,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:11,400 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:12:11,502 INFO L227 lantSequenceWeakener]: Weakened 176 states. On average, predicates are now at 74.52% of their original sizes. [2019-10-03 04:12:11,502 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:12:13,663 INFO L420 sIntCurrentIteration]: We unified 231 AI predicates to 231 [2019-10-03 04:12:13,663 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:12:13,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:12:13,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [72] imperfect sequences [5] total 75 [2019-10-03 04:12:13,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:13,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-03 04:12:13,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-03 04:12:13,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=4693, Unknown=0, NotChecked=0, Total=5112 [2019-10-03 04:12:13,665 INFO L87 Difference]: Start difference. First operand 2035 states and 2404 transitions. Second operand 72 states. [2019-10-03 04:12:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:47,922 INFO L93 Difference]: Finished difference Result 2351 states and 2777 transitions. [2019-10-03 04:12:47,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-03 04:12:47,923 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 232 [2019-10-03 04:12:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:47,933 INFO L225 Difference]: With dead ends: 2351 [2019-10-03 04:12:47,934 INFO L226 Difference]: Without dead ends: 2351 [2019-10-03 04:12:47,935 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6059 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1633, Invalid=18673, Unknown=0, NotChecked=0, Total=20306 [2019-10-03 04:12:47,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2019-10-03 04:12:47,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 2303. [2019-10-03 04:12:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2303 states. [2019-10-03 04:12:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 2714 transitions. [2019-10-03 04:12:47,992 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 2714 transitions. Word has length 232 [2019-10-03 04:12:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:47,992 INFO L475 AbstractCegarLoop]: Abstraction has 2303 states and 2714 transitions. [2019-10-03 04:12:47,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-03 04:12:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2714 transitions. [2019-10-03 04:12:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-03 04:12:47,998 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:47,999 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:12:47,999 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash 605357581, now seen corresponding path program 1 times [2019-10-03 04:12:48,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:48,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:48,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:48,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:48,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-03 04:12:48,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:48,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:12:48,094 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2019-10-03 04:12:48,094 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [506], [509], [519], [525], [532], [535], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [631], [632], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:12:48,096 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:12:48,096 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:12:48,126 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:12:48,127 INFO L272 AbstractInterpreter]: Visited 129 different actions 169 times. Never merged. Never widened. Performed 761 root evaluator evaluations with a maximum evaluation depth of 4. Performed 761 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 54 variables. [2019-10-03 04:12:48,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:48,127 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:12:48,262 INFO L227 lantSequenceWeakener]: Weakened 176 states. On average, predicates are now at 74.45% of their original sizes. [2019-10-03 04:12:48,262 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:12:50,909 INFO L420 sIntCurrentIteration]: We unified 231 AI predicates to 231 [2019-10-03 04:12:50,909 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:12:50,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:12:50,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [72] imperfect sequences [5] total 75 [2019-10-03 04:12:50,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:50,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-03 04:12:50,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-03 04:12:50,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=417, Invalid=4695, Unknown=0, NotChecked=0, Total=5112 [2019-10-03 04:12:50,911 INFO L87 Difference]: Start difference. First operand 2303 states and 2714 transitions. Second operand 72 states. [2019-10-03 04:13:26,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:13:26,380 INFO L93 Difference]: Finished difference Result 2357 states and 2784 transitions. [2019-10-03 04:13:26,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-03 04:13:26,380 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 232 [2019-10-03 04:13:26,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:13:26,390 INFO L225 Difference]: With dead ends: 2357 [2019-10-03 04:13:26,391 INFO L226 Difference]: Without dead ends: 2357 [2019-10-03 04:13:26,392 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6080 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1613, Invalid=18693, Unknown=0, NotChecked=0, Total=20306 [2019-10-03 04:13:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2019-10-03 04:13:26,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2312. [2019-10-03 04:13:26,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-10-03 04:13:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2727 transitions. [2019-10-03 04:13:26,446 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2727 transitions. Word has length 232 [2019-10-03 04:13:26,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:13:26,446 INFO L475 AbstractCegarLoop]: Abstraction has 2312 states and 2727 transitions. [2019-10-03 04:13:26,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-03 04:13:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2727 transitions. [2019-10-03 04:13:26,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-03 04:13:26,453 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:13:26,453 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:13:26,453 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:13:26,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:13:26,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1126400173, now seen corresponding path program 1 times [2019-10-03 04:13:26,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:13:26,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:26,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:13:26,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:13:26,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:13:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:13:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-03 04:13:26,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:13:26,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:13:26,559 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 239 with the following transitions: [2019-10-03 04:13:26,560 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [60], [76], [78], [86], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [506], [509], [519], [522], [532], [535], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [631], [632], [633], [634], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:13:26,563 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:13:26,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:13:26,605 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:13:26,605 INFO L272 AbstractInterpreter]: Visited 135 different actions 175 times. Never merged. Never widened. Performed 813 root evaluator evaluations with a maximum evaluation depth of 4. Performed 813 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 54 variables. [2019-10-03 04:13:26,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:13:26,606 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:13:26,700 INFO L227 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 74.8% of their original sizes. [2019-10-03 04:13:26,700 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:13:28,915 INFO L420 sIntCurrentIteration]: We unified 237 AI predicates to 237 [2019-10-03 04:13:28,916 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:13:28,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:13:28,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [74] imperfect sequences [5] total 77 [2019-10-03 04:13:28,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:13:28,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-10-03 04:13:28,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-10-03 04:13:28,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=4979, Unknown=0, NotChecked=0, Total=5402 [2019-10-03 04:13:28,919 INFO L87 Difference]: Start difference. First operand 2312 states and 2727 transitions. Second operand 74 states. [2019-10-03 04:14:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:14:25,983 INFO L93 Difference]: Finished difference Result 2632 states and 3104 transitions. [2019-10-03 04:14:25,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-03 04:14:25,983 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 238 [2019-10-03 04:14:25,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:14:25,994 INFO L225 Difference]: With dead ends: 2632 [2019-10-03 04:14:25,994 INFO L226 Difference]: Without dead ends: 2632 [2019-10-03 04:14:25,996 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6165 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1609, Invalid=18983, Unknown=0, NotChecked=0, Total=20592 [2019-10-03 04:14:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2019-10-03 04:14:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 2576. [2019-10-03 04:14:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-10-03 04:14:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 3030 transitions. [2019-10-03 04:14:26,070 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 3030 transitions. Word has length 238 [2019-10-03 04:14:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:14:26,071 INFO L475 AbstractCegarLoop]: Abstraction has 2576 states and 3030 transitions. [2019-10-03 04:14:26,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-10-03 04:14:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3030 transitions. [2019-10-03 04:14:26,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-03 04:14:26,077 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:14:26,078 INFO L411 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, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:14:26,078 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:14:26,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:14:26,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1124629372, now seen corresponding path program 1 times [2019-10-03 04:14:26,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:14:26,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:14:26,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:14:26,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:14:26,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:14:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:14:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-03 04:14:26,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:14:26,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:14:26,167 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 246 with the following transitions: [2019-10-03 04:14:26,168 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [499], [506], [509], [515], [528], [532], [535], [541], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [631], [632], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:14:26,169 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:14:26,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:14:26,223 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:14:26,224 INFO L272 AbstractInterpreter]: Visited 126 different actions 176 times. Merged at 4 different actions 4 times. Never widened. Performed 758 root evaluator evaluations with a maximum evaluation depth of 4. Performed 758 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 52 variables. [2019-10-03 04:14:26,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:14:26,224 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:14:26,374 INFO L227 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 74.68% of their original sizes. [2019-10-03 04:14:26,375 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:14:28,383 INFO L420 sIntCurrentIteration]: We unified 244 AI predicates to 244 [2019-10-03 04:14:28,383 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:14:28,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:14:28,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [72] imperfect sequences [4] total 74 [2019-10-03 04:14:28,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:14:28,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-03 04:14:28,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-03 04:14:28,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=4605, Unknown=0, NotChecked=0, Total=5112 [2019-10-03 04:14:28,386 INFO L87 Difference]: Start difference. First operand 2576 states and 3030 transitions. Second operand 72 states. [2019-10-03 04:15:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:15:06,376 INFO L93 Difference]: Finished difference Result 3458 states and 3990 transitions. [2019-10-03 04:15:06,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-10-03 04:15:06,376 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 245 [2019-10-03 04:15:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:15:06,392 INFO L225 Difference]: With dead ends: 3458 [2019-10-03 04:15:06,392 INFO L226 Difference]: Without dead ends: 3458 [2019-10-03 04:15:06,394 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7259 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2123, Invalid=21133, Unknown=0, NotChecked=0, Total=23256 [2019-10-03 04:15:06,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2019-10-03 04:15:06,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3432. [2019-10-03 04:15:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3432 states. [2019-10-03 04:15:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 3959 transitions. [2019-10-03 04:15:06,492 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 3959 transitions. Word has length 245 [2019-10-03 04:15:06,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:15:06,493 INFO L475 AbstractCegarLoop]: Abstraction has 3432 states and 3959 transitions. [2019-10-03 04:15:06,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-03 04:15:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 3959 transitions. [2019-10-03 04:15:06,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-03 04:15:06,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:15:06,499 INFO L411 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, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:15:06,500 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:15:06,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:06,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2033746028, now seen corresponding path program 1 times [2019-10-03 04:15:06,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:15:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:06,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:15:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:06,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:15:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:15:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 35 proven. 13 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-03 04:15:06,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:15:06,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:15:06,604 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2019-10-03 04:15:06,604 INFO L207 CegarAbsIntRunner]: [33], [36], [47], [49], [51], [53], [57], [60], [76], [78], [86], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [499], [506], [512], [515], [519], [522], [528], [532], [535], [541], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [633], [634], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:15:06,607 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:15:06,607 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:15:06,660 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:15:06,660 INFO L272 AbstractInterpreter]: Visited 133 different actions 190 times. Merged at 8 different actions 8 times. Never widened. Performed 887 root evaluator evaluations with a maximum evaluation depth of 4. Performed 887 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 54 variables. [2019-10-03 04:15:06,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:06,661 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:15:06,875 INFO L227 lantSequenceWeakener]: Weakened 190 states. On average, predicates are now at 75.01% of their original sizes. [2019-10-03 04:15:06,875 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:15:09,078 INFO L420 sIntCurrentIteration]: We unified 245 AI predicates to 245 [2019-10-03 04:15:09,079 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:15:09,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:15:09,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [76] imperfect sequences [4] total 78 [2019-10-03 04:15:09,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:15:09,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-03 04:15:09,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-03 04:15:09,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=5177, Unknown=0, NotChecked=0, Total=5700 [2019-10-03 04:15:09,081 INFO L87 Difference]: Start difference. First operand 3432 states and 3959 transitions. Second operand 76 states. [2019-10-03 04:15:53,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:15:53,052 INFO L93 Difference]: Finished difference Result 4885 states and 5597 transitions. [2019-10-03 04:15:53,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-10-03 04:15:53,052 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 246 [2019-10-03 04:15:53,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:15:53,071 INFO L225 Difference]: With dead ends: 4885 [2019-10-03 04:15:53,072 INFO L226 Difference]: Without dead ends: 4885 [2019-10-03 04:15:53,073 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8823 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2378, Invalid=25344, Unknown=0, NotChecked=0, Total=27722 [2019-10-03 04:15:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4885 states. [2019-10-03 04:15:53,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4885 to 4801. [2019-10-03 04:15:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4801 states. [2019-10-03 04:15:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 5487 transitions. [2019-10-03 04:15:53,201 INFO L78 Accepts]: Start accepts. Automaton has 4801 states and 5487 transitions. Word has length 246 [2019-10-03 04:15:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:15:53,201 INFO L475 AbstractCegarLoop]: Abstraction has 4801 states and 5487 transitions. [2019-10-03 04:15:53,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-10-03 04:15:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4801 states and 5487 transitions. [2019-10-03 04:15:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-03 04:15:53,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:15:53,211 INFO L411 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:15:53,211 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:15:53,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:53,211 INFO L82 PathProgramCache]: Analyzing trace with hash 639785407, now seen corresponding path program 1 times [2019-10-03 04:15:53,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:15:53,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:53,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:15:53,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:15:53,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:15:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:15:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-10-03 04:15:53,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:15:53,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:15:53,658 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2019-10-03 04:15:53,658 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [277], [280], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [502], [506], [512], [515], [519], [525], [528], [532], [535], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:15:53,660 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:15:53,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:15:53,729 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:15:53,730 INFO L272 AbstractInterpreter]: Visited 137 different actions 252 times. Merged at 15 different actions 20 times. Never widened. Performed 1159 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1159 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 54 variables. [2019-10-03 04:15:53,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:15:53,732 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:15:53,877 INFO L227 lantSequenceWeakener]: Weakened 230 states. On average, predicates are now at 76.49% of their original sizes. [2019-10-03 04:15:53,877 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:15:58,099 INFO L420 sIntCurrentIteration]: We unified 246 AI predicates to 246 [2019-10-03 04:15:58,099 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:15:58,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:15:58,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [100] imperfect sequences [4] total 102 [2019-10-03 04:15:58,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:15:58,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-10-03 04:15:58,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-10-03 04:15:58,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=9318, Unknown=0, NotChecked=0, Total=9900 [2019-10-03 04:15:58,102 INFO L87 Difference]: Start difference. First operand 4801 states and 5487 transitions. Second operand 100 states. [2019-10-03 04:16:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:40,415 INFO L93 Difference]: Finished difference Result 4047 states and 4718 transitions. [2019-10-03 04:16:40,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-10-03 04:16:40,415 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 247 [2019-10-03 04:16:40,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:40,426 INFO L225 Difference]: With dead ends: 4047 [2019-10-03 04:16:40,426 INFO L226 Difference]: Without dead ends: 4047 [2019-10-03 04:16:40,428 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10838 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2232, Invalid=30710, Unknown=0, NotChecked=0, Total=32942 [2019-10-03 04:16:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4047 states. [2019-10-03 04:16:40,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4047 to 3962. [2019-10-03 04:16:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3962 states. [2019-10-03 04:16:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 4583 transitions. [2019-10-03 04:16:40,503 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 4583 transitions. Word has length 247 [2019-10-03 04:16:40,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:40,503 INFO L475 AbstractCegarLoop]: Abstraction has 3962 states and 4583 transitions. [2019-10-03 04:16:40,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-10-03 04:16:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 4583 transitions. [2019-10-03 04:16:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-03 04:16:40,510 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:40,510 INFO L411 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, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:16:40,510 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:40,511 INFO L82 PathProgramCache]: Analyzing trace with hash -366003613, now seen corresponding path program 1 times [2019-10-03 04:16:40,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:40,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:40,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:40,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:40,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-03 04:16:40,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:40,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:16:40,611 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2019-10-03 04:16:40,611 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [499], [506], [512], [515], [519], [525], [528], [532], [535], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:16:40,613 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:16:40,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:16:40,715 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:16:40,716 INFO L272 AbstractInterpreter]: Visited 135 different actions 336 times. Merged at 15 different actions 31 times. Never widened. Performed 2460 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2460 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 54 variables. [2019-10-03 04:16:40,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:40,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:16:40,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:40,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:16:40,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:40,801 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:16:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:40,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:16:40,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:16:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-03 04:16:41,060 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:16:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 04:16:41,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:16:41,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-10-03 04:16:41,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:16:41,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:16:41,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:16:41,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:16:41,319 INFO L87 Difference]: Start difference. First operand 3962 states and 4583 transitions. Second operand 3 states. [2019-10-03 04:16:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:41,347 INFO L93 Difference]: Finished difference Result 4976 states and 5841 transitions. [2019-10-03 04:16:41,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:16:41,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-10-03 04:16:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:41,360 INFO L225 Difference]: With dead ends: 4976 [2019-10-03 04:16:41,360 INFO L226 Difference]: Without dead ends: 4976 [2019-10-03 04:16:41,360 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:16:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4976 states. [2019-10-03 04:16:41,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4976 to 4965. [2019-10-03 04:16:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4965 states. [2019-10-03 04:16:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4965 states to 4965 states and 5825 transitions. [2019-10-03 04:16:41,458 INFO L78 Accepts]: Start accepts. Automaton has 4965 states and 5825 transitions. Word has length 247 [2019-10-03 04:16:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:41,459 INFO L475 AbstractCegarLoop]: Abstraction has 4965 states and 5825 transitions. [2019-10-03 04:16:41,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:16:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 4965 states and 5825 transitions. [2019-10-03 04:16:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-03 04:16:41,471 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:41,471 INFO L411 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:16:41,471 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:41,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:41,472 INFO L82 PathProgramCache]: Analyzing trace with hash -768495339, now seen corresponding path program 1 times [2019-10-03 04:16:41,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:41,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:41,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:41,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:41,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 41 proven. 23 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-03 04:16:41,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:41,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:16:41,589 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 250 with the following transitions: [2019-10-03 04:16:41,589 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [459], [464], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [499], [506], [512], [515], [519], [525], [528], [532], [535], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:16:41,591 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:16:41,591 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:16:41,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:16:41,777 INFO L272 AbstractInterpreter]: Visited 143 different actions 718 times. Merged at 46 different actions 157 times. Never widened. Performed 3760 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3760 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 14 fixpoints after 6 different actions. Largest state had 54 variables. [2019-10-03 04:16:41,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:41,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:16:41,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:41,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:16:41,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:41,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:16:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:42,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-03 04:16:42,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:16:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-03 04:16:42,259 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:16:42,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:16:42,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:16:42,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:16:42,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:16:42,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:16:42,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:16:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 41 proven. 20 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 04:16:42,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:16:42,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2019-10-03 04:16:42,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:16:42,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:16:42,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:16:42,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 04:16:42,660 INFO L87 Difference]: Start difference. First operand 4965 states and 5825 transitions. Second operand 4 states. [2019-10-03 04:16:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:16:43,061 INFO L93 Difference]: Finished difference Result 6514 states and 7864 transitions. [2019-10-03 04:16:43,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:16:43,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 249 [2019-10-03 04:16:43,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:16:43,079 INFO L225 Difference]: With dead ends: 6514 [2019-10-03 04:16:43,080 INFO L226 Difference]: Without dead ends: 6514 [2019-10-03 04:16:43,080 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:16:43,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2019-10-03 04:16:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6510. [2019-10-03 04:16:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6510 states. [2019-10-03 04:16:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 7861 transitions. [2019-10-03 04:16:43,221 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 7861 transitions. Word has length 249 [2019-10-03 04:16:43,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:16:43,221 INFO L475 AbstractCegarLoop]: Abstraction has 6510 states and 7861 transitions. [2019-10-03 04:16:43,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:16:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 7861 transitions. [2019-10-03 04:16:43,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-03 04:16:43,234 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:16:43,234 INFO L411 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, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 04:16:43,234 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:16:43,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:43,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1156555112, now seen corresponding path program 1 times [2019-10-03 04:16:43,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:16:43,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:43,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:16:43,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:16:43,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:16:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:16:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-03 04:16:43,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:16:43,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:16:43,326 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2019-10-03 04:16:43,326 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [60], [76], [78], [86], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [459], [464], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [499], [506], [509], [515], [519], [522], [528], [532], [535], [541], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [631], [632], [633], [634], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:16:43,328 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:16:43,328 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:16:43,367 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:16:43,367 INFO L272 AbstractInterpreter]: Visited 140 different actions 204 times. Merged at 9 different actions 9 times. Never widened. Performed 998 root evaluator evaluations with a maximum evaluation depth of 4. Performed 998 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 54 variables. [2019-10-03 04:16:43,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:16:43,368 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:16:43,476 INFO L227 lantSequenceWeakener]: Weakened 196 states. On average, predicates are now at 74.15% of their original sizes. [2019-10-03 04:16:43,477 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:16:45,959 INFO L420 sIntCurrentIteration]: We unified 253 AI predicates to 253 [2019-10-03 04:16:45,959 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:16:45,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:16:45,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [78] imperfect sequences [4] total 80 [2019-10-03 04:16:45,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:16:45,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-10-03 04:16:45,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-10-03 04:16:45,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=5507, Unknown=0, NotChecked=0, Total=6006 [2019-10-03 04:16:45,961 INFO L87 Difference]: Start difference. First operand 6510 states and 7861 transitions. Second operand 78 states. [2019-10-03 04:18:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:10,085 INFO L93 Difference]: Finished difference Result 7996 states and 9578 transitions. [2019-10-03 04:18:10,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-10-03 04:18:10,086 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 254 [2019-10-03 04:18:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:10,101 INFO L225 Difference]: With dead ends: 7996 [2019-10-03 04:18:10,102 INFO L226 Difference]: Without dead ends: 7996 [2019-10-03 04:18:10,103 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8504 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2167, Invalid=24239, Unknown=0, NotChecked=0, Total=26406 [2019-10-03 04:18:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7996 states. [2019-10-03 04:18:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7996 to 7903. [2019-10-03 04:18:10,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7903 states. [2019-10-03 04:18:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7903 states to 7903 states and 9450 transitions. [2019-10-03 04:18:10,256 INFO L78 Accepts]: Start accepts. Automaton has 7903 states and 9450 transitions. Word has length 254 [2019-10-03 04:18:10,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:10,257 INFO L475 AbstractCegarLoop]: Abstraction has 7903 states and 9450 transitions. [2019-10-03 04:18:10,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-10-03 04:18:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 7903 states and 9450 transitions. [2019-10-03 04:18:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-03 04:18:10,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:10,270 INFO L411 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, 3, 3, 3, 3, 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] [2019-10-03 04:18:10,271 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:10,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:10,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1471423799, now seen corresponding path program 1 times [2019-10-03 04:18:10,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:10,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:10,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:10,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:10,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:10,384 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-03 04:18:10,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:10,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:18:10,385 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2019-10-03 04:18:10,385 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [60], [76], [78], [86], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [277], [280], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [459], [464], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [502], [506], [509], [512], [519], [522], [528], [532], [535], [538], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [631], [632], [633], [634], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:18:10,387 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:18:10,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:18:10,466 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:18:10,466 INFO L272 AbstractInterpreter]: Visited 146 different actions 350 times. Merged at 21 different actions 50 times. Never widened. Performed 1918 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1918 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 11 fixpoints after 7 different actions. Largest state had 54 variables. [2019-10-03 04:18:10,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:10,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:18:10,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:10,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:18:10,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:10,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:18:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:10,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:18:10,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:18:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-03 04:18:10,823 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:18:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-10-03 04:18:11,012 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:18:11,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [5] total 7 [2019-10-03 04:18:11,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:11,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:18:11,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:18:11,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:18:11,013 INFO L87 Difference]: Start difference. First operand 7903 states and 9450 transitions. Second operand 3 states. [2019-10-03 04:18:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:11,045 INFO L93 Difference]: Finished difference Result 9317 states and 11202 transitions. [2019-10-03 04:18:11,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:18:11,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-10-03 04:18:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:11,066 INFO L225 Difference]: With dead ends: 9317 [2019-10-03 04:18:11,067 INFO L226 Difference]: Without dead ends: 9317 [2019-10-03 04:18:11,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 04:18:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9317 states. [2019-10-03 04:18:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9317 to 9261. [2019-10-03 04:18:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9261 states. [2019-10-03 04:18:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9261 states to 9261 states and 11118 transitions. [2019-10-03 04:18:11,229 INFO L78 Accepts]: Start accepts. Automaton has 9261 states and 11118 transitions. Word has length 255 [2019-10-03 04:18:11,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:11,229 INFO L475 AbstractCegarLoop]: Abstraction has 9261 states and 11118 transitions. [2019-10-03 04:18:11,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:18:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 9261 states and 11118 transitions. [2019-10-03 04:18:11,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-03 04:18:11,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:11,245 INFO L411 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, 3, 3, 3, 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] [2019-10-03 04:18:11,245 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:11,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:11,246 INFO L82 PathProgramCache]: Analyzing trace with hash -528449991, now seen corresponding path program 1 times [2019-10-03 04:18:11,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:11,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:11,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:11,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:11,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-10-03 04:18:11,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:11,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:18:11,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 250 with the following transitions: [2019-10-03 04:18:11,325 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [251], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [299], [302], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [459], [464], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [499], [506], [509], [515], [519], [525], [532], [535], [538], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [631], [632], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:18:11,326 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:18:11,326 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:18:11,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:18:11,427 INFO L272 AbstractInterpreter]: Visited 140 different actions 453 times. Merged at 36 different actions 82 times. Never widened. Performed 2321 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2321 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 11 fixpoints after 5 different actions. Largest state had 54 variables. [2019-10-03 04:18:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:11,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:18:11,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:11,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:18:11,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:11,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:18:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:11,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:18:11,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:18:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-03 04:18:11,750 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:18:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-03 04:18:11,970 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:18:11,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [3] total 5 [2019-10-03 04:18:11,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:11,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:18:11,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:18:11,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:18:11,971 INFO L87 Difference]: Start difference. First operand 9261 states and 11118 transitions. Second operand 3 states. [2019-10-03 04:18:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:12,020 INFO L93 Difference]: Finished difference Result 12392 states and 15210 transitions. [2019-10-03 04:18:12,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:18:12,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-10-03 04:18:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:12,044 INFO L225 Difference]: With dead ends: 12392 [2019-10-03 04:18:12,045 INFO L226 Difference]: Without dead ends: 12392 [2019-10-03 04:18:12,045 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:18:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2019-10-03 04:18:12,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 12335. [2019-10-03 04:18:12,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12335 states. [2019-10-03 04:18:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12335 states to 12335 states and 15131 transitions. [2019-10-03 04:18:12,293 INFO L78 Accepts]: Start accepts. Automaton has 12335 states and 15131 transitions. Word has length 249 [2019-10-03 04:18:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:12,294 INFO L475 AbstractCegarLoop]: Abstraction has 12335 states and 15131 transitions. [2019-10-03 04:18:12,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:18:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 12335 states and 15131 transitions. [2019-10-03 04:18:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-03 04:18:12,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:12,312 INFO L411 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, 3, 3, 3, 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] [2019-10-03 04:18:12,313 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:12,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:12,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2080302184, now seen corresponding path program 1 times [2019-10-03 04:18:12,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:12,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:12,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:12,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:12,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-03 04:18:12,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:12,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:18:12,396 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2019-10-03 04:18:12,396 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [251], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [299], [302], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [459], [464], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [499], [506], [509], [515], [519], [525], [532], [535], [538], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [631], [632], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:18:12,397 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:18:12,398 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:18:12,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:18:12,503 INFO L272 AbstractInterpreter]: Visited 141 different actions 480 times. Merged at 36 different actions 93 times. Never widened. Performed 2641 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2641 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 13 fixpoints after 7 different actions. Largest state had 54 variables. [2019-10-03 04:18:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:12,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:18:12,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:12,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:18:12,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:12,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:18:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:12,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 1152 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:18:12,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:18:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-03 04:18:12,886 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:18:13,046 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-03 04:18:13,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:18:13,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2019-10-03 04:18:13,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:13,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:18:13,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:18:13,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:18:13,052 INFO L87 Difference]: Start difference. First operand 12335 states and 15131 transitions. Second operand 3 states. [2019-10-03 04:18:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:13,101 INFO L93 Difference]: Finished difference Result 16725 states and 21026 transitions. [2019-10-03 04:18:13,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:18:13,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-10-03 04:18:13,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:13,140 INFO L225 Difference]: With dead ends: 16725 [2019-10-03 04:18:13,140 INFO L226 Difference]: Without dead ends: 16725 [2019-10-03 04:18:13,141 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:18:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16725 states. [2019-10-03 04:18:13,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16725 to 16715. [2019-10-03 04:18:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16715 states. [2019-10-03 04:18:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16715 states to 16715 states and 21009 transitions. [2019-10-03 04:18:13,459 INFO L78 Accepts]: Start accepts. Automaton has 16715 states and 21009 transitions. Word has length 250 [2019-10-03 04:18:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:13,459 INFO L475 AbstractCegarLoop]: Abstraction has 16715 states and 21009 transitions. [2019-10-03 04:18:13,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:18:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 16715 states and 21009 transitions. [2019-10-03 04:18:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-03 04:18:13,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:13,482 INFO L411 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, 3, 3, 3, 3, 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] [2019-10-03 04:18:13,482 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:13,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:13,482 INFO L82 PathProgramCache]: Analyzing trace with hash 181271066, now seen corresponding path program 1 times [2019-10-03 04:18:13,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:13,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:13,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:13,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:13,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-03 04:18:13,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:13,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:18:13,609 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2019-10-03 04:18:13,609 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [299], [302], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [459], [464], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [499], [506], [509], [515], [519], [525], [532], [535], [538], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [631], [632], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:18:13,611 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:18:13,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:18:13,698 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:18:13,698 INFO L272 AbstractInterpreter]: Visited 140 different actions 414 times. Merged at 34 different actions 66 times. Never widened. Performed 2987 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2987 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 5 different actions. Largest state had 54 variables. [2019-10-03 04:18:13,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:13,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:18:13,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:13,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:18:13,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:13,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:18:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:13,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-03 04:18:13,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:18:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-03 04:18:14,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:18:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-03 04:18:14,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:18:14,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 14 [2019-10-03 04:18:14,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:14,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:18:14,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:18:14,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 04:18:14,322 INFO L87 Difference]: Start difference. First operand 16715 states and 21009 transitions. Second operand 6 states. [2019-10-03 04:18:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:14,386 INFO L93 Difference]: Finished difference Result 16672 states and 20970 transitions. [2019-10-03 04:18:14,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:18:14,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 250 [2019-10-03 04:18:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:14,428 INFO L225 Difference]: With dead ends: 16672 [2019-10-03 04:18:14,428 INFO L226 Difference]: Without dead ends: 16672 [2019-10-03 04:18:14,428 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 495 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-10-03 04:18:14,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-10-03 04:18:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16658. [2019-10-03 04:18:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16658 states. [2019-10-03 04:18:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16658 states to 16658 states and 20956 transitions. [2019-10-03 04:18:14,747 INFO L78 Accepts]: Start accepts. Automaton has 16658 states and 20956 transitions. Word has length 250 [2019-10-03 04:18:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:14,748 INFO L475 AbstractCegarLoop]: Abstraction has 16658 states and 20956 transitions. [2019-10-03 04:18:14,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:18:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 16658 states and 20956 transitions. [2019-10-03 04:18:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-03 04:18:14,775 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:14,776 INFO L411 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, 3, 3, 3, 3, 3, 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] [2019-10-03 04:18:14,776 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1420498250, now seen corresponding path program 1 times [2019-10-03 04:18:14,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:14,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:14,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:14,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:14,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 34 proven. 16 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-03 04:18:15,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:15,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:18:15,474 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2019-10-03 04:18:15,475 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [299], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [459], [464], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [499], [506], [509], [515], [519], [525], [532], [535], [538], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [631], [632], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:18:15,477 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:18:15,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:18:15,569 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:18:15,570 INFO L272 AbstractInterpreter]: Visited 139 different actions 448 times. Merged at 17 different actions 51 times. Never widened. Performed 2251 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2251 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 6 different actions. Largest state had 54 variables. [2019-10-03 04:18:15,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:15,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:18:15,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:15,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:18:15,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:15,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:18:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:15,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:18:15,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:18:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-03 04:18:15,900 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:18:16,097 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 34 proven. 16 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-03 04:18:16,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:18:16,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-10-03 04:18:16,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:16,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:18:16,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:18:16,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:18:16,102 INFO L87 Difference]: Start difference. First operand 16658 states and 20956 transitions. Second operand 3 states. [2019-10-03 04:18:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:16,149 INFO L93 Difference]: Finished difference Result 15627 states and 19673 transitions. [2019-10-03 04:18:16,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:18:16,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-10-03 04:18:16,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:16,174 INFO L225 Difference]: With dead ends: 15627 [2019-10-03 04:18:16,174 INFO L226 Difference]: Without dead ends: 15627 [2019-10-03 04:18:16,174 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:18:16,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15627 states. [2019-10-03 04:18:16,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15627 to 15588. [2019-10-03 04:18:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15588 states. [2019-10-03 04:18:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15588 states to 15588 states and 19624 transitions. [2019-10-03 04:18:16,426 INFO L78 Accepts]: Start accepts. Automaton has 15588 states and 19624 transitions. Word has length 251 [2019-10-03 04:18:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:16,426 INFO L475 AbstractCegarLoop]: Abstraction has 15588 states and 19624 transitions. [2019-10-03 04:18:16,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:18:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 15588 states and 19624 transitions. [2019-10-03 04:18:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-03 04:18:16,443 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:16,443 INFO L411 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:18:16,444 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:16,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:16,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1157282423, now seen corresponding path program 1 times [2019-10-03 04:18:16,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:16,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:16,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:16,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:16,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-03 04:18:16,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:16,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:18:16,534 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2019-10-03 04:18:16,535 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [251], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [299], [302], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [459], [464], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [499], [506], [509], [512], [519], [525], [532], [535], [538], [547], [548], [562], [564], [597], [598], [601], [602], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [631], [632], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:18:16,536 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:18:16,536 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:18:16,624 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:18:16,625 INFO L272 AbstractInterpreter]: Visited 141 different actions 470 times. Merged at 36 different actions 90 times. Never widened. Performed 2212 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2212 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 8 different actions. Largest state had 54 variables. [2019-10-03 04:18:16,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:16,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:18:16,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:16,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:18:16,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:16,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:18:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:16,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-03 04:18:16,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:18:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 25 proven. 79 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-03 04:18:17,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:18:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-03 04:18:17,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:18:17,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-10-03 04:18:17,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:17,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:18:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:18:17,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:18:17,363 INFO L87 Difference]: Start difference. First operand 15588 states and 19624 transitions. Second operand 5 states. [2019-10-03 04:18:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:18,089 INFO L93 Difference]: Finished difference Result 15240 states and 19390 transitions. [2019-10-03 04:18:18,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:18:18,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 251 [2019-10-03 04:18:18,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:18,115 INFO L225 Difference]: With dead ends: 15240 [2019-10-03 04:18:18,115 INFO L226 Difference]: Without dead ends: 15240 [2019-10-03 04:18:18,115 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 495 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:18:18,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15240 states. [2019-10-03 04:18:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15240 to 15141. [2019-10-03 04:18:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15141 states. [2019-10-03 04:18:18,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15141 states to 15141 states and 19146 transitions. [2019-10-03 04:18:18,413 INFO L78 Accepts]: Start accepts. Automaton has 15141 states and 19146 transitions. Word has length 251 [2019-10-03 04:18:18,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:18,414 INFO L475 AbstractCegarLoop]: Abstraction has 15141 states and 19146 transitions. [2019-10-03 04:18:18,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:18:18,414 INFO L276 IsEmpty]: Start isEmpty. Operand 15141 states and 19146 transitions. [2019-10-03 04:18:18,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-03 04:18:18,431 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:18,431 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:18:18,431 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:18,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:18,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1545330421, now seen corresponding path program 1 times [2019-10-03 04:18:18,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:18,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:18,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:18,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:18,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 18 proven. 31 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-10-03 04:18:18,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:18,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:18:18,542 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 305 with the following transitions: [2019-10-03 04:18:18,542 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [62], [65], [76], [78], [80], [82], [86], [87], [92], [106], [109], [112], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [259], [261], [264], [267], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [459], [462], [464], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [499], [506], [512], [519], [522], [525], [532], [535], [547], [548], [562], [564], [597], [598], [601], [602], [603], [604], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [633], [634], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:18:18,543 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:18:18,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:18:18,866 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:18:18,867 INFO L272 AbstractInterpreter]: Visited 149 different actions 1256 times. Merged at 47 different actions 290 times. Widened at 1 different actions 1 times. Performed 8776 root evaluator evaluations with a maximum evaluation depth of 4. Performed 8776 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 24 fixpoints after 5 different actions. Largest state had 54 variables. [2019-10-03 04:18:18,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:18,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:18:18,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:18,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:18:19,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:19,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:18:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:19,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 1326 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-03 04:18:19,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:18:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-03 04:18:19,281 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:18:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 40 proven. 12 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-10-03 04:18:19,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:18:19,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 9 [2019-10-03 04:18:19,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:19,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:18:19,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:18:19,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:18:19,615 INFO L87 Difference]: Start difference. First operand 15141 states and 19146 transitions. Second operand 4 states. [2019-10-03 04:18:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:19,936 INFO L93 Difference]: Finished difference Result 15375 states and 20975 transitions. [2019-10-03 04:18:19,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:18:19,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-10-03 04:18:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:19,963 INFO L225 Difference]: With dead ends: 15375 [2019-10-03 04:18:19,963 INFO L226 Difference]: Without dead ends: 15375 [2019-10-03 04:18:19,963 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 595 SyntacticMatches, 11 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 04:18:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15375 states. [2019-10-03 04:18:20,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15375 to 14338. [2019-10-03 04:18:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14338 states. [2019-10-03 04:18:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14338 states to 14338 states and 18199 transitions. [2019-10-03 04:18:20,167 INFO L78 Accepts]: Start accepts. Automaton has 14338 states and 18199 transitions. Word has length 304 [2019-10-03 04:18:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:20,167 INFO L475 AbstractCegarLoop]: Abstraction has 14338 states and 18199 transitions. [2019-10-03 04:18:20,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:18:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 14338 states and 18199 transitions. [2019-10-03 04:18:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-03 04:18:20,178 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:20,178 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:18:20,179 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:20,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:20,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1499332874, now seen corresponding path program 1 times [2019-10-03 04:18:20,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:20,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:20,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:20,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:20,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:20,297 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 44 proven. 43 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-03 04:18:20,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:20,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:18:20,298 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2019-10-03 04:18:20,298 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [106], [109], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [267], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [459], [462], [464], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [499], [506], [512], [519], [522], [532], [535], [547], [548], [562], [564], [597], [598], [601], [602], [603], [604], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [633], [634], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:18:20,300 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:18:20,300 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:18:20,966 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:18:20,967 INFO L272 AbstractInterpreter]: Visited 158 different actions 2525 times. Merged at 60 different actions 675 times. Widened at 1 different actions 1 times. Performed 12924 root evaluator evaluations with a maximum evaluation depth of 4. Performed 12924 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 73 fixpoints after 15 different actions. Largest state had 54 variables. [2019-10-03 04:18:20,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:20,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:18:20,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:20,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:18:21,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:21,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:18:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:21,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 1363 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-03 04:18:21,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:18:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-03 04:18:21,398 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:18:21,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:18:21,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:18:21,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:18:21,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:18:21,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:18:21,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 04:18:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 44 proven. 43 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-03 04:18:21,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:18:21,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2019-10-03 04:18:21,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:21,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:18:21,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:18:21,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-03 04:18:21,754 INFO L87 Difference]: Start difference. First operand 14338 states and 18199 transitions. Second operand 4 states. [2019-10-03 04:18:22,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:22,180 INFO L93 Difference]: Finished difference Result 21135 states and 27596 transitions. [2019-10-03 04:18:22,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:18:22,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 313 [2019-10-03 04:18:22,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:22,213 INFO L225 Difference]: With dead ends: 21135 [2019-10-03 04:18:22,213 INFO L226 Difference]: Without dead ends: 21135 [2019-10-03 04:18:22,214 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 631 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:18:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21135 states. [2019-10-03 04:18:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21135 to 20977. [2019-10-03 04:18:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20977 states. [2019-10-03 04:18:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20977 states to 20977 states and 27383 transitions. [2019-10-03 04:18:22,509 INFO L78 Accepts]: Start accepts. Automaton has 20977 states and 27383 transitions. Word has length 313 [2019-10-03 04:18:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:22,509 INFO L475 AbstractCegarLoop]: Abstraction has 20977 states and 27383 transitions. [2019-10-03 04:18:22,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:18:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 20977 states and 27383 transitions. [2019-10-03 04:18:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-03 04:18:22,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:22,526 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2019-10-03 04:18:22,526 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:22,527 INFO L82 PathProgramCache]: Analyzing trace with hash -176328773, now seen corresponding path program 1 times [2019-10-03 04:18:22,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:22,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:22,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:22,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:22,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-10-03 04:18:22,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:22,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:18:22,639 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 307 with the following transitions: [2019-10-03 04:18:22,640 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [62], [65], [76], [78], [80], [82], [86], [87], [92], [106], [109], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [267], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [459], [462], [464], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [499], [506], [512], [519], [522], [525], [532], [535], [547], [548], [562], [564], [597], [598], [601], [602], [603], [604], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [633], [634], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:18:22,642 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:18:22,642 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:18:22,918 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:18:22,918 INFO L272 AbstractInterpreter]: Visited 148 different actions 1238 times. Merged at 47 different actions 290 times. Widened at 1 different actions 1 times. Performed 7442 root evaluator evaluations with a maximum evaluation depth of 4. Performed 7442 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 24 fixpoints after 5 different actions. Largest state had 54 variables. [2019-10-03 04:18:22,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:22,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:18:22,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:22,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:18:23,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:23,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:18:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:23,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-03 04:18:23,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:18:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 156 proven. 80 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-03 04:18:23,540 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:18:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-10-03 04:18:23,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:18:23,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-10-03 04:18:23,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:23,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:18:23,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:18:23,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:18:23,789 INFO L87 Difference]: Start difference. First operand 20977 states and 27383 transitions. Second operand 5 states. [2019-10-03 04:18:24,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:24,393 INFO L93 Difference]: Finished difference Result 20510 states and 26967 transitions. [2019-10-03 04:18:24,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:18:24,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 306 [2019-10-03 04:18:24,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:24,426 INFO L225 Difference]: With dead ends: 20510 [2019-10-03 04:18:24,426 INFO L226 Difference]: Without dead ends: 20510 [2019-10-03 04:18:24,427 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 605 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:18:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20510 states. [2019-10-03 04:18:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20510 to 20139. [2019-10-03 04:18:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20139 states. [2019-10-03 04:18:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20139 states to 20139 states and 26319 transitions. [2019-10-03 04:18:24,687 INFO L78 Accepts]: Start accepts. Automaton has 20139 states and 26319 transitions. Word has length 306 [2019-10-03 04:18:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:24,687 INFO L475 AbstractCegarLoop]: Abstraction has 20139 states and 26319 transitions. [2019-10-03 04:18:24,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:18:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 20139 states and 26319 transitions. [2019-10-03 04:18:24,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2019-10-03 04:18:24,726 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:24,726 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 04:18:24,726 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:24,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:24,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1070965394, now seen corresponding path program 1 times [2019-10-03 04:18:24,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:24,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:24,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:24,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:24,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1165 backedges. 67 proven. 120 refuted. 0 times theorem prover too weak. 978 trivial. 0 not checked. [2019-10-03 04:18:24,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:24,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:18:24,971 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 563 with the following transitions: [2019-10-03 04:18:24,972 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [95], [97], [100], [104], [105], [106], [109], [112], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [251], [253], [256], [259], [261], [264], [267], [269], [271], [272], [275], [294], [295], [296], [299], [302], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [459], [462], [464], [466], [468], [470], [471], [472], [481], [484], [487], [489], [493], [496], [499], [506], [509], [512], [519], [522], [528], [532], [535], [541], [546], [547], [548], [562], [564], [566], [568], [573], [581], [584], [589], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [631], [632], [633], [634], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [654], [655], [656], [657], [658], [665], [666], [667], [668], [669] [2019-10-03 04:18:24,975 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:18:24,975 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:18:26,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:18:26,775 INFO L272 AbstractInterpreter]: Visited 168 different actions 5516 times. Merged at 63 different actions 1692 times. Widened at 2 different actions 4 times. Performed 28079 root evaluator evaluations with a maximum evaluation depth of 4. Performed 28079 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 214 fixpoints after 18 different actions. Largest state had 54 variables. [2019-10-03 04:18:26,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:26,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:18:26,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:26,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:18:26,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:26,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:18:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:27,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 2105 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:18:27,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:18:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1165 backedges. 586 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2019-10-03 04:18:27,386 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:18:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1165 backedges. 76 proven. 38 refuted. 0 times theorem prover too weak. 1051 trivial. 0 not checked. [2019-10-03 04:18:27,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:18:27,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 6 [2019-10-03 04:18:27,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:27,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:18:27,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:18:27,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:18:27,851 INFO L87 Difference]: Start difference. First operand 20139 states and 26319 transitions. Second operand 3 states. [2019-10-03 04:18:27,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:27,919 INFO L93 Difference]: Finished difference Result 19912 states and 25755 transitions. [2019-10-03 04:18:27,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:18:27,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 562 [2019-10-03 04:18:27,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:27,954 INFO L225 Difference]: With dead ends: 19912 [2019-10-03 04:18:27,954 INFO L226 Difference]: Without dead ends: 19912 [2019-10-03 04:18:27,954 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1130 GetRequests, 1126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:18:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19912 states. [2019-10-03 04:18:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19912 to 19844. [2019-10-03 04:18:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19844 states. [2019-10-03 04:18:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19844 states to 19844 states and 25672 transitions. [2019-10-03 04:18:28,475 INFO L78 Accepts]: Start accepts. Automaton has 19844 states and 25672 transitions. Word has length 562 [2019-10-03 04:18:28,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:28,476 INFO L475 AbstractCegarLoop]: Abstraction has 19844 states and 25672 transitions. [2019-10-03 04:18:28,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:18:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand 19844 states and 25672 transitions. [2019-10-03 04:18:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2019-10-03 04:18:28,503 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:28,504 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 04:18:28,504 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:28,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:28,505 INFO L82 PathProgramCache]: Analyzing trace with hash -875367936, now seen corresponding path program 1 times [2019-10-03 04:18:28,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:28,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:28,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:28,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:28,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 60 proven. 14 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2019-10-03 04:18:29,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:29,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:18:29,017 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 555 with the following transitions: [2019-10-03 04:18:29,018 INFO L207 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [95], [97], [100], [104], [105], [106], [109], [112], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [251], [253], [256], [259], [261], [264], [267], [269], [271], [272], [275], [294], [295], [296], [299], [302], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [459], [462], [464], [466], [468], [470], [471], [472], [481], [484], [487], [489], [493], [496], [499], [506], [509], [519], [522], [525], [532], [535], [541], [546], [547], [548], [562], [564], [566], [568], [573], [581], [584], [589], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [631], [632], [633], [634], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [648], [649], [650], [651], [652], [653], [654], [655], [656], [657], [658], [665], [666], [667], [668], [669] [2019-10-03 04:18:29,021 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:18:29,021 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:18:29,933 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:18:29,934 INFO L272 AbstractInterpreter]: Visited 179 different actions 3653 times. Merged at 74 different actions 1151 times. Widened at 2 different actions 4 times. Performed 17645 root evaluator evaluations with a maximum evaluation depth of 4. Performed 17645 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 150 fixpoints after 23 different actions. Largest state had 54 variables. [2019-10-03 04:18:29,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:29,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:18:29,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:29,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:18:30,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:30,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:18:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:30,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 2115 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-03 04:18:30,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:18:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2019-10-03 04:18:30,591 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:18:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 60 proven. 14 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2019-10-03 04:18:31,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:18:31,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2019-10-03 04:18:31,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:31,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:18:31,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:18:31,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-03 04:18:31,225 INFO L87 Difference]: Start difference. First operand 19844 states and 25672 transitions. Second operand 4 states. [2019-10-03 04:18:31,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:31,627 INFO L93 Difference]: Finished difference Result 11632 states and 13348 transitions. [2019-10-03 04:18:31,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:18:31,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 554 [2019-10-03 04:18:31,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:31,656 INFO L225 Difference]: With dead ends: 11632 [2019-10-03 04:18:31,657 INFO L226 Difference]: Without dead ends: 9109 [2019-10-03 04:18:31,657 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1116 GetRequests, 1109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:18:31,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9109 states. [2019-10-03 04:18:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9109 to 8998. [2019-10-03 04:18:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8998 states. [2019-10-03 04:18:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8998 states to 8998 states and 10292 transitions. [2019-10-03 04:18:31,812 INFO L78 Accepts]: Start accepts. Automaton has 8998 states and 10292 transitions. Word has length 554 [2019-10-03 04:18:31,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:31,812 INFO L475 AbstractCegarLoop]: Abstraction has 8998 states and 10292 transitions. [2019-10-03 04:18:31,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:18:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 8998 states and 10292 transitions. [2019-10-03 04:18:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-10-03 04:18:31,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:31,825 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 04:18:31,825 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:31,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:31,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2006765383, now seen corresponding path program 1 times [2019-10-03 04:18:31,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:31,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:31,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:31,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:31,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-10-03 04:18:31,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:31,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:18:31,956 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 369 with the following transitions: [2019-10-03 04:18:31,956 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [106], [109], [112], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [259], [261], [264], [267], [269], [271], [272], [275], [277], [280], [294], [295], [296], [299], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [386], [389], [391], [394], [405], [407], [409], [413], [451], [454], [455], [456], [459], [462], [464], [466], [468], [470], [471], [472], [481], [484], [487], [493], [496], [502], [506], [509], [512], [519], [522], [532], [535], [547], [548], [562], [564], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [627], [628], [629], [630], [631], [632], [633], [634], [635], [636], [637], [638], [639], [640], [641], [642], [643], [644], [645], [646], [647], [667], [668], [669] [2019-10-03 04:18:31,958 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:18:31,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:18:32,552 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:18:32,552 INFO L272 AbstractInterpreter]: Visited 166 different actions 3146 times. Merged at 63 different actions 947 times. Widened at 1 different actions 2 times. Performed 14356 root evaluator evaluations with a maximum evaluation depth of 4. Performed 14356 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 92 fixpoints after 14 different actions. Largest state had 54 variables. [2019-10-03 04:18:32,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:32,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:18:32,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:18:32,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:18:32,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:32,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:18:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:32,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 1524 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-03 04:18:32,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:18:33,107 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 286 proven. 79 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-03 04:18:33,107 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:18:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-10-03 04:18:33,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:18:33,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-10-03 04:18:33,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:33,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:18:33,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:18:33,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:18:33,432 INFO L87 Difference]: Start difference. First operand 8998 states and 10292 transitions. Second operand 5 states. [2019-10-03 04:18:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:33,985 INFO L93 Difference]: Finished difference Result 4755 states and 5215 transitions. [2019-10-03 04:18:33,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:18:33,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 368 [2019-10-03 04:18:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:33,993 INFO L225 Difference]: With dead ends: 4755 [2019-10-03 04:18:33,993 INFO L226 Difference]: Without dead ends: 3719 [2019-10-03 04:18:33,993 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 729 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-03 04:18:33,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2019-10-03 04:18:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3649. [2019-10-03 04:18:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2019-10-03 04:18:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 4029 transitions. [2019-10-03 04:18:34,043 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 4029 transitions. Word has length 368 [2019-10-03 04:18:34,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:34,044 INFO L475 AbstractCegarLoop]: Abstraction has 3649 states and 4029 transitions. [2019-10-03 04:18:34,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:18:34,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 4029 transitions. [2019-10-03 04:18:34,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-10-03 04:18:34,049 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:34,049 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-03 04:18:34,050 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:34,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:34,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1216094716, now seen corresponding path program 1 times [2019-10-03 04:18:34,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:34,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:34,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:34,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:34,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-10-03 04:18:34,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:18:34,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 04:18:34,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:34,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 04:18:34,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 04:18:34,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 04:18:34,330 INFO L87 Difference]: Start difference. First operand 3649 states and 4029 transitions. Second operand 8 states. [2019-10-03 04:18:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:36,695 INFO L93 Difference]: Finished difference Result 3702 states and 4096 transitions. [2019-10-03 04:18:36,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 04:18:36,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 376 [2019-10-03 04:18:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:36,702 INFO L225 Difference]: With dead ends: 3702 [2019-10-03 04:18:36,702 INFO L226 Difference]: Without dead ends: 3698 [2019-10-03 04:18:36,703 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-10-03 04:18:36,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2019-10-03 04:18:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3648. [2019-10-03 04:18:36,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3648 states. [2019-10-03 04:18:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 4026 transitions. [2019-10-03 04:18:36,748 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 4026 transitions. Word has length 376 [2019-10-03 04:18:36,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:36,749 INFO L475 AbstractCegarLoop]: Abstraction has 3648 states and 4026 transitions. [2019-10-03 04:18:36,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 04:18:36,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 4026 transitions. [2019-10-03 04:18:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-10-03 04:18:36,754 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:36,755 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-03 04:18:36,755 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:36,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:36,755 INFO L82 PathProgramCache]: Analyzing trace with hash -632344212, now seen corresponding path program 1 times [2019-10-03 04:18:36,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:36,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:36,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:36,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:36,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:18:36,915 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2019-10-03 04:18:36,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:18:36,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:18:36,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:18:36,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:18:36,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:18:36,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:18:36,917 INFO L87 Difference]: Start difference. First operand 3648 states and 4026 transitions. Second operand 3 states. [2019-10-03 04:18:36,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:18:36,941 INFO L93 Difference]: Finished difference Result 3655 states and 4041 transitions. [2019-10-03 04:18:36,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:18:36,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 380 [2019-10-03 04:18:36,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:18:36,949 INFO L225 Difference]: With dead ends: 3655 [2019-10-03 04:18:36,949 INFO L226 Difference]: Without dead ends: 3655 [2019-10-03 04:18:36,950 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:18:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3655 states. [2019-10-03 04:18:36,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3655 to 3655. [2019-10-03 04:18:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3655 states. [2019-10-03 04:18:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3655 states and 4041 transitions. [2019-10-03 04:18:36,994 INFO L78 Accepts]: Start accepts. Automaton has 3655 states and 4041 transitions. Word has length 380 [2019-10-03 04:18:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:18:36,994 INFO L475 AbstractCegarLoop]: Abstraction has 3655 states and 4041 transitions. [2019-10-03 04:18:36,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:18:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 4041 transitions. [2019-10-03 04:18:36,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-10-03 04:18:37,000 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:18:37,000 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-03 04:18:37,000 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:18:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:18:37,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1193582592, now seen corresponding path program 1 times [2019-10-03 04:18:37,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:18:37,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:37,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:18:37,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:18:37,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:18:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 04:18:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 04:18:37,266 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-03 04:18:37,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 04:18:37 BoogieIcfgContainer [2019-10-03 04:18:37,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 04:18:37,527 INFO L168 Benchmark]: Toolchain (without parser) took 492267.20 ms. Allocated memory was 135.8 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 87.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 771.5 MB. Max. memory is 7.1 GB. [2019-10-03 04:18:37,528 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 135.8 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 04:18:37,529 INFO L168 Benchmark]: CACSL2BoogieTranslator took 486.80 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 87.1 MB in the beginning and 175.0 MB in the end (delta: -87.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-10-03 04:18:37,530 INFO L168 Benchmark]: Boogie Preprocessor took 49.27 ms. Allocated memory is still 200.3 MB. Free memory was 175.0 MB in the beginning and 172.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-03 04:18:37,531 INFO L168 Benchmark]: RCFGBuilder took 713.76 ms. Allocated memory is still 200.3 MB. Free memory was 171.9 MB in the beginning and 127.1 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-10-03 04:18:37,537 INFO L168 Benchmark]: TraceAbstraction took 491013.11 ms. Allocated memory was 200.3 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 126.5 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 746.2 MB. Max. memory is 7.1 GB. [2019-10-03 04:18:37,545 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 135.8 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 486.80 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 87.1 MB in the beginning and 175.0 MB in the end (delta: -87.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.27 ms. Allocated memory is still 200.3 MB. Free memory was 175.0 MB in the beginning and 172.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 713.76 ms. Allocated memory is still 200.3 MB. Free memory was 171.9 MB in the beginning and 127.1 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 491013.11 ms. Allocated memory was 200.3 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 126.5 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 746.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int t3_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int t2_st ; [L21] int t3_st ; [L22] int m_i ; [L23] int t1_i ; [L24] int t2_i ; [L25] int t3_i ; [L26] int M_E = 2; [L27] int T1_E = 2; [L28] int T2_E = 2; [L29] int T3_E = 2; [L30] int E_M = 2; [L31] int E_1 = 2; [L32] int E_2 = 2; [L33] int E_3 = 2; [L39] int token ; [L41] int local ; VAL [\old(E_1)=20, \old(E_2)=5, \old(E_3)=24, \old(E_M)=15, \old(local)=19, \old(M_E)=16, \old(m_i)=7, \old(m_pc)=13, \old(m_st)=14, \old(T1_E)=3, \old(t1_i)=18, \old(t1_pc)=9, \old(t1_st)=4, \old(T2_E)=17, \old(t2_i)=6, \old(t2_pc)=10, \old(t2_st)=11, \old(T3_E)=21, \old(t3_i)=23, \old(t3_pc)=8, \old(t3_st)=12, \old(token)=22, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L725] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L729] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L638] m_i = 1 [L639] t1_i = 1 [L640] t2_i = 1 [L641] t3_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L729] RET init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L730] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L666] int kernel_st ; [L667] int tmp ; [L668] int tmp___0 ; [L672] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L673] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L674] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L294] COND TRUE m_i == 1 [L295] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L299] COND TRUE t1_i == 1 [L300] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L304] COND TRUE t2_i == 1 [L305] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L309] COND TRUE t3_i == 1 [L310] t3_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L674] RET init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L675] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L431] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L436] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L441] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L446] COND FALSE !(T3_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L451] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L456] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L461] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L466] COND FALSE !(E_3 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L675] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L676] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L531] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L207] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L210] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L220] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L222] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L531] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, token=0] [L539] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L226] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L229] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L239] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L241] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L539] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, token=0] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, token=0] [L547] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L245] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L248] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L258] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L260] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L547] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, is_transmit2_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, token=0] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L555] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L264] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L267] COND FALSE !(t3_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L277] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L279] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L555] RET, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, is_transmit3_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=0] [L676] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L677] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L479] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L484] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L489] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L494] COND FALSE !(T3_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L499] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L504] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L509] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L514] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L677] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L680] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L683] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L684] CALL eval() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L350] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L354] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L357] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L319] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L345] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L357] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, token=0] [L378] COND TRUE t1_st == 0 [L379] int tmp_ndt_2; [L380] tmp_ndt_2 = __VERIFIER_nondet_int() [L381] COND TRUE \read(tmp_ndt_2) [L383] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L384] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L102] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L113] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L115] t1_pc = 1 [L116] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L384] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L392] COND TRUE t2_st == 0 [L393] int tmp_ndt_3; [L394] tmp_ndt_3 = __VERIFIER_nondet_int() [L395] COND TRUE \read(tmp_ndt_3) [L397] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L398] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L138] COND TRUE t2_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L149] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L151] t2_pc = 1 [L152] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L398] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L406] COND TRUE t3_st == 0 [L407] int tmp_ndt_4; [L408] tmp_ndt_4 = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp_ndt_4) [L411] t3_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L412] CALL transmit3() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L174] COND TRUE t3_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L185] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L187] t3_pc = 1 [L188] t3_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L412] RET transmit3() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L354] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L357] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L319] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L345] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L357] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND TRUE \read(tmp_ndt_1) [L369] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L370] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L44] int tmp_var = __VERIFIER_nondet_int(); [L46] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L57] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L60] token = __VERIFIER_nondet_int() [L61] local = token [L62] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=-2] [L63] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L571] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L531] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L207] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L210] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L220] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L222] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L531] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, is_master_triggered()=0, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=-2] [L539] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L226] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L229] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L230] COND TRUE E_1 == 1 [L231] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, __retres1=1, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L241] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L539] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, is_transmit1_triggered()=1, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=-2] [L539] tmp___0 = is_transmit1_triggered() [L541] COND TRUE \read(tmp___0) [L542] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, token=-2] [L547] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L245] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L248] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L249] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L258] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L260] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L547] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, is_transmit2_triggered()=0, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, token=-2] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, token=-2] [L555] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L264] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L267] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L268] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L277] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L279] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L555] RET, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, is_transmit3_triggered()=0, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, token=-2] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0, token=-2] [L571] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L63] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=1, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=-2] [L64] E_1 = 2 [L65] m_pc = 1 [L66] m_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=-2] [L370] RET master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=-2] [L378] COND TRUE t1_st == 0 [L379] int tmp_ndt_2; [L380] tmp_ndt_2 = __VERIFIER_nondet_int() [L381] COND TRUE \read(tmp_ndt_2) [L383] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=-2] [L384] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L102] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L105] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L121] token += 1 [L122] E_2 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L123] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L571] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L531] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L207] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L210] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L211] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L220] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L222] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L531] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, is_master_triggered()=0, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=-1] [L539] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L226] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L229] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L230] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L239] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L241] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L539] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, is_transmit1_triggered()=0, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=-1] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=-1] [L547] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L245] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L248] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L249] COND TRUE E_2 == 1 [L250] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, __retres1=1, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L260] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, \result=1, __retres1=1, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L547] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, is_transmit2_triggered()=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=-1] [L547] tmp___1 = is_transmit2_triggered() [L549] COND TRUE \read(tmp___1) [L550] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, token=-1] [L555] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L264] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L267] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L268] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L277] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L279] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L555] RET, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, is_transmit3_triggered()=0, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, token=-1] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0, token=-1] [L571] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L123] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=1, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L124] E_2 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L113] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L115] t1_pc = 1 [L116] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-2, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L384] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=-1] [L392] COND TRUE t2_st == 0 [L393] int tmp_ndt_3; [L394] tmp_ndt_3 = __VERIFIER_nondet_int() [L395] COND TRUE \read(tmp_ndt_3) [L397] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=-1] [L398] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L138] COND FALSE !(t2_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L141] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L157] token += 1 [L158] E_3 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L159] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L571] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L531] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L207] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L210] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L211] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L220] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L222] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L531] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, is_master_triggered()=0, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=0] [L539] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L226] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L229] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L230] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L239] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L241] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L539] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, is_transmit1_triggered()=0, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=0] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=0] [L547] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L245] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L248] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L249] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L258] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L260] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L547] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, is_transmit2_triggered()=0, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=0] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0, token=0] [L555] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L264] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L267] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L268] COND TRUE E_3 == 1 [L269] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, __retres1=1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L279] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, \result=1, __retres1=1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L555] RET, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, is_transmit3_triggered()=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0, token=0] [L555] tmp___2 = is_transmit3_triggered() [L557] COND TRUE \read(tmp___2) [L558] t3_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1, token=0] [L571] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=0] [L159] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=1, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=0] [L160] E_3 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=0] [L149] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=0] [L151] t2_pc = 1 [L152] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=-1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=0] [L398] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L406] COND TRUE t3_st == 0 [L407] int tmp_ndt_4; [L408] tmp_ndt_4 = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp_ndt_4) [L411] t3_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L412] CALL transmit3() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L174] COND FALSE !(t3_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L177] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L193] token += 1 [L194] E_M = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L195] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L571] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L531] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L207] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L210] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L211] COND TRUE E_M == 1 [L212] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L222] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L531] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, is_master_triggered()=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L531] tmp = is_master_triggered() [L533] COND TRUE \read(tmp) [L534] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, token=1] [L539] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L226] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L229] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L230] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L239] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L241] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L539] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, is_transmit1_triggered()=0, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, token=1] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, token=1] [L547] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L245] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L248] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L249] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L258] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L260] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L547] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, is_transmit2_triggered()=0, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, token=1] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, token=1] [L555] CALL, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L264] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L267] COND TRUE t3_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L268] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L277] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L279] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L555] RET, EXPR is_transmit3_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, is_transmit3_triggered()=0, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, token=1] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, token=1] [L571] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L195] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L196] E_M = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L185] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=1] [L187] t3_pc = 1 [L188] t3_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=1, \old(t3_st)=1, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L412] RET transmit3() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=1] [L354] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=1] [L357] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L319] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L345] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L357] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread()=1, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=1] [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=1] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND TRUE \read(tmp_ndt_1) [L369] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=0, \old(token)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1, token=1] [L370] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=-2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L44] int tmp_var = __VERIFIER_nondet_int(); [L46] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=-2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=1] [L49] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=-2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=1] [L71] COND FALSE !(token != local + 3) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=-2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=1] [L76] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=-2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=1] [L77] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=-2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=1] [L82] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=-2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=1] [L83] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=-2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=1] [L84] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=-2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=1] [L85] CALL error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=-2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(local)=-2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(T3_E)=2, \old(t3_i)=0, \old(t3_pc)=0, \old(t3_st)=2, \old(token)=1, E_1=2, E_2=2, E_3=2, E_M=2, local=-2, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 25 procedures, 211 locations, 1 error locations. UNSAFE Result, 490.9s OverallTime, 47 OverallIterations, 8 TraceHistogramMax, 436.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16777 SDtfs, 27468 SDslu, 140201 SDs, 0 SdLazy, 102303 SolverSat, 9356 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12194 GetRequests, 10489 SyntacticMatches, 40 SemanticMatches, 1665 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70481 ImplicationChecksByTransitivity, 52.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20977occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.3s AbstIntTime, 24 AbstIntIterations, 10 AbstIntStrong, 0.9908602359191468 AbsIntWeakeningRatio, 0.6095979247730221 AbsIntAvgWeakeningVarsNumRemoved, 24.93514915693904 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 46 MinimizatonAttempts, 3320 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 14470 NumberOfCodeBlocks, 14470 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 18424 ConstructedInterpolants, 0 QuantifiedInterpolants, 7704187 SizeOfPredicates, 20 NumberOfNonLiveVariables, 18974 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 74 InterpolantComputations, 38 PerfectInterpolantSequences, 16000/16985 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...