/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 23:15:46,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 23:15:46,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 23:15:46,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 23:15:46,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 23:15:46,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 23:15:46,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 23:15:46,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 23:15:46,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 23:15:46,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 23:15:46,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 23:15:46,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 23:15:46,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 23:15:46,606 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 23:15:46,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 23:15:46,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 23:15:46,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 23:15:46,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 23:15:46,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 23:15:46,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 23:15:46,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 23:15:46,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 23:15:46,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 23:15:46,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 23:15:46,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 23:15:46,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 23:15:46,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 23:15:46,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 23:15:46,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 23:15:46,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 23:15:46,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 23:15:46,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 23:15:46,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 23:15:46,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 23:15:46,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 23:15:46,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 23:15:46,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 23:15:46,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 23:15:46,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 23:15:46,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 23:15:46,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 23:15:46,650 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 23:15:46,661 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 23:15:46,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 23:15:46,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 23:15:46,663 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 23:15:46,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 23:15:46,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 23:15:46,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 23:15:46,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 23:15:46,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 23:15:46,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 23:15:46,665 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 23:15:46,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 23:15:46,666 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 23:15:46,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 23:15:46,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 23:15:46,667 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 23:15:46,667 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 23:15:46,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 23:15:46,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 23:15:46,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 23:15:46,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 23:15:46,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 23:15:46,668 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-08-22 23:15:46,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 23:15:46,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 23:15:46,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 23:15:46,955 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 23:15:46,956 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 23:15:46,957 INFO L429 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-08-22 23:15:47,019 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7bb53b4a/d68b4a6182c84913b601da2d093c4817/FLAG21ed13723 [2020-08-22 23:15:47,468 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 23:15:47,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2020-08-22 23:15:47,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7bb53b4a/d68b4a6182c84913b601da2d093c4817/FLAG21ed13723 [2020-08-22 23:15:47,846 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7bb53b4a/d68b4a6182c84913b601da2d093c4817 [2020-08-22 23:15:47,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 23:15:47,858 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 23:15:47,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 23:15:47,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 23:15:47,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 23:15:47,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 11:15:47" (1/1) ... [2020-08-22 23:15:47,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e0f281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:47, skipping insertion in model container [2020-08-22 23:15:47,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 11:15:47" (1/1) ... [2020-08-22 23:15:47,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 23:15:47,912 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 23:15:48,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 23:15:48,117 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 23:15:48,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 23:15:48,262 INFO L208 MainTranslator]: Completed translation [2020-08-22 23:15:48,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:48 WrapperNode [2020-08-22 23:15:48,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 23:15:48,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 23:15:48,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 23:15:48,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 23:15:48,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:48" (1/1) ... [2020-08-22 23:15:48,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:48" (1/1) ... [2020-08-22 23:15:48,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:48" (1/1) ... [2020-08-22 23:15:48,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:48" (1/1) ... [2020-08-22 23:15:48,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:48" (1/1) ... [2020-08-22 23:15:48,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:48" (1/1) ... [2020-08-22 23:15:48,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:48" (1/1) ... [2020-08-22 23:15:48,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 23:15:48,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 23:15:48,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 23:15:48,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 23:15:48,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:48" (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-08-22 23:15:48,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 23:15:48,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 23:15:48,385 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-08-22 23:15:48,385 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-08-22 23:15:48,385 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-08-22 23:15:48,385 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-08-22 23:15:48,385 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-08-22 23:15:48,386 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-08-22 23:15:48,386 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-08-22 23:15:48,386 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-08-22 23:15:48,386 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-08-22 23:15:48,386 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-08-22 23:15:48,386 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-08-22 23:15:48,387 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-08-22 23:15:48,387 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-08-22 23:15:48,387 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-08-22 23:15:48,387 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-08-22 23:15:48,388 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-08-22 23:15:48,388 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-08-22 23:15:48,388 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-08-22 23:15:48,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 23:15:48,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 23:15:48,390 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-08-22 23:15:48,390 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-08-22 23:15:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-08-22 23:15:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-08-22 23:15:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 23:15:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-08-22 23:15:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-08-22 23:15:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-08-22 23:15:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-08-22 23:15:48,392 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-08-22 23:15:48,392 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-08-22 23:15:48,392 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-08-22 23:15:48,392 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-08-22 23:15:48,392 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-08-22 23:15:48,392 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-08-22 23:15:48,393 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-08-22 23:15:48,393 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-08-22 23:15:48,393 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-08-22 23:15:48,393 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-08-22 23:15:48,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 23:15:48,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 23:15:48,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 23:15:48,929 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 23:15:48,930 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-08-22 23:15:48,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 11:15:48 BoogieIcfgContainer [2020-08-22 23:15:48,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 23:15:48,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 23:15:48,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 23:15:48,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 23:15:48,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 11:15:47" (1/3) ... [2020-08-22 23:15:48,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d6667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 11:15:48, skipping insertion in model container [2020-08-22 23:15:48,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 11:15:48" (2/3) ... [2020-08-22 23:15:48,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d6667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 11:15:48, skipping insertion in model container [2020-08-22 23:15:48,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 11:15:48" (3/3) ... [2020-08-22 23:15:48,946 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-08-22 23:15:48,956 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 23:15:48,964 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 23:15:48,979 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 23:15:49,002 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 23:15:49,002 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 23:15:49,002 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 23:15:49,003 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 23:15:49,003 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 23:15:49,003 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 23:15:49,003 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 23:15:49,003 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 23:15:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2020-08-22 23:15:49,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-08-22 23:15:49,043 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:15:49,044 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:15:49,045 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:15:49,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:15:49,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1293744950, now seen corresponding path program 1 times [2020-08-22 23:15:49,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:15:49,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [629606705] [2020-08-22 23:15:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:15:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:49,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:49,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:15:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:49,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:15:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:49,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:15:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:49,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:15:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:49,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:15:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:49,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:49,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:15:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:49,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:15:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:49,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:15:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 23:15:49,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [629606705] [2020-08-22 23:15:49,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:15:49,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 23:15:49,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573300943] [2020-08-22 23:15:49,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 23:15:49,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:15:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 23:15:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 23:15:49,618 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 7 states. [2020-08-22 23:15:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:15:51,449 INFO L93 Difference]: Finished difference Result 795 states and 1083 transitions. [2020-08-22 23:15:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-22 23:15:51,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2020-08-22 23:15:51,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:15:51,473 INFO L225 Difference]: With dead ends: 795 [2020-08-22 23:15:51,474 INFO L226 Difference]: Without dead ends: 585 [2020-08-22 23:15:51,481 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2020-08-22 23:15:51,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-08-22 23:15:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 431. [2020-08-22 23:15:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-08-22 23:15:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 538 transitions. [2020-08-22 23:15:51,633 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 538 transitions. Word has length 110 [2020-08-22 23:15:51,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:15:51,634 INFO L479 AbstractCegarLoop]: Abstraction has 431 states and 538 transitions. [2020-08-22 23:15:51,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 23:15:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 538 transitions. [2020-08-22 23:15:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-08-22 23:15:51,641 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:15:51,641 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:15:51,642 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 23:15:51,642 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:15:51,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:15:51,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1206698500, now seen corresponding path program 1 times [2020-08-22 23:15:51,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:15:51,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [504868450] [2020-08-22 23:15:51,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:15:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:15:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:15:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:15:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:15:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:15:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:15:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:15:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:15:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:15:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 23:15:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:15:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-08-22 23:15:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:51,958 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-08-22 23:15:51,958 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [504868450] [2020-08-22 23:15:51,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:15:51,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 23:15:51,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931830285] [2020-08-22 23:15:51,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 23:15:51,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:15:51,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 23:15:51,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-08-22 23:15:51,962 INFO L87 Difference]: Start difference. First operand 431 states and 538 transitions. Second operand 9 states. [2020-08-22 23:15:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:15:54,938 INFO L93 Difference]: Finished difference Result 1528 states and 2039 transitions. [2020-08-22 23:15:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 23:15:54,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 176 [2020-08-22 23:15:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:15:54,960 INFO L225 Difference]: With dead ends: 1528 [2020-08-22 23:15:54,961 INFO L226 Difference]: Without dead ends: 1137 [2020-08-22 23:15:54,969 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2020-08-22 23:15:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2020-08-22 23:15:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 847. [2020-08-22 23:15:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2020-08-22 23:15:55,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1093 transitions. [2020-08-22 23:15:55,126 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1093 transitions. Word has length 176 [2020-08-22 23:15:55,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:15:55,127 INFO L479 AbstractCegarLoop]: Abstraction has 847 states and 1093 transitions. [2020-08-22 23:15:55,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 23:15:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1093 transitions. [2020-08-22 23:15:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2020-08-22 23:15:55,135 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:15:55,135 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:15:55,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 23:15:55,136 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:15:55,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:15:55,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1912018981, now seen corresponding path program 1 times [2020-08-22 23:15:55,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:15:55,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1794723122] [2020-08-22 23:15:55,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:15:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:15:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:15:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:15:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:15:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:15:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:15:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:15:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:15:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:15:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 23:15:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-08-22 23:15:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2020-08-22 23:15:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:15:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:15:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2020-08-22 23:15:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-08-22 23:15:55,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1794723122] [2020-08-22 23:15:55,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:15:55,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 23:15:55,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469558311] [2020-08-22 23:15:55,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 23:15:55,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:15:55,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 23:15:55,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-08-22 23:15:55,569 INFO L87 Difference]: Start difference. First operand 847 states and 1093 transitions. Second operand 12 states. [2020-08-22 23:15:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:15:57,665 INFO L93 Difference]: Finished difference Result 2018 states and 2712 transitions. [2020-08-22 23:15:57,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-22 23:15:57,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 226 [2020-08-22 23:15:57,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:15:57,677 INFO L225 Difference]: With dead ends: 2018 [2020-08-22 23:15:57,677 INFO L226 Difference]: Without dead ends: 953 [2020-08-22 23:15:57,684 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2020-08-22 23:15:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2020-08-22 23:15:57,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 691. [2020-08-22 23:15:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-08-22 23:15:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 858 transitions. [2020-08-22 23:15:57,777 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 858 transitions. Word has length 226 [2020-08-22 23:15:57,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:15:57,777 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 858 transitions. [2020-08-22 23:15:57,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 23:15:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 858 transitions. [2020-08-22 23:15:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-08-22 23:15:57,782 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:15:57,783 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:15:57,783 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 23:15:57,783 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:15:57,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:15:57,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1527598382, now seen corresponding path program 2 times [2020-08-22 23:15:57,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:15:57,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [101621987] [2020-08-22 23:15:57,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:15:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:15:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:15:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:15:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:15:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:15:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:15:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:15:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:15:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:15:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 23:15:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:15:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-08-22 23:15:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:15:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:15:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:57,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:15:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:58,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:15:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:58,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2020-08-22 23:15:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:15:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-08-22 23:15:58,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [101621987] [2020-08-22 23:15:58,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:15:58,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 23:15:58,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560565963] [2020-08-22 23:15:58,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 23:15:58,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:15:58,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 23:15:58,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:15:58,068 INFO L87 Difference]: Start difference. First operand 691 states and 858 transitions. Second operand 10 states. [2020-08-22 23:16:00,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:00,924 INFO L93 Difference]: Finished difference Result 2333 states and 3090 transitions. [2020-08-22 23:16:00,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 23:16:00,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 225 [2020-08-22 23:16:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:00,937 INFO L225 Difference]: With dead ends: 2333 [2020-08-22 23:16:00,938 INFO L226 Difference]: Without dead ends: 1680 [2020-08-22 23:16:00,943 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2020-08-22 23:16:00,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2020-08-22 23:16:01,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1279. [2020-08-22 23:16:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2020-08-22 23:16:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1565 transitions. [2020-08-22 23:16:01,180 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1565 transitions. Word has length 225 [2020-08-22 23:16:01,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:01,181 INFO L479 AbstractCegarLoop]: Abstraction has 1279 states and 1565 transitions. [2020-08-22 23:16:01,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 23:16:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1565 transitions. [2020-08-22 23:16:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-08-22 23:16:01,193 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:01,193 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:01,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 23:16:01,194 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:01,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:01,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1201348035, now seen corresponding path program 1 times [2020-08-22 23:16:01,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:01,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1308676609] [2020-08-22 23:16:01,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:16:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-08-22 23:16:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-08-22 23:16:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2020-08-22 23:16:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 23:16:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-08-22 23:16:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:16:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2020-08-22 23:16:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2020-08-22 23:16:01,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1308676609] [2020-08-22 23:16:01,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:16:01,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-22 23:16:01,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396613221] [2020-08-22 23:16:01,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 23:16:01,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:01,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 23:16:01,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-08-22 23:16:01,450 INFO L87 Difference]: Start difference. First operand 1279 states and 1565 transitions. Second operand 9 states. [2020-08-22 23:16:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:04,089 INFO L93 Difference]: Finished difference Result 2930 states and 3716 transitions. [2020-08-22 23:16:04,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-22 23:16:04,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 254 [2020-08-22 23:16:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:04,101 INFO L225 Difference]: With dead ends: 2930 [2020-08-22 23:16:04,101 INFO L226 Difference]: Without dead ends: 1690 [2020-08-22 23:16:04,107 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2020-08-22 23:16:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2020-08-22 23:16:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1279. [2020-08-22 23:16:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2020-08-22 23:16:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1553 transitions. [2020-08-22 23:16:04,267 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1553 transitions. Word has length 254 [2020-08-22 23:16:04,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:04,267 INFO L479 AbstractCegarLoop]: Abstraction has 1279 states and 1553 transitions. [2020-08-22 23:16:04,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 23:16:04,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1553 transitions. [2020-08-22 23:16:04,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-08-22 23:16:04,273 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:04,273 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:04,274 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 23:16:04,274 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:04,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:04,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1453934466, now seen corresponding path program 1 times [2020-08-22 23:16:04,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:04,275 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [354961706] [2020-08-22 23:16:04,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:16:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-08-22 23:16:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 23:16:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2020-08-22 23:16:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-08-22 23:16:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2020-08-22 23:16:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:16:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2020-08-22 23:16:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 38 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-08-22 23:16:04,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [354961706] [2020-08-22 23:16:04,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:16:04,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 23:16:04,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338661628] [2020-08-22 23:16:04,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 23:16:04,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:04,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 23:16:04,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-08-22 23:16:04,579 INFO L87 Difference]: Start difference. First operand 1279 states and 1553 transitions. Second operand 10 states. [2020-08-22 23:16:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:07,909 INFO L93 Difference]: Finished difference Result 4387 states and 5560 transitions. [2020-08-22 23:16:07,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-08-22 23:16:07,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 254 [2020-08-22 23:16:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:07,929 INFO L225 Difference]: With dead ends: 4387 [2020-08-22 23:16:07,929 INFO L226 Difference]: Without dead ends: 3147 [2020-08-22 23:16:07,937 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=240, Invalid=816, Unknown=0, NotChecked=0, Total=1056 [2020-08-22 23:16:07,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2020-08-22 23:16:08,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 2409. [2020-08-22 23:16:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2409 states. [2020-08-22 23:16:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2409 states and 2950 transitions. [2020-08-22 23:16:08,302 INFO L78 Accepts]: Start accepts. Automaton has 2409 states and 2950 transitions. Word has length 254 [2020-08-22 23:16:08,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:08,302 INFO L479 AbstractCegarLoop]: Abstraction has 2409 states and 2950 transitions. [2020-08-22 23:16:08,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 23:16:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 2950 transitions. [2020-08-22 23:16:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2020-08-22 23:16:08,311 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:08,312 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:08,312 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 23:16:08,312 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:08,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:08,313 INFO L82 PathProgramCache]: Analyzing trace with hash 564718689, now seen corresponding path program 1 times [2020-08-22 23:16:08,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:08,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [686952373] [2020-08-22 23:16:08,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:16:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 23:16:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-08-22 23:16:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-08-22 23:16:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 23:16:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-08-22 23:16:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:16:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2020-08-22 23:16:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:08,713 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-08-22 23:16:08,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [686952373] [2020-08-22 23:16:08,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 23:16:08,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-22 23:16:08,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118114793] [2020-08-22 23:16:08,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 23:16:08,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:08,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 23:16:08,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-08-22 23:16:08,718 INFO L87 Difference]: Start difference. First operand 2409 states and 2950 transitions. Second operand 14 states. [2020-08-22 23:16:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:12,685 INFO L93 Difference]: Finished difference Result 5356 states and 6878 transitions. [2020-08-22 23:16:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-22 23:16:12,685 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 260 [2020-08-22 23:16:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:12,702 INFO L225 Difference]: With dead ends: 5356 [2020-08-22 23:16:12,703 INFO L226 Difference]: Without dead ends: 2987 [2020-08-22 23:16:12,713 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=442, Invalid=1628, Unknown=0, NotChecked=0, Total=2070 [2020-08-22 23:16:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2020-08-22 23:16:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2415. [2020-08-22 23:16:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2415 states. [2020-08-22 23:16:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 2906 transitions. [2020-08-22 23:16:13,171 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 2906 transitions. Word has length 260 [2020-08-22 23:16:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:13,172 INFO L479 AbstractCegarLoop]: Abstraction has 2415 states and 2906 transitions. [2020-08-22 23:16:13,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 23:16:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 2906 transitions. [2020-08-22 23:16:13,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2020-08-22 23:16:13,180 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:13,180 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:13,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 23:16:13,181 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash -622546722, now seen corresponding path program 1 times [2020-08-22 23:16:13,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:13,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [532218490] [2020-08-22 23:16:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:16:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 23:16:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-08-22 23:16:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-08-22 23:16:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 23:16:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-08-22 23:16:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:16:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2020-08-22 23:16:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-08-22 23:16:13,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [532218490] [2020-08-22 23:16:13,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:16:13,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 23:16:13,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816105667] [2020-08-22 23:16:13,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 23:16:13,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:13,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 23:16:13,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-08-22 23:16:13,633 INFO L87 Difference]: Start difference. First operand 2415 states and 2906 transitions. Second operand 12 states. [2020-08-22 23:16:18,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:18,760 INFO L93 Difference]: Finished difference Result 7890 states and 9700 transitions. [2020-08-22 23:16:18,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-08-22 23:16:18,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 260 [2020-08-22 23:16:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:18,793 INFO L225 Difference]: With dead ends: 7890 [2020-08-22 23:16:18,793 INFO L226 Difference]: Without dead ends: 5519 [2020-08-22 23:16:18,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=332, Invalid=1308, Unknown=0, NotChecked=0, Total=1640 [2020-08-22 23:16:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2020-08-22 23:16:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 4386. [2020-08-22 23:16:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4386 states. [2020-08-22 23:16:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4386 states to 4386 states and 5308 transitions. [2020-08-22 23:16:19,669 INFO L78 Accepts]: Start accepts. Automaton has 4386 states and 5308 transitions. Word has length 260 [2020-08-22 23:16:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:19,672 INFO L479 AbstractCegarLoop]: Abstraction has 4386 states and 5308 transitions. [2020-08-22 23:16:19,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 23:16:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 4386 states and 5308 transitions. [2020-08-22 23:16:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2020-08-22 23:16:19,682 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:19,683 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:19,683 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 23:16:19,683 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:19,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:19,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1607368582, now seen corresponding path program 1 times [2020-08-22 23:16:19,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:19,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1326441845] [2020-08-22 23:16:19,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:16:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 23:16:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-08-22 23:16:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-08-22 23:16:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 23:16:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-08-22 23:16:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:16:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2020-08-22 23:16:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-08-22 23:16:19,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1326441845] [2020-08-22 23:16:19,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:16:19,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-22 23:16:19,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882254659] [2020-08-22 23:16:19,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 23:16:19,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:19,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 23:16:19,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-08-22 23:16:19,956 INFO L87 Difference]: Start difference. First operand 4386 states and 5308 transitions. Second operand 9 states. [2020-08-22 23:16:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:22,183 INFO L93 Difference]: Finished difference Result 8470 states and 10434 transitions. [2020-08-22 23:16:22,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-08-22 23:16:22,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 264 [2020-08-22 23:16:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:22,207 INFO L225 Difference]: With dead ends: 8470 [2020-08-22 23:16:22,207 INFO L226 Difference]: Without dead ends: 5371 [2020-08-22 23:16:22,219 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2020-08-22 23:16:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5371 states. [2020-08-22 23:16:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5371 to 4412. [2020-08-22 23:16:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4412 states. [2020-08-22 23:16:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4412 states to 4412 states and 5346 transitions. [2020-08-22 23:16:22,889 INFO L78 Accepts]: Start accepts. Automaton has 4412 states and 5346 transitions. Word has length 264 [2020-08-22 23:16:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:22,889 INFO L479 AbstractCegarLoop]: Abstraction has 4412 states and 5346 transitions. [2020-08-22 23:16:22,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 23:16:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4412 states and 5346 transitions. [2020-08-22 23:16:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-08-22 23:16:22,898 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:22,898 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:22,898 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 23:16:22,899 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:22,899 INFO L82 PathProgramCache]: Analyzing trace with hash -424779163, now seen corresponding path program 1 times [2020-08-22 23:16:22,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:22,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [808027614] [2020-08-22 23:16:22,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-08-22 23:16:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:22,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 23:16:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 23:16:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 23:16:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-08-22 23:16:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 23:16:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-08-22 23:16:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 23:16:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-08-22 23:16:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2020-08-22 23:16:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 23:16:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-08-22 23:16:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-08-22 23:16:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 23:16:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 23:16:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 23:16:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 23:16:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2020-08-22 23:16:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 23:16:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-08-22 23:16:23,145 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [808027614] [2020-08-22 23:16:23,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 23:16:23,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-22 23:16:23,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933157706] [2020-08-22 23:16:23,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 23:16:23,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 23:16:23,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 23:16:23,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-08-22 23:16:23,147 INFO L87 Difference]: Start difference. First operand 4412 states and 5346 transitions. Second operand 9 states. [2020-08-22 23:16:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 23:16:25,201 INFO L93 Difference]: Finished difference Result 8530 states and 10535 transitions. [2020-08-22 23:16:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-08-22 23:16:25,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 265 [2020-08-22 23:16:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 23:16:25,224 INFO L225 Difference]: With dead ends: 8530 [2020-08-22 23:16:25,224 INFO L226 Difference]: Without dead ends: 5405 [2020-08-22 23:16:25,234 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2020-08-22 23:16:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2020-08-22 23:16:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 4416. [2020-08-22 23:16:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4416 states. [2020-08-22 23:16:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 4416 states and 5350 transitions. [2020-08-22 23:16:25,761 INFO L78 Accepts]: Start accepts. Automaton has 4416 states and 5350 transitions. Word has length 265 [2020-08-22 23:16:25,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 23:16:25,761 INFO L479 AbstractCegarLoop]: Abstraction has 4416 states and 5350 transitions. [2020-08-22 23:16:25,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 23:16:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 4416 states and 5350 transitions. [2020-08-22 23:16:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-08-22 23:16:25,769 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 23:16:25,770 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 23:16:25,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 23:16:25,770 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 23:16:25,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 23:16:25,771 INFO L82 PathProgramCache]: Analyzing trace with hash -482037465, now seen corresponding path program 1 times [2020-08-22 23:16:25,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 23:16:25,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1822890268] [2020-08-22 23:16:25,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 23:16:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 23:16:25,791 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 23:16:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 23:16:25,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 23:16:25,888 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-22 23:16:25,888 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 23:16:25,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 23:16:26,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 11:16:26 BoogieIcfgContainer [2020-08-22 23:16:26,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 23:16:26,029 INFO L168 Benchmark]: Toolchain (without parser) took 38170.36 ms. Allocated memory was 140.0 MB in the beginning and 972.6 MB in the end (delta: 832.6 MB). Free memory was 103.5 MB in the beginning and 307.2 MB in the end (delta: -203.7 MB). Peak memory consumption was 628.9 MB. Max. memory is 7.1 GB. [2020-08-22 23:16:26,030 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 140.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 23:16:26,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.44 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 103.3 MB in the beginning and 182.0 MB in the end (delta: -78.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2020-08-22 23:16:26,031 INFO L168 Benchmark]: Boogie Preprocessor took 51.77 ms. Allocated memory is still 203.4 MB. Free memory was 182.0 MB in the beginning and 179.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-08-22 23:16:26,032 INFO L168 Benchmark]: RCFGBuilder took 621.23 ms. Allocated memory is still 203.4 MB. Free memory was 179.7 MB in the beginning and 141.1 MB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 7.1 GB. [2020-08-22 23:16:26,033 INFO L168 Benchmark]: TraceAbstraction took 37088.21 ms. Allocated memory was 203.4 MB in the beginning and 972.6 MB in the end (delta: 769.1 MB). Free memory was 140.5 MB in the beginning and 307.2 MB in the end (delta: -166.7 MB). Peak memory consumption was 602.4 MB. Max. memory is 7.1 GB. [2020-08-22 23:16:26,036 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 140.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 404.44 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 103.3 MB in the beginning and 182.0 MB in the end (delta: -78.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.77 ms. Allocated memory is still 203.4 MB. Free memory was 182.0 MB in the beginning and 179.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 621.23 ms. Allocated memory is still 203.4 MB. Free memory was 179.7 MB in the beginning and 141.1 MB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37088.21 ms. Allocated memory was 203.4 MB in the beginning and 972.6 MB in the end (delta: 769.1 MB). Free memory was 140.5 MB in the beginning and 307.2 MB in the end (delta: -166.7 MB). Peak memory consumption was 602.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=16, m_i=9, m_pc=0, m_st=13, T1_E=6, t1_i=17, t1_pc=11, t1_st=8, token=12] [L15] int t1_pc = 0; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=16, m_i=9, m_pc=0, m_st=13, T1_E=6, t1_i=17, t1_pc=0, t1_st=8, token=12] [L16] int m_st ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=16, m_i=9, m_pc=0, m_st=0, T1_E=6, t1_i=17, t1_pc=0, t1_st=8, token=12] [L17] int t1_st ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=16, m_i=9, m_pc=0, m_st=0, T1_E=6, t1_i=17, t1_pc=0, t1_st=0, token=12] [L18] int m_i ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=16, m_i=0, m_pc=0, m_st=0, T1_E=6, t1_i=17, t1_pc=0, t1_st=0, token=12] [L19] int t1_i ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=16, m_i=0, m_pc=0, m_st=0, T1_E=6, t1_i=0, t1_pc=0, t1_st=0, token=12] [L20] int M_E = 2; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=6, t1_i=0, t1_pc=0, t1_st=0, token=12] [L21] int T1_E = 2; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=15, local=7, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=12] [L22] int E_M = 2; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=10, E_M=2, local=7, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=12] [L23] int E_1 = 2; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=2, E_M=2, local=7, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=12] [L27] int token ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=2, E_M=2, local=7, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L29] int local ; VAL [\old(E_1)=10, \old(E_M)=15, \old(local)=7, \old(M_E)=16, \old(m_i)=9, \old(m_pc)=14, \old(m_st)=13, \old(T1_E)=6, \old(t1_i)=17, \old(t1_pc)=11, \old(t1_st)=8, \old(token)=12, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L475] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L479] CALL init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L390] m_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L391] t1_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L479] RET init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L480] CALL start_simulation() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L416] int kernel_st ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L417] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L418] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] kernel_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L423] FCALL update_channels() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] CALL init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L172] COND TRUE m_i == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L173] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L177] COND TRUE t1_i == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L178] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] RET init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L261] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L266] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L329] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L426] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L289] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L294] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L430] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] kernel_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL eval() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L208] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L190] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L222] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L223] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L224] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L236] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L237] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L238] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L239] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L241] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L90] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] t1_pc = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L104] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L242] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L190] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L222] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L223] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_2=1, token=0] [L224] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L225] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L227] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L32] int tmp_var = __VERIFIER_nondet_int(); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L34] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L45] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L48] token = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L49] local = token VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L50] E_1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L51] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L314] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] COND TRUE E_1 == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L147] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, tmp___0=1, token=0] [L329] COND TRUE \read(tmp___0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, tmp___0=1, token=0] [L330] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L51] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L52] E_1 = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L53] m_pc = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L54] m_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L228] RET master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L236] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L237] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, token=0] [L238] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L239] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L241] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L93] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L109] token += 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L110] E_M = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L314] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L126] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L127] COND TRUE E_M == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L128] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L138] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L321] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L322] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L327] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L327] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L329] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] t1_pc = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L104] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L242] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L190] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L203] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L222] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L223] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_2=1, token=1] [L224] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L225] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L227] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L32] int tmp_var = __VERIFIER_nondet_int(); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, __VERIFIER_nondet_int()=5, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L34] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L37] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L59] COND FALSE !(token != local + 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L64] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L65] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L72] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L73] CALL error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 36.8s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 29.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2980 SDtfs, 10950 SDslu, 1122 SDs, 0 SdLazy, 17354 SolverSat, 3659 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 772 GetRequests, 499 SyntacticMatches, 1 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1960 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4416occurred 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: 3.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 5909 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2559 NumberOfCodeBlocks, 2559 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2284 ConstructedInterpolants, 0 QuantifiedInterpolants, 1054637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 1113/1146 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...