/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 02:41:26,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 02:41:26,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 02:41:27,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 02:41:27,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 02:41:27,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 02:41:27,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 02:41:27,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 02:41:27,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 02:41:27,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 02:41:27,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 02:41:27,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 02:41:27,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 02:41:27,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 02:41:27,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 02:41:27,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 02:41:27,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 02:41:27,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 02:41:27,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 02:41:27,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 02:41:27,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 02:41:27,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 02:41:27,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 02:41:27,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 02:41:27,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 02:41:27,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 02:41:27,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 02:41:27,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 02:41:27,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 02:41:27,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 02:41:27,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 02:41:27,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 02:41:27,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 02:41:27,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 02:41:27,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 02:41:27,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 02:41:27,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 02:41:27,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 02:41:27,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 02:41:27,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 02:41:27,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 02:41:27,113 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 02:41:27,141 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 02:41:27,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 02:41:27,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 02:41:27,146 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 02:41:27,146 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 02:41:27,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 02:41:27,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 02:41:27,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 02:41:27,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 02:41:27,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 02:41:27,149 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 02:41:27,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 02:41:27,149 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 02:41:27,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 02:41:27,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 02:41:27,150 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 02:41:27,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 02:41:27,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 02:41:27,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 02:41:27,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 02:41:27,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 02:41:27,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 02:41:27,152 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 02:41:27,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 02:41:27,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 02:41:27,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 02:41:27,635 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 02:41:27,636 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 02:41:27,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-10-24 02:41:27,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/693fe2dc3/064ef37faad94481a1068705f95783c8/FLAG23a05e098 [2020-10-24 02:41:28,461 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 02:41:28,462 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-10-24 02:41:28,472 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/693fe2dc3/064ef37faad94481a1068705f95783c8/FLAG23a05e098 [2020-10-24 02:41:28,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/693fe2dc3/064ef37faad94481a1068705f95783c8 [2020-10-24 02:41:28,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 02:41:28,839 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 02:41:28,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 02:41:28,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 02:41:28,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 02:41:28,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:41:28" (1/1) ... [2020-10-24 02:41:28,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5433dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:28, skipping insertion in model container [2020-10-24 02:41:28,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:41:28" (1/1) ... [2020-10-24 02:41:28,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 02:41:28,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 02:41:29,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:41:29,127 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 02:41:29,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:41:29,258 INFO L208 MainTranslator]: Completed translation [2020-10-24 02:41:29,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:29 WrapperNode [2020-10-24 02:41:29,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 02:41:29,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 02:41:29,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 02:41:29,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 02:41:29,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:29" (1/1) ... [2020-10-24 02:41:29,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:29" (1/1) ... [2020-10-24 02:41:29,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:29" (1/1) ... [2020-10-24 02:41:29,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:29" (1/1) ... [2020-10-24 02:41:29,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:29" (1/1) ... [2020-10-24 02:41:29,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:29" (1/1) ... [2020-10-24 02:41:29,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:29" (1/1) ... [2020-10-24 02:41:29,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 02:41:29,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 02:41:29,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 02:41:29,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 02:41:29,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 02:41:29,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 02:41:29,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 02:41:29,409 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 02:41:29,409 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-10-24 02:41:29,409 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-10-24 02:41:29,409 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-10-24 02:41:29,410 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-10-24 02:41:29,410 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-10-24 02:41:29,410 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-10-24 02:41:29,410 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-10-24 02:41:29,410 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-10-24 02:41:29,411 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-10-24 02:41:29,411 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-10-24 02:41:29,411 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-10-24 02:41:29,411 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-10-24 02:41:29,412 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-10-24 02:41:29,412 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-10-24 02:41:29,412 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-10-24 02:41:29,412 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-10-24 02:41:29,414 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-10-24 02:41:29,414 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-10-24 02:41:29,414 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 02:41:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 02:41:29,418 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 02:41:29,418 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 02:41:29,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 02:41:29,418 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-10-24 02:41:29,419 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-10-24 02:41:29,419 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-10-24 02:41:29,419 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-10-24 02:41:29,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 02:41:29,420 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-10-24 02:41:29,420 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-10-24 02:41:29,420 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-10-24 02:41:29,420 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-10-24 02:41:29,420 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-10-24 02:41:29,421 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-10-24 02:41:29,421 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-10-24 02:41:29,421 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-10-24 02:41:29,421 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-10-24 02:41:29,421 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-10-24 02:41:29,422 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-10-24 02:41:29,422 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-10-24 02:41:29,422 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-10-24 02:41:29,422 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-10-24 02:41:29,422 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 02:41:29,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 02:41:29,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 02:41:29,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 02:41:29,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 02:41:29,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 02:41:29,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 02:41:30,331 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 02:41:30,331 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-10-24 02:41:30,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:41:30 BoogieIcfgContainer [2020-10-24 02:41:30,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 02:41:30,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 02:41:30,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 02:41:30,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 02:41:30,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:41:28" (1/3) ... [2020-10-24 02:41:30,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200fd317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:41:30, skipping insertion in model container [2020-10-24 02:41:30,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:41:29" (2/3) ... [2020-10-24 02:41:30,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200fd317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:41:30, skipping insertion in model container [2020-10-24 02:41:30,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:41:30" (3/3) ... [2020-10-24 02:41:30,343 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-10-24 02:41:30,355 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 02:41:30,361 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 02:41:30,375 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 02:41:30,399 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 02:41:30,399 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 02:41:30,399 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 02:41:30,400 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 02:41:30,400 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 02:41:30,400 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 02:41:30,400 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 02:41:30,400 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 02:41:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states. [2020-10-24 02:41:30,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-10-24 02:41:30,440 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:30,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:30,441 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:30,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:30,448 INFO L82 PathProgramCache]: Analyzing trace with hash -394934797, now seen corresponding path program 1 times [2020-10-24 02:41:30,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:30,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1100090869] [2020-10-24 02:41:30,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:30,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:31,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:31,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:41:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:31,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:41:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:31,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:41:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:31,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:41:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:31,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:31,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:31,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:31,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:41:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:41:31,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1100090869] [2020-10-24 02:41:31,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:41:31,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-24 02:41:31,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192633675] [2020-10-24 02:41:31,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:41:31,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:31,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:41:31,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:41:31,245 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 7 states. [2020-10-24 02:41:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:34,543 INFO L93 Difference]: Finished difference Result 807 states and 1081 transitions. [2020-10-24 02:41:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 02:41:34,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2020-10-24 02:41:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:34,577 INFO L225 Difference]: With dead ends: 807 [2020-10-24 02:41:34,578 INFO L226 Difference]: Without dead ends: 593 [2020-10-24 02:41:34,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:41:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-10-24 02:41:34,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 412. [2020-10-24 02:41:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-10-24 02:41:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 501 transitions. [2020-10-24 02:41:34,784 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 501 transitions. Word has length 119 [2020-10-24 02:41:34,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:34,786 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 501 transitions. [2020-10-24 02:41:34,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:41:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 501 transitions. [2020-10-24 02:41:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-24 02:41:34,793 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:34,794 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:34,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 02:41:34,795 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:34,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:34,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1396639943, now seen corresponding path program 1 times [2020-10-24 02:41:34,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:34,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1783800950] [2020-10-24 02:41:34,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,104 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-24 02:41:35,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:41:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:41:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:41:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:41:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:41:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 02:41:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:41:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-10-24 02:41:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-24 02:41:35,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1783800950] [2020-10-24 02:41:35,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:41:35,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-24 02:41:35,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369997450] [2020-10-24 02:41:35,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:41:35,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:35,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:41:35,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:41:35,668 INFO L87 Difference]: Start difference. First operand 412 states and 501 transitions. Second operand 10 states. [2020-10-24 02:41:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:39,716 INFO L93 Difference]: Finished difference Result 1573 states and 2156 transitions. [2020-10-24 02:41:39,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 02:41:39,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2020-10-24 02:41:39,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:39,732 INFO L225 Difference]: With dead ends: 1573 [2020-10-24 02:41:39,732 INFO L226 Difference]: Without dead ends: 1209 [2020-10-24 02:41:39,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2020-10-24 02:41:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-10-24 02:41:40,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 786. [2020-10-24 02:41:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-10-24 02:41:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 994 transitions. [2020-10-24 02:41:40,034 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 994 transitions. Word has length 185 [2020-10-24 02:41:40,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:40,036 INFO L481 AbstractCegarLoop]: Abstraction has 786 states and 994 transitions. [2020-10-24 02:41:40,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:41:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 994 transitions. [2020-10-24 02:41:40,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-10-24 02:41:40,048 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:40,049 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:40,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 02:41:40,049 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:40,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:40,050 INFO L82 PathProgramCache]: Analyzing trace with hash 396419367, now seen corresponding path program 1 times [2020-10-24 02:41:40,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:40,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [474946075] [2020-10-24 02:41:40,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:41:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:41:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:41:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:41:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:41:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 02:41:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:41:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-10-24 02:41:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-10-24 02:41:40,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [474946075] [2020-10-24 02:41:40,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:41:40,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-24 02:41:40,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183971575] [2020-10-24 02:41:40,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:41:40,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:40,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:41:40,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:41:40,422 INFO L87 Difference]: Start difference. First operand 786 states and 994 transitions. Second operand 9 states. [2020-10-24 02:41:42,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:42,776 INFO L93 Difference]: Finished difference Result 1834 states and 2385 transitions. [2020-10-24 02:41:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 02:41:42,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 185 [2020-10-24 02:41:42,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:42,787 INFO L225 Difference]: With dead ends: 1834 [2020-10-24 02:41:42,787 INFO L226 Difference]: Without dead ends: 1094 [2020-10-24 02:41:42,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2020-10-24 02:41:42,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2020-10-24 02:41:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 780. [2020-10-24 02:41:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-10-24 02:41:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 983 transitions. [2020-10-24 02:41:42,976 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 983 transitions. Word has length 185 [2020-10-24 02:41:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:42,980 INFO L481 AbstractCegarLoop]: Abstraction has 780 states and 983 transitions. [2020-10-24 02:41:42,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:41:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 983 transitions. [2020-10-24 02:41:42,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-10-24 02:41:42,986 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:42,986 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:42,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 02:41:42,995 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:42,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:42,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1530509083, now seen corresponding path program 1 times [2020-10-24 02:41:42,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:42,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1022740099] [2020-10-24 02:41:42,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:41:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:41:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:41:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:41:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:41:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 02:41:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:41:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-10-24 02:41:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-10-24 02:41:43,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1022740099] [2020-10-24 02:41:43,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:41:43,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-24 02:41:43,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730136296] [2020-10-24 02:41:43,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:41:43,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:43,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:41:43,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:41:43,515 INFO L87 Difference]: Start difference. First operand 780 states and 983 transitions. Second operand 11 states. [2020-10-24 02:41:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:51,306 INFO L93 Difference]: Finished difference Result 4529 states and 6151 transitions. [2020-10-24 02:41:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-10-24 02:41:51,306 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 190 [2020-10-24 02:41:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:51,334 INFO L225 Difference]: With dead ends: 4529 [2020-10-24 02:41:51,334 INFO L226 Difference]: Without dead ends: 3794 [2020-10-24 02:41:51,345 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2020-10-24 02:41:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2020-10-24 02:41:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3005. [2020-10-24 02:41:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2020-10-24 02:41:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 3804 transitions. [2020-10-24 02:41:52,015 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 3804 transitions. Word has length 190 [2020-10-24 02:41:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:52,016 INFO L481 AbstractCegarLoop]: Abstraction has 3005 states and 3804 transitions. [2020-10-24 02:41:52,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:41:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 3804 transitions. [2020-10-24 02:41:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-10-24 02:41:52,025 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:52,025 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:52,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 02:41:52,026 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:52,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:52,027 INFO L82 PathProgramCache]: Analyzing trace with hash -642684017, now seen corresponding path program 1 times [2020-10-24 02:41:52,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:52,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [875338360] [2020-10-24 02:41:52,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:41:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:41:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:41:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:41:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:41:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 02:41:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:41:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:41:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2020-10-24 02:41:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:41:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 02:41:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2020-10-24 02:41:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-10-24 02:41:52,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [875338360] [2020-10-24 02:41:52,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:41:52,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:41:52,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295228235] [2020-10-24 02:41:52,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:41:52,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:52,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:41:52,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:41:52,460 INFO L87 Difference]: Start difference. First operand 3005 states and 3804 transitions. Second operand 12 states. [2020-10-24 02:41:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:41:56,425 INFO L93 Difference]: Finished difference Result 6539 states and 8545 transitions. [2020-10-24 02:41:56,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 02:41:56,426 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 234 [2020-10-24 02:41:56,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:41:56,448 INFO L225 Difference]: With dead ends: 6539 [2020-10-24 02:41:56,448 INFO L226 Difference]: Without dead ends: 3269 [2020-10-24 02:41:56,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=224, Invalid=532, Unknown=0, NotChecked=0, Total=756 [2020-10-24 02:41:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2020-10-24 02:41:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 2459. [2020-10-24 02:41:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2020-10-24 02:41:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3049 transitions. [2020-10-24 02:41:57,024 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3049 transitions. Word has length 234 [2020-10-24 02:41:57,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:41:57,024 INFO L481 AbstractCegarLoop]: Abstraction has 2459 states and 3049 transitions. [2020-10-24 02:41:57,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:41:57,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3049 transitions. [2020-10-24 02:41:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-10-24 02:41:57,030 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:41:57,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:41:57,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 02:41:57,031 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:41:57,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:41:57,032 INFO L82 PathProgramCache]: Analyzing trace with hash 552809403, now seen corresponding path program 1 times [2020-10-24 02:41:57,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:41:57,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [843336783] [2020-10-24 02:41:57,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:41:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:41:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:41:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:41:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:41:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:41:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:41:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:41:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 02:41:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:41:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:41:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-10-24 02:41:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:41:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:41:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:41:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:41:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2020-10-24 02:41:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:41:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-10-24 02:41:57,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [843336783] [2020-10-24 02:41:57,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:41:57,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-24 02:41:57,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007154426] [2020-10-24 02:41:57,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:41:57,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:41:57,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:41:57,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:41:57,448 INFO L87 Difference]: Start difference. First operand 2459 states and 3049 transitions. Second operand 11 states. [2020-10-24 02:42:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:02,066 INFO L93 Difference]: Finished difference Result 7020 states and 9125 transitions. [2020-10-24 02:42:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 02:42:02,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2020-10-24 02:42:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:02,098 INFO L225 Difference]: With dead ends: 7020 [2020-10-24 02:42:02,098 INFO L226 Difference]: Without dead ends: 4606 [2020-10-24 02:42:02,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2020-10-24 02:42:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4606 states. [2020-10-24 02:42:02,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4606 to 3691. [2020-10-24 02:42:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3691 states. [2020-10-24 02:42:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 4491 transitions. [2020-10-24 02:42:02,900 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 4491 transitions. Word has length 234 [2020-10-24 02:42:02,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:02,901 INFO L481 AbstractCegarLoop]: Abstraction has 3691 states and 4491 transitions. [2020-10-24 02:42:02,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:42:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 4491 transitions. [2020-10-24 02:42:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-10-24 02:42:02,911 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:02,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:42:02,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 02:42:02,911 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:02,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:02,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1198606357, now seen corresponding path program 1 times [2020-10-24 02:42:02,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:02,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [847424225] [2020-10-24 02:42:02,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:42:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:42:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:42:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:42:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:42:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-10-24 02:42:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:42:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-10-24 02:42:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2020-10-24 02:42:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2020-10-24 02:42:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:42:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:42:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2020-10-24 02:42:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 38 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-10-24 02:42:03,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [847424225] [2020-10-24 02:42:03,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:03,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:42:03,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662525069] [2020-10-24 02:42:03,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:42:03,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:03,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:42:03,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:42:03,264 INFO L87 Difference]: Start difference. First operand 3691 states and 4491 transitions. Second operand 12 states. [2020-10-24 02:42:11,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:11,683 INFO L93 Difference]: Finished difference Result 7128 states and 8796 transitions. [2020-10-24 02:42:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-10-24 02:42:11,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 263 [2020-10-24 02:42:11,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:11,710 INFO L225 Difference]: With dead ends: 7128 [2020-10-24 02:42:11,710 INFO L226 Difference]: Without dead ends: 4643 [2020-10-24 02:42:11,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=689, Invalid=3217, Unknown=0, NotChecked=0, Total=3906 [2020-10-24 02:42:11,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4643 states. [2020-10-24 02:42:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4643 to 3733. [2020-10-24 02:42:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3733 states. [2020-10-24 02:42:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 4439 transitions. [2020-10-24 02:42:12,572 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 4439 transitions. Word has length 263 [2020-10-24 02:42:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:12,573 INFO L481 AbstractCegarLoop]: Abstraction has 3733 states and 4439 transitions. [2020-10-24 02:42:12,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:42:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 4439 transitions. [2020-10-24 02:42:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2020-10-24 02:42:12,582 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:12,582 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:42:12,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 02:42:12,583 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:12,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:12,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2145955759, now seen corresponding path program 1 times [2020-10-24 02:42:12,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:12,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2099718241] [2020-10-24 02:42:12,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:42:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:42:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:42:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:42:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:42:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:42:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-24 02:42:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-10-24 02:42:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:42:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-10-24 02:42:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:42:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:12,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:13,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:13,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:42:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:13,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-10-24 02:42:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-10-24 02:42:13,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2099718241] [2020-10-24 02:42:13,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:42:13,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-24 02:42:13,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821836328] [2020-10-24 02:42:13,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 02:42:13,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:13,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 02:42:13,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:42:13,118 INFO L87 Difference]: Start difference. First operand 3733 states and 4439 transitions. Second operand 17 states. [2020-10-24 02:42:16,417 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-24 02:42:25,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:25,240 INFO L93 Difference]: Finished difference Result 8552 states and 10746 transitions. [2020-10-24 02:42:25,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2020-10-24 02:42:25,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 269 [2020-10-24 02:42:25,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:25,272 INFO L225 Difference]: With dead ends: 8552 [2020-10-24 02:42:25,272 INFO L226 Difference]: Without dead ends: 4863 [2020-10-24 02:42:25,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3889 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1782, Invalid=8724, Unknown=0, NotChecked=0, Total=10506 [2020-10-24 02:42:25,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4863 states. [2020-10-24 02:42:26,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4863 to 3741. [2020-10-24 02:42:26,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3741 states. [2020-10-24 02:42:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 4346 transitions. [2020-10-24 02:42:26,151 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 4346 transitions. Word has length 269 [2020-10-24 02:42:26,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:26,152 INFO L481 AbstractCegarLoop]: Abstraction has 3741 states and 4346 transitions. [2020-10-24 02:42:26,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 02:42:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 4346 transitions. [2020-10-24 02:42:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2020-10-24 02:42:26,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:26,160 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:42:26,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 02:42:26,161 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:26,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:26,162 INFO L82 PathProgramCache]: Analyzing trace with hash -299533614, now seen corresponding path program 1 times [2020-10-24 02:42:26,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:26,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1738580693] [2020-10-24 02:42:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:42:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:42:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:42:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:42:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:42:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:42:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-24 02:42:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-10-24 02:42:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:42:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-10-24 02:42:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:42:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:42:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-10-24 02:42:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-10-24 02:42:26,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1738580693] [2020-10-24 02:42:26,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:26,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:42:26,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556584842] [2020-10-24 02:42:26,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:42:26,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:26,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:42:26,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:42:26,711 INFO L87 Difference]: Start difference. First operand 3741 states and 4346 transitions. Second operand 12 states. [2020-10-24 02:42:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:34,056 INFO L93 Difference]: Finished difference Result 10456 states and 12470 transitions. [2020-10-24 02:42:34,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-10-24 02:42:34,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 269 [2020-10-24 02:42:34,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:34,099 INFO L225 Difference]: With dead ends: 10456 [2020-10-24 02:42:34,099 INFO L226 Difference]: Without dead ends: 7675 [2020-10-24 02:42:34,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2020-10-24 02:42:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7675 states. [2020-10-24 02:42:35,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7675 to 6302. [2020-10-24 02:42:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6302 states. [2020-10-24 02:42:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6302 states to 6302 states and 7427 transitions. [2020-10-24 02:42:35,473 INFO L78 Accepts]: Start accepts. Automaton has 6302 states and 7427 transitions. Word has length 269 [2020-10-24 02:42:35,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:35,474 INFO L481 AbstractCegarLoop]: Abstraction has 6302 states and 7427 transitions. [2020-10-24 02:42:35,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:42:35,475 INFO L276 IsEmpty]: Start isEmpty. Operand 6302 states and 7427 transitions. [2020-10-24 02:42:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2020-10-24 02:42:35,482 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:35,482 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:42:35,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 02:42:35,483 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:35,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:35,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1616846890, now seen corresponding path program 1 times [2020-10-24 02:42:35,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:35,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1936735604] [2020-10-24 02:42:35,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-10-24 02:42:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 02:42:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-10-24 02:42:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-10-24 02:42:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:42:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-10-24 02:42:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-10-24 02:42:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-10-24 02:42:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-24 02:42:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-10-24 02:42:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 02:42:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 02:42:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-10-24 02:42:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-24 02:42:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:42:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 02:42:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 02:42:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-10-24 02:42:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:42:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-10-24 02:42:35,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1936735604] [2020-10-24 02:42:35,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:42:35,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:42:35,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504666119] [2020-10-24 02:42:35,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:42:35,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:42:35,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:42:35,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:42:35,820 INFO L87 Difference]: Start difference. First operand 6302 states and 7427 transitions. Second operand 9 states. [2020-10-24 02:42:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:42:39,700 INFO L93 Difference]: Finished difference Result 11987 states and 14313 transitions. [2020-10-24 02:42:39,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 02:42:39,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 273 [2020-10-24 02:42:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:42:39,737 INFO L225 Difference]: With dead ends: 11987 [2020-10-24 02:42:39,737 INFO L226 Difference]: Without dead ends: 7491 [2020-10-24 02:42:39,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2020-10-24 02:42:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7491 states. [2020-10-24 02:42:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7491 to 6364. [2020-10-24 02:42:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6364 states. [2020-10-24 02:42:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6364 states to 6364 states and 7509 transitions. [2020-10-24 02:42:41,066 INFO L78 Accepts]: Start accepts. Automaton has 6364 states and 7509 transitions. Word has length 273 [2020-10-24 02:42:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:42:41,067 INFO L481 AbstractCegarLoop]: Abstraction has 6364 states and 7509 transitions. [2020-10-24 02:42:41,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:42:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 6364 states and 7509 transitions. [2020-10-24 02:42:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2020-10-24 02:42:41,075 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:42:41,075 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:42:41,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 02:42:41,076 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:42:41,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:42:41,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1966525787, now seen corresponding path program 1 times [2020-10-24 02:42:41,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:42:41,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [779990864] [2020-10-24 02:42:41,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:42:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 02:42:41,102 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 02:42:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 02:42:41,130 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 02:42:41,325 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 02:42:41,326 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 02:42:41,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 02:42:41,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:42:41 BoogieIcfgContainer [2020-10-24 02:42:41,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 02:42:41,576 INFO L168 Benchmark]: Toolchain (without parser) took 72743.44 ms. Allocated memory was 154.1 MB in the beginning and 1.1 GB in the end (delta: 982.5 MB). Free memory was 130.0 MB in the beginning and 702.9 MB in the end (delta: -572.8 MB). Peak memory consumption was 410.6 MB. Max. memory is 8.0 GB. [2020-10-24 02:42:41,577 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 154.1 MB. Free memory is still 127.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 02:42:41,578 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.40 ms. Allocated memory is still 154.1 MB. Free memory was 129.4 MB in the beginning and 116.1 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-10-24 02:42:41,584 INFO L168 Benchmark]: Boogie Preprocessor took 53.63 ms. Allocated memory is still 154.1 MB. Free memory was 116.1 MB in the beginning and 114.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 02:42:41,585 INFO L168 Benchmark]: RCFGBuilder took 1019.71 ms. Allocated memory is still 154.1 MB. Free memory was 114.0 MB in the beginning and 110.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 16.7 MB. Max. memory is 8.0 GB. [2020-10-24 02:42:41,588 INFO L168 Benchmark]: TraceAbstraction took 71237.72 ms. Allocated memory was 154.1 MB in the beginning and 1.1 GB in the end (delta: 982.5 MB). Free memory was 110.1 MB in the beginning and 702.9 MB in the end (delta: -592.8 MB). Peak memory consumption was 389.7 MB. Max. memory is 8.0 GB. [2020-10-24 02:42:41,597 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 154.1 MB. Free memory is still 127.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 413.40 ms. Allocated memory is still 154.1 MB. Free memory was 129.4 MB in the beginning and 116.1 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 53.63 ms. Allocated memory is still 154.1 MB. Free memory was 116.1 MB in the beginning and 114.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1019.71 ms. Allocated memory is still 154.1 MB. Free memory was 114.0 MB in the beginning and 110.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 16.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 71237.72 ms. Allocated memory was 154.1 MB in the beginning and 1.1 GB in the end (delta: 982.5 MB). Free memory was 110.1 MB in the beginning and 702.9 MB in the end (delta: -592.8 MB). Peak memory consumption was 389.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L16] int m_pc = 0; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=53, m_pc=0, m_st=56, T1_E=50, t1_i=64, t1_pc=54, t1_st=51, token=68] [L17] int t1_pc = 0; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=53, m_pc=0, m_st=56, T1_E=50, t1_i=64, t1_pc=0, t1_st=51, token=68] [L18] int m_st ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=53, m_pc=0, m_st=0, T1_E=50, t1_i=64, t1_pc=0, t1_st=51, token=68] [L19] int t1_st ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=53, m_pc=0, m_st=0, T1_E=50, t1_i=64, t1_pc=0, t1_st=0, token=68] [L20] int m_i ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=64, t1_pc=0, t1_st=0, token=68] [L21] int t1_i ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=0, t1_pc=0, t1_st=0, token=68] [L22] int M_E = 2; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=0, t1_pc=0, t1_st=0, token=68] [L23] int T1_E = 2; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=68] [L24] int E_M = 2; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=2, local=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=68] [L25] int E_1 = 2; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=2, E_M=2, local=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=68] [L29] int token ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=2, E_M=2, local=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L31] int local ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L477] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L481] CALL init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L392] m_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L393] t1_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L481] RET init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L482] CALL start_simulation() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L418] int kernel_st ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L419] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L420] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] kernel_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] FCALL update_channels() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] CALL init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L174] COND TRUE m_i == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L175] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L179] COND TRUE t1_i == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L180] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] RET init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L263] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L268] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L273] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L278] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L428] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L316] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L317] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L125] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L128] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L140] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L323] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L329] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L144] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L147] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L159] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L329] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L331] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L428] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L429] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L291] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L296] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L301] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L306] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L429] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L432] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] kernel_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL eval() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L210] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L214] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L189] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L192] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L193] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L205] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L219] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L224] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L225] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L226] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L227] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L238] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L239] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L240] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L241] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L243] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L244] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L92] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L105] t1_pc = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L106] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L244] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L214] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L217] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L189] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L192] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L193] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L205] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L217] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L217] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L219] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L224] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L225] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_2=1, token=0] [L226] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L227] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L229] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L230] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L34] int tmp_var = __VERIFIER_nondet_int(); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L36] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L47] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L50] token = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L51] local = token VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L52] E_1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L53] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L345] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L316] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L317] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L125] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L128] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L140] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L323] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L329] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L144] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L147] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L148] COND TRUE E_1 == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L149] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L159] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L329] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L329] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, tmp___0=1, token=0] [L331] COND TRUE \read(tmp___0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, tmp___0=1, token=0] [L332] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L345] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L53] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L54] E_1 = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L55] m_pc = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L56] m_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L230] RET master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L238] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L239] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, token=0] [L240] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L241] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L243] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L244] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L92] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L95] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L111] token += 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L113] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L345] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L316] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L317] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L125] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L128] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L129] COND TRUE E_M == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L130] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L140] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L323] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L324] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L329] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L144] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L147] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L148] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L159] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L329] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L329] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L331] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L345] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L113] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L114] E_M = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L105] t1_pc = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L106] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L244] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L214] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L217] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L189] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L192] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L193] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L205] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L217] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L217] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L219] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L224] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L225] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_2=1, token=1] [L226] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L227] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L229] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L230] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L34] int tmp_var = __VERIFIER_nondet_int(); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, __VERIFIER_nondet_int()=5, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L36] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L39] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L61] COND FALSE !(token != local + 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L66] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L67] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L72] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L73] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L74] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L75] CALL error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L12] CALL reach_error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L3] __assert_fail("0", "token_ring.01.cil-2.c", 3, "reach_error") VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 239 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 70.9s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 58.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3294 SDtfs, 18018 SDslu, 1390 SDs, 0 SdLazy, 20238 SolverSat, 6460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 929 GetRequests, 536 SyntacticMatches, 2 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7214 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6364occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 7964 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 2495 NumberOfCodeBlocks, 2495 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2211 ConstructedInterpolants, 0 QuantifiedInterpolants, 1121717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 930/954 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...