/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 23:24:54,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 23:24:54,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 23:24:54,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 23:24:54,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 23:24:54,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 23:24:54,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 23:24:54,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 23:24:54,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 23:24:54,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 23:24:54,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 23:24:54,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 23:24:54,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 23:24:54,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 23:24:54,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 23:24:54,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 23:24:54,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 23:24:54,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 23:24:54,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 23:24:54,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 23:24:54,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 23:24:54,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 23:24:54,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 23:24:54,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 23:24:54,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 23:24:54,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 23:24:54,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 23:24:54,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 23:24:54,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 23:24:54,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 23:24:54,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 23:24:54,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 23:24:54,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 23:24:54,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 23:24:54,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 23:24:54,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 23:24:54,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 23:24:54,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 23:24:54,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 23:24:54,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 23:24:54,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 23:24:54,142 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 23:24:54,168 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 23:24:54,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 23:24:54,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 23:24:54,172 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 23:24:54,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 23:24:54,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 23:24:54,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 23:24:54,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 23:24:54,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 23:24:54,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 23:24:54,174 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 23:24:54,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 23:24:54,174 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 23:24:54,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 23:24:54,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 23:24:54,176 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 23:24:54,176 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 23:24:54,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 23:24:54,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:24:54,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 23:24:54,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 23:24:54,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 23:24:54,178 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 23:24:54,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 23:24:54,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 23:24:54,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 23:24:54,710 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 23:24:54,711 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 23:24:54,712 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-09-04 23:24:54,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/493c88532/6a1188ffb1d944a3b489fc2489ff34e5/FLAG2027a31f0 [2020-09-04 23:24:55,404 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 23:24:55,405 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-09-04 23:24:55,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/493c88532/6a1188ffb1d944a3b489fc2489ff34e5/FLAG2027a31f0 [2020-09-04 23:24:55,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/493c88532/6a1188ffb1d944a3b489fc2489ff34e5 [2020-09-04 23:24:55,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 23:24:55,733 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 23:24:55,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 23:24:55,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 23:24:55,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 23:24:55,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:24:55" (1/1) ... [2020-09-04 23:24:55,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@177f3252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:55, skipping insertion in model container [2020-09-04 23:24:55,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:24:55" (1/1) ... [2020-09-04 23:24:55,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 23:24:55,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 23:24:56,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:24:56,101 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 23:24:56,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:24:56,167 INFO L208 MainTranslator]: Completed translation [2020-09-04 23:24:56,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:56 WrapperNode [2020-09-04 23:24:56,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 23:24:56,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 23:24:56,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 23:24:56,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 23:24:56,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:56" (1/1) ... [2020-09-04 23:24:56,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:56" (1/1) ... [2020-09-04 23:24:56,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:56" (1/1) ... [2020-09-04 23:24:56,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:56" (1/1) ... [2020-09-04 23:24:56,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:56" (1/1) ... [2020-09-04 23:24:56,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:56" (1/1) ... [2020-09-04 23:24:56,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:56" (1/1) ... [2020-09-04 23:24:56,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 23:24:56,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 23:24:56,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 23:24:56,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 23:24:56,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:56" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:24:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 23:24:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 23:24:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-09-04 23:24:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-09-04 23:24:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-09-04 23:24:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-09-04 23:24:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-09-04 23:24:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-09-04 23:24:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-09-04 23:24:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-09-04 23:24:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-09-04 23:24:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-09-04 23:24:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-09-04 23:24:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-09-04 23:24:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-09-04 23:24:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-09-04 23:24:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-09-04 23:24:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-09-04 23:24:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-09-04 23:24:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-09-04 23:24:56,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 23:24:56,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 23:24:56,404 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-09-04 23:24:56,404 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-09-04 23:24:56,404 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-09-04 23:24:56,405 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-09-04 23:24:56,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 23:24:56,405 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-09-04 23:24:56,405 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-09-04 23:24:56,405 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-09-04 23:24:56,406 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-09-04 23:24:56,406 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-09-04 23:24:56,406 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-09-04 23:24:56,406 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-09-04 23:24:56,406 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-09-04 23:24:56,407 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-09-04 23:24:56,407 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-09-04 23:24:56,407 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-09-04 23:24:56,407 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-09-04 23:24:56,407 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-09-04 23:24:56,407 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-09-04 23:24:56,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 23:24:56,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 23:24:56,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 23:24:56,989 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 23:24:56,990 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-09-04 23:24:56,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:24:56 BoogieIcfgContainer [2020-09-04 23:24:56,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 23:24:56,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 23:24:56,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 23:24:57,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 23:24:57,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 11:24:55" (1/3) ... [2020-09-04 23:24:57,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b1e8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:24:57, skipping insertion in model container [2020-09-04 23:24:57,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:56" (2/3) ... [2020-09-04 23:24:57,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b1e8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:24:57, skipping insertion in model container [2020-09-04 23:24:57,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:24:56" (3/3) ... [2020-09-04 23:24:57,007 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-09-04 23:24:57,016 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 23:24:57,027 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 23:24:57,047 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 23:24:57,073 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 23:24:57,074 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 23:24:57,074 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 23:24:57,074 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 23:24:57,074 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 23:24:57,074 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 23:24:57,074 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 23:24:57,075 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 23:24:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2020-09-04 23:24:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-09-04 23:24:57,117 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:57,119 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:24:57,119 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:57,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:57,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1293744950, now seen corresponding path program 1 times [2020-09-04 23:24:57,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:57,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1878274535] [2020-09-04 23:24:57,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:57,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:57,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:24:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:57,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:24:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:57,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:24:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:57,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:24:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:57,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:24:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:57,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:24:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:57,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:24:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:57,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:24:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:57,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:24:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:24:57,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1878274535] [2020-09-04 23:24:57,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:24:57,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 23:24:57,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004470547] [2020-09-04 23:24:57,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:24:57,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:57,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:24:57,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:24:57,785 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 7 states. [2020-09-04 23:24:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:59,790 INFO L93 Difference]: Finished difference Result 795 states and 1083 transitions. [2020-09-04 23:24:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 23:24:59,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2020-09-04 23:24:59,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:59,817 INFO L225 Difference]: With dead ends: 795 [2020-09-04 23:24:59,817 INFO L226 Difference]: Without dead ends: 585 [2020-09-04 23:24:59,826 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-09-04 23:24:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-09-04 23:24:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 431. [2020-09-04 23:24:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-09-04 23:24:59,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 538 transitions. [2020-09-04 23:24:59,994 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 538 transitions. Word has length 110 [2020-09-04 23:24:59,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:59,995 INFO L479 AbstractCegarLoop]: Abstraction has 431 states and 538 transitions. [2020-09-04 23:24:59,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:24:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 538 transitions. [2020-09-04 23:25:00,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-09-04 23:25:00,002 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:00,003 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:00,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 23:25:00,003 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:00,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:00,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1206698500, now seen corresponding path program 1 times [2020-09-04 23:25:00,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:00,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1152122353] [2020-09-04 23:25:00,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:25:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-09-04 23:25:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-09-04 23:25:00,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1152122353] [2020-09-04 23:25:00,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:00,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 23:25:00,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615667999] [2020-09-04 23:25:00,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:25:00,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:00,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:25:00,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:25:00,399 INFO L87 Difference]: Start difference. First operand 431 states and 538 transitions. Second operand 9 states. [2020-09-04 23:25:03,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:03,948 INFO L93 Difference]: Finished difference Result 1528 states and 2039 transitions. [2020-09-04 23:25:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 23:25:03,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 176 [2020-09-04 23:25:03,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:03,960 INFO L225 Difference]: With dead ends: 1528 [2020-09-04 23:25:03,960 INFO L226 Difference]: Without dead ends: 1137 [2020-09-04 23:25:03,964 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2020-09-04 23:25:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2020-09-04 23:25:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 847. [2020-09-04 23:25:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2020-09-04 23:25:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1093 transitions. [2020-09-04 23:25:04,113 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1093 transitions. Word has length 176 [2020-09-04 23:25:04,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:04,114 INFO L479 AbstractCegarLoop]: Abstraction has 847 states and 1093 transitions. [2020-09-04 23:25:04,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:25:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1093 transitions. [2020-09-04 23:25:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2020-09-04 23:25:04,128 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:04,129 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-04 23:25:04,130 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 23:25:04,130 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:04,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1703508036, now seen corresponding path program 1 times [2020-09-04 23:25:04,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:04,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [718080186] [2020-09-04 23:25:04,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2020-09-04 23:25:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-09-04 23:25:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2020-09-04 23:25:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2020-09-04 23:25:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2020-09-04 23:25:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2020-09-04 23:25:04,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [718080186] [2020-09-04 23:25:04,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:04,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 23:25:04,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262405593] [2020-09-04 23:25:04,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:25:04,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:04,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:25:04,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:25:04,671 INFO L87 Difference]: Start difference. First operand 847 states and 1093 transitions. Second operand 10 states. [2020-09-04 23:25:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:06,707 INFO L93 Difference]: Finished difference Result 1979 states and 2578 transitions. [2020-09-04 23:25:06,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 23:25:06,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 289 [2020-09-04 23:25:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:06,716 INFO L225 Difference]: With dead ends: 1979 [2020-09-04 23:25:06,717 INFO L226 Difference]: Without dead ends: 1170 [2020-09-04 23:25:06,721 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2020-09-04 23:25:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-09-04 23:25:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 838. [2020-09-04 23:25:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-09-04 23:25:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1078 transitions. [2020-09-04 23:25:06,840 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1078 transitions. Word has length 289 [2020-09-04 23:25:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:06,861 INFO L479 AbstractCegarLoop]: Abstraction has 838 states and 1078 transitions. [2020-09-04 23:25:06,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:25:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1078 transitions. [2020-09-04 23:25:06,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2020-09-04 23:25:06,867 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:06,867 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2020-09-04 23:25:06,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 23:25:06,868 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:06,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:06,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1912018981, now seen corresponding path program 1 times [2020-09-04 23:25:06,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:06,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1560367272] [2020-09-04 23:25:06,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:06,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:25:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-09-04 23:25:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2020-09-04 23:25:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-09-04 23:25:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-09-04 23:25:07,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1560367272] [2020-09-04 23:25:07,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:07,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 23:25:07,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366034110] [2020-09-04 23:25:07,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:25:07,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:07,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:25:07,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:25:07,378 INFO L87 Difference]: Start difference. First operand 838 states and 1078 transitions. Second operand 12 states. [2020-09-04 23:25:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:09,841 INFO L93 Difference]: Finished difference Result 1986 states and 2632 transitions. [2020-09-04 23:25:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 23:25:09,841 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 226 [2020-09-04 23:25:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:09,851 INFO L225 Difference]: With dead ends: 1986 [2020-09-04 23:25:09,851 INFO L226 Difference]: Without dead ends: 953 [2020-09-04 23:25:09,860 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2020-09-04 23:25:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2020-09-04 23:25:10,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 691. [2020-09-04 23:25:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-09-04 23:25:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 858 transitions. [2020-09-04 23:25:10,008 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 858 transitions. Word has length 226 [2020-09-04 23:25:10,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:10,010 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 858 transitions. [2020-09-04 23:25:10,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:25:10,010 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 858 transitions. [2020-09-04 23:25:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-09-04 23:25:10,017 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:10,017 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:10,018 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 23:25:10,018 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:10,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1527598382, now seen corresponding path program 2 times [2020-09-04 23:25:10,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:10,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1838126831] [2020-09-04 23:25:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:25:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-09-04 23:25:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2020-09-04 23:25:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-09-04 23:25:10,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1838126831] [2020-09-04 23:25:10,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:10,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 23:25:10,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757468011] [2020-09-04 23:25:10,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:25:10,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:10,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:25:10,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:25:10,480 INFO L87 Difference]: Start difference. First operand 691 states and 858 transitions. Second operand 10 states. [2020-09-04 23:25:14,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:14,092 INFO L93 Difference]: Finished difference Result 2333 states and 3090 transitions. [2020-09-04 23:25:14,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 23:25:14,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 225 [2020-09-04 23:25:14,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:14,108 INFO L225 Difference]: With dead ends: 2333 [2020-09-04 23:25:14,109 INFO L226 Difference]: Without dead ends: 1680 [2020-09-04 23:25:14,115 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2020-09-04 23:25:14,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2020-09-04 23:25:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1279. [2020-09-04 23:25:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2020-09-04 23:25:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1565 transitions. [2020-09-04 23:25:14,290 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1565 transitions. Word has length 225 [2020-09-04 23:25:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:14,291 INFO L479 AbstractCegarLoop]: Abstraction has 1279 states and 1565 transitions. [2020-09-04 23:25:14,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:25:14,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1565 transitions. [2020-09-04 23:25:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-09-04 23:25:14,297 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:14,298 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-04 23:25:14,298 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 23:25:14,298 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:14,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:14,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1201348035, now seen corresponding path program 1 times [2020-09-04 23:25:14,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:14,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [969272932] [2020-09-04 23:25:14,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-09-04 23:25:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-04 23:25:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-09-04 23:25:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-09-04 23:25:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2020-09-04 23:25:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2020-09-04 23:25:14,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [969272932] [2020-09-04 23:25:14,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:14,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 23:25:14,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837121646] [2020-09-04 23:25:14,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:25:14,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:14,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:25:14,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:25:14,609 INFO L87 Difference]: Start difference. First operand 1279 states and 1565 transitions. Second operand 9 states. [2020-09-04 23:25:17,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:17,217 INFO L93 Difference]: Finished difference Result 2930 states and 3716 transitions. [2020-09-04 23:25:17,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 23:25:17,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 254 [2020-09-04 23:25:17,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:17,231 INFO L225 Difference]: With dead ends: 2930 [2020-09-04 23:25:17,231 INFO L226 Difference]: Without dead ends: 1690 [2020-09-04 23:25:17,238 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2020-09-04 23:25:17,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2020-09-04 23:25:17,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1279. [2020-09-04 23:25:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2020-09-04 23:25:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1553 transitions. [2020-09-04 23:25:17,432 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1553 transitions. Word has length 254 [2020-09-04 23:25:17,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:17,432 INFO L479 AbstractCegarLoop]: Abstraction has 1279 states and 1553 transitions. [2020-09-04 23:25:17,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:25:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1553 transitions. [2020-09-04 23:25:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-09-04 23:25:17,439 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:17,439 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:17,440 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 23:25:17,440 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:17,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:17,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1453934466, now seen corresponding path program 1 times [2020-09-04 23:25:17,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:17,441 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [396763776] [2020-09-04 23:25:17,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:25:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-09-04 23:25:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-09-04 23:25:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-09-04 23:25:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2020-09-04 23:25:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 38 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-09-04 23:25:17,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [396763776] [2020-09-04 23:25:17,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:17,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 23:25:17,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386957901] [2020-09-04 23:25:17,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:25:17,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:17,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:25:17,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:25:17,831 INFO L87 Difference]: Start difference. First operand 1279 states and 1553 transitions. Second operand 10 states. [2020-09-04 23:25:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:21,756 INFO L93 Difference]: Finished difference Result 4387 states and 5560 transitions. [2020-09-04 23:25:21,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 23:25:21,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 254 [2020-09-04 23:25:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:21,777 INFO L225 Difference]: With dead ends: 4387 [2020-09-04 23:25:21,777 INFO L226 Difference]: Without dead ends: 3147 [2020-09-04 23:25:21,787 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=240, Invalid=816, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 23:25:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2020-09-04 23:25:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 2409. [2020-09-04 23:25:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2409 states. [2020-09-04 23:25:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2409 states and 2950 transitions. [2020-09-04 23:25:22,063 INFO L78 Accepts]: Start accepts. Automaton has 2409 states and 2950 transitions. Word has length 254 [2020-09-04 23:25:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:22,063 INFO L479 AbstractCegarLoop]: Abstraction has 2409 states and 2950 transitions. [2020-09-04 23:25:22,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:25:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 2950 transitions. [2020-09-04 23:25:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2020-09-04 23:25:22,071 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:22,072 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:22,072 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 23:25:22,072 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:22,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash 564718689, now seen corresponding path program 1 times [2020-09-04 23:25:22,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:22,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1703366991] [2020-09-04 23:25:22,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:25:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 23:25:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-09-04 23:25:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 23:25:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2020-09-04 23:25:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-09-04 23:25:22,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1703366991] [2020-09-04 23:25:22,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:25:22,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 23:25:22,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023614950] [2020-09-04 23:25:22,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 23:25:22,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:22,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 23:25:22,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-09-04 23:25:22,478 INFO L87 Difference]: Start difference. First operand 2409 states and 2950 transitions. Second operand 14 states. [2020-09-04 23:25:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:27,509 INFO L93 Difference]: Finished difference Result 5356 states and 6878 transitions. [2020-09-04 23:25:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-09-04 23:25:27,509 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 260 [2020-09-04 23:25:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:27,530 INFO L225 Difference]: With dead ends: 5356 [2020-09-04 23:25:27,531 INFO L226 Difference]: Without dead ends: 2987 [2020-09-04 23:25:27,541 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=442, Invalid=1628, Unknown=0, NotChecked=0, Total=2070 [2020-09-04 23:25:27,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2020-09-04 23:25:27,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2415. [2020-09-04 23:25:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2415 states. [2020-09-04 23:25:28,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 2906 transitions. [2020-09-04 23:25:28,001 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 2906 transitions. Word has length 260 [2020-09-04 23:25:28,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:28,002 INFO L479 AbstractCegarLoop]: Abstraction has 2415 states and 2906 transitions. [2020-09-04 23:25:28,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 23:25:28,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 2906 transitions. [2020-09-04 23:25:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2020-09-04 23:25:28,011 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:28,011 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:28,012 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 23:25:28,012 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:28,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:28,012 INFO L82 PathProgramCache]: Analyzing trace with hash -622546722, now seen corresponding path program 1 times [2020-09-04 23:25:28,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:28,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [563434865] [2020-09-04 23:25:28,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:25:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 23:25:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-09-04 23:25:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 23:25:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2020-09-04 23:25:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-09-04 23:25:28,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [563434865] [2020-09-04 23:25:28,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:28,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 23:25:28,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432915603] [2020-09-04 23:25:28,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:25:28,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:28,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:25:28,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:25:28,511 INFO L87 Difference]: Start difference. First operand 2415 states and 2906 transitions. Second operand 12 states. [2020-09-04 23:25:35,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:35,188 INFO L93 Difference]: Finished difference Result 7890 states and 9700 transitions. [2020-09-04 23:25:35,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-09-04 23:25:35,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 260 [2020-09-04 23:25:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:35,236 INFO L225 Difference]: With dead ends: 7890 [2020-09-04 23:25:35,236 INFO L226 Difference]: Without dead ends: 5519 [2020-09-04 23:25:35,250 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=332, Invalid=1308, Unknown=0, NotChecked=0, Total=1640 [2020-09-04 23:25:35,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2020-09-04 23:25:36,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 4386. [2020-09-04 23:25:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4386 states. [2020-09-04 23:25:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4386 states to 4386 states and 5308 transitions. [2020-09-04 23:25:36,636 INFO L78 Accepts]: Start accepts. Automaton has 4386 states and 5308 transitions. Word has length 260 [2020-09-04 23:25:36,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:36,639 INFO L479 AbstractCegarLoop]: Abstraction has 4386 states and 5308 transitions. [2020-09-04 23:25:36,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:25:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4386 states and 5308 transitions. [2020-09-04 23:25:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2020-09-04 23:25:36,656 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:36,657 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:36,657 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 23:25:36,658 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:36,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:36,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1607368582, now seen corresponding path program 1 times [2020-09-04 23:25:36,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:36,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2047840021] [2020-09-04 23:25:36,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:25:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 23:25:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-09-04 23:25:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 23:25:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:36,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:37,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2020-09-04 23:25:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-09-04 23:25:37,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2047840021] [2020-09-04 23:25:37,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:37,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 23:25:37,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265200671] [2020-09-04 23:25:37,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:25:37,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:37,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:25:37,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:25:37,097 INFO L87 Difference]: Start difference. First operand 4386 states and 5308 transitions. Second operand 9 states. [2020-09-04 23:25:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:39,665 INFO L93 Difference]: Finished difference Result 8470 states and 10434 transitions. [2020-09-04 23:25:39,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 23:25:39,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 264 [2020-09-04 23:25:39,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:39,696 INFO L225 Difference]: With dead ends: 8470 [2020-09-04 23:25:39,696 INFO L226 Difference]: Without dead ends: 5371 [2020-09-04 23:25:39,709 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2020-09-04 23:25:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5371 states. [2020-09-04 23:25:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5371 to 4412. [2020-09-04 23:25:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4412 states. [2020-09-04 23:25:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4412 states to 4412 states and 5346 transitions. [2020-09-04 23:25:40,578 INFO L78 Accepts]: Start accepts. Automaton has 4412 states and 5346 transitions. Word has length 264 [2020-09-04 23:25:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:40,578 INFO L479 AbstractCegarLoop]: Abstraction has 4412 states and 5346 transitions. [2020-09-04 23:25:40,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:25:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4412 states and 5346 transitions. [2020-09-04 23:25:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-09-04 23:25:40,592 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:40,593 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:40,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 23:25:40,593 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:40,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:40,594 INFO L82 PathProgramCache]: Analyzing trace with hash -424779163, now seen corresponding path program 1 times [2020-09-04 23:25:40,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:40,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [509524022] [2020-09-04 23:25:40,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:25:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 23:25:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 23:25:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 23:25:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-09-04 23:25:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 23:25:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-09-04 23:25:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:25:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 23:25:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-09-04 23:25:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 23:25:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-09-04 23:25:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-09-04 23:25:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 23:25:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:25:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 23:25:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:25:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2020-09-04 23:25:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:25:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-09-04 23:25:40,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [509524022] [2020-09-04 23:25:40,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:25:40,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 23:25:40,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134474562] [2020-09-04 23:25:40,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 23:25:40,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:25:40,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 23:25:40,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:25:40,878 INFO L87 Difference]: Start difference. First operand 4412 states and 5346 transitions. Second operand 9 states. [2020-09-04 23:25:42,555 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-09-04 23:25:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:25:43,314 INFO L93 Difference]: Finished difference Result 8530 states and 10535 transitions. [2020-09-04 23:25:43,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 23:25:43,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 265 [2020-09-04 23:25:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:25:43,346 INFO L225 Difference]: With dead ends: 8530 [2020-09-04 23:25:43,347 INFO L226 Difference]: Without dead ends: 5405 [2020-09-04 23:25:43,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2020-09-04 23:25:43,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2020-09-04 23:25:44,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 4416. [2020-09-04 23:25:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4416 states. [2020-09-04 23:25:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 4416 states and 5350 transitions. [2020-09-04 23:25:44,222 INFO L78 Accepts]: Start accepts. Automaton has 4416 states and 5350 transitions. Word has length 265 [2020-09-04 23:25:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:25:44,223 INFO L479 AbstractCegarLoop]: Abstraction has 4416 states and 5350 transitions. [2020-09-04 23:25:44,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 23:25:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 4416 states and 5350 transitions. [2020-09-04 23:25:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-09-04 23:25:44,232 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:25:44,232 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:25:44,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 23:25:44,233 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:25:44,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:25:44,233 INFO L82 PathProgramCache]: Analyzing trace with hash -482037465, now seen corresponding path program 1 times [2020-09-04 23:25:44,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:25:44,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720827907] [2020-09-04 23:25:44,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:25:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 23:25:44,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 23:25:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 23:25:44,328 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 23:25:44,431 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 23:25:44,431 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 23:25:44,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 23:25:44,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 11:25:44 BoogieIcfgContainer [2020-09-04 23:25:44,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 23:25:44,630 INFO L168 Benchmark]: Toolchain (without parser) took 48898.06 ms. Allocated memory was 145.2 MB in the beginning and 1.1 GB in the end (delta: 911.7 MB). Free memory was 102.7 MB in the beginning and 675.6 MB in the end (delta: -572.9 MB). Peak memory consumption was 338.8 MB. Max. memory is 7.1 GB. [2020-09-04 23:25:44,631 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 145.2 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 23:25:44,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.62 ms. Allocated memory is still 145.2 MB. Free memory was 102.5 MB in the beginning and 88.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-09-04 23:25:44,632 INFO L168 Benchmark]: Boogie Preprocessor took 146.48 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 88.9 MB in the beginning and 179.8 MB in the end (delta: -90.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-09-04 23:25:44,633 INFO L168 Benchmark]: RCFGBuilder took 681.73 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 141.8 MB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 7.1 GB. [2020-09-04 23:25:44,634 INFO L168 Benchmark]: TraceAbstraction took 47629.52 ms. Allocated memory was 202.9 MB in the beginning and 1.1 GB in the end (delta: 854.1 MB). Free memory was 141.1 MB in the beginning and 675.6 MB in the end (delta: -534.5 MB). Peak memory consumption was 319.5 MB. Max. memory is 7.1 GB. [2020-09-04 23:25:44,637 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 145.2 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 434.62 ms. Allocated memory is still 145.2 MB. Free memory was 102.5 MB in the beginning and 88.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 146.48 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 88.9 MB in the beginning and 179.8 MB in the end (delta: -90.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 681.73 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 141.8 MB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47629.52 ms. Allocated memory was 202.9 MB in the beginning and 1.1 GB in the end (delta: 854.1 MB). Free memory was 141.1 MB in the beginning and 675.6 MB in the end (delta: -534.5 MB). Peak memory consumption was 319.5 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; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=16, m_i=9, m_pc=0, m_st=13, T1_E=6, t1_i=17, t1_pc=11, t1_st=8, token=12] [L15] int t1_pc = 0; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=16, m_i=9, m_pc=0, m_st=13, T1_E=6, t1_i=17, t1_pc=0, t1_st=8, token=12] [L16] int m_st ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=16, m_i=9, m_pc=0, m_st=0, T1_E=6, t1_i=17, t1_pc=0, t1_st=8, token=12] [L17] int t1_st ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=16, m_i=9, m_pc=0, m_st=0, T1_E=6, t1_i=17, t1_pc=0, t1_st=0, token=12] [L18] int m_i ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=16, m_i=0, m_pc=0, m_st=0, T1_E=6, t1_i=17, t1_pc=0, t1_st=0, token=12] [L19] int t1_i ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=16, m_i=0, m_pc=0, m_st=0, T1_E=6, t1_i=0, t1_pc=0, t1_st=0, token=12] [L20] int M_E = 2; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=6, t1_i=0, t1_pc=0, t1_st=0, token=12] [L21] int T1_E = 2; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=12] [L22] int E_M = 2; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=2, local=7, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=12] [L23] int E_1 = 2; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=2, E_M=2, local=7, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=12] [L27] int token ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=2, E_M=2, local=7, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L29] int local ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L475] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L479] CALL init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L390] m_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L391] t1_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L479] RET init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L480] CALL start_simulation() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L416] int kernel_st ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L417] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L418] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] kernel_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L423] FCALL update_channels() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] CALL init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L172] COND TRUE m_i == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L173] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L177] COND TRUE t1_i == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L178] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] RET init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L261] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L266] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L329] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L426] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L289] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L294] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L430] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] kernel_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL eval() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L208] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L190] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L222] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L223] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L224] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L236] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L237] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L238] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L239] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L241] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L90] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] t1_pc = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L104] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L242] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L190] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L222] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L223] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_2=1, token=0] [L224] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L225] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L227] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L32] int tmp_var = __VERIFIER_nondet_int(); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L34] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L45] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L48] token = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L49] local = token VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L50] E_1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L51] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L314] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] COND TRUE E_1 == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L147] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, tmp___0=1, token=0] [L329] COND TRUE \read(tmp___0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, tmp___0=1, token=0] [L330] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L51] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L52] E_1 = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L53] m_pc = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L54] m_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L228] RET master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L236] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L237] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, token=0] [L238] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L239] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L241] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L93] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L109] token += 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L110] E_M = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L314] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L126] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L127] COND TRUE E_M == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L128] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L321] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L322] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L327] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L329] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] t1_pc = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L104] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L242] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L190] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L222] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L223] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_2=1, token=1] [L224] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L225] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L227] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L32] int tmp_var = __VERIFIER_nondet_int(); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, __VERIFIER_nondet_int()=5, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L34] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L37] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L59] COND FALSE !(token != local + 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L64] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L65] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L72] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L73] CALL error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 47.3s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 37.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3193 SDtfs, 12017 SDslu, 1167 SDs, 0 SdLazy, 17810 SolverSat, 4139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 852 GetRequests, 556 SyntacticMatches, 1 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2060 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4416occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 6241 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2848 NumberOfCodeBlocks, 2848 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2572 ConstructedInterpolants, 0 QuantifiedInterpolants, 1194317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 1345/1378 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...