java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:40:14,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:40:14,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:40:14,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:40:14,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:40:14,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:40:14,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:40:14,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:40:14,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:40:14,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:40:14,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:40:14,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:40:14,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:40:14,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:40:14,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:40:14,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:40:14,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:40:14,369 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:40:14,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:40:14,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:40:14,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:40:14,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:40:14,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:40:14,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:40:14,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:40:14,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:40:14,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:40:14,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:40:14,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:40:14,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:40:14,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:40:14,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:40:14,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:40:14,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:40:14,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:40:14,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:40:14,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:40:14,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:40:14,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:40:14,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:40:14,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:40:14,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-16 16:40:14,428 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:40:14,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:40:14,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:40:14,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:40:14,432 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:40:14,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:40:14,433 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:40:14,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:40:14,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:40:14,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:40:14,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:40:14,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:40:14,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:40:14,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:40:14,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:40:14,435 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:40:14,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:40:14,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:40:14,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:40:14,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:40:14,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:40:14,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:40:14,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:40:14,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:40:14,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:40:14,439 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:40:14,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:40:14,440 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:40:14,440 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:40:14,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:40:14,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:40:14,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:40:14,509 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:40:14,510 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:40:14,510 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2019-09-16 16:40:14,577 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6248deec/3b191ea5e7484bdaa4b516a243ff2a4b/FLAG9d336975c [2019-09-16 16:40:15,054 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:40:15,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2019-09-16 16:40:15,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6248deec/3b191ea5e7484bdaa4b516a243ff2a4b/FLAG9d336975c [2019-09-16 16:40:15,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6248deec/3b191ea5e7484bdaa4b516a243ff2a4b [2019-09-16 16:40:15,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:40:15,422 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:40:15,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:40:15,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:40:15,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:40:15,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@690b44a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15, skipping insertion in model container [2019-09-16 16:40:15,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,440 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:40:15,486 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:40:15,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:40:15,736 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:40:15,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:40:15,878 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:40:15,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15 WrapperNode [2019-09-16 16:40:15,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:40:15,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:40:15,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:40:15,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:40:15,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (1/1) ... [2019-09-16 16:40:15,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:40:15,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:40:15,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:40:15,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:40:15,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:40:15,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:40:15,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:40:15,982 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-16 16:40:15,983 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-16 16:40:15,983 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-16 16:40:15,983 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-16 16:40:15,983 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-16 16:40:15,983 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-16 16:40:15,983 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-16 16:40:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-16 16:40:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-16 16:40:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-16 16:40:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-16 16:40:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-16 16:40:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-16 16:40:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-16 16:40:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-16 16:40:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-16 16:40:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-16 16:40:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-16 16:40:15,986 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:40:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:40:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-16 16:40:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-16 16:40:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-16 16:40:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-16 16:40:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:40:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-16 16:40:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-16 16:40:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-16 16:40:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-16 16:40:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-16 16:40:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-16 16:40:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-16 16:40:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-16 16:40:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-16 16:40:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-16 16:40:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-16 16:40:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-16 16:40:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-16 16:40:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-16 16:40:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:40:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:40:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:40:16,525 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:40:16,525 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-16 16:40:16,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:40:16 BoogieIcfgContainer [2019-09-16 16:40:16,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:40:16,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:40:16,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:40:16,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:40:16,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:40:15" (1/3) ... [2019-09-16 16:40:16,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f6005b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:40:16, skipping insertion in model container [2019-09-16 16:40:16,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:15" (2/3) ... [2019-09-16 16:40:16,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f6005b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:40:16, skipping insertion in model container [2019-09-16 16:40:16,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:40:16" (3/3) ... [2019-09-16 16:40:16,536 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2019-09-16 16:40:16,547 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:40:16,558 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:40:16,576 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:40:16,628 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:40:16,629 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:40:16,630 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:40:16,630 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:40:16,630 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:40:16,630 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:40:16,630 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:40:16,631 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:40:16,631 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:40:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-09-16 16:40:16,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 16:40:16,685 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:16,686 INFO L407 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] [2019-09-16 16:40:16,689 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:16,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:16,696 INFO L82 PathProgramCache]: Analyzing trace with hash -540085109, now seen corresponding path program 1 times [2019-09-16 16:40:16,698 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:16,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:16,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:16,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:16,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:17,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:17,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:17,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:17,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:17,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:17,060 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2019-09-16 16:40:17,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:17,653 INFO L93 Difference]: Finished difference Result 312 states and 450 transitions. [2019-09-16 16:40:17,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:17,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-16 16:40:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:17,685 INFO L225 Difference]: With dead ends: 312 [2019-09-16 16:40:17,685 INFO L226 Difference]: Without dead ends: 168 [2019-09-16 16:40:17,694 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-16 16:40:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 142. [2019-09-16 16:40:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-16 16:40:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 188 transitions. [2019-09-16 16:40:17,824 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 188 transitions. Word has length 78 [2019-09-16 16:40:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:17,824 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 188 transitions. [2019-09-16 16:40:17,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 188 transitions. [2019-09-16 16:40:17,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 16:40:17,836 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:17,836 INFO L407 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] [2019-09-16 16:40:17,836 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:17,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:17,838 INFO L82 PathProgramCache]: Analyzing trace with hash 720832141, now seen corresponding path program 1 times [2019-09-16 16:40:17,838 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:17,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:17,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:17,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:17,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:17,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:17,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:17,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:17,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:17,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:17,959 INFO L87 Difference]: Start difference. First operand 142 states and 188 transitions. Second operand 5 states. [2019-09-16 16:40:18,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:18,348 INFO L93 Difference]: Finished difference Result 291 states and 400 transitions. [2019-09-16 16:40:18,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:18,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-16 16:40:18,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:18,352 INFO L225 Difference]: With dead ends: 291 [2019-09-16 16:40:18,352 INFO L226 Difference]: Without dead ends: 168 [2019-09-16 16:40:18,354 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:18,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-16 16:40:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 142. [2019-09-16 16:40:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-16 16:40:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 187 transitions. [2019-09-16 16:40:18,378 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 187 transitions. Word has length 78 [2019-09-16 16:40:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:18,379 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 187 transitions. [2019-09-16 16:40:18,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 187 transitions. [2019-09-16 16:40:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 16:40:18,381 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:18,382 INFO L407 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] [2019-09-16 16:40:18,382 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:18,382 INFO L82 PathProgramCache]: Analyzing trace with hash 761506891, now seen corresponding path program 1 times [2019-09-16 16:40:18,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:18,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:18,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:18,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:18,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:18,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:18,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:18,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:18,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:18,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:18,516 INFO L87 Difference]: Start difference. First operand 142 states and 187 transitions. Second operand 5 states. [2019-09-16 16:40:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:18,869 INFO L93 Difference]: Finished difference Result 299 states and 411 transitions. [2019-09-16 16:40:18,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:18,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-16 16:40:18,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:18,874 INFO L225 Difference]: With dead ends: 299 [2019-09-16 16:40:18,874 INFO L226 Difference]: Without dead ends: 176 [2019-09-16 16:40:18,877 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:18,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-16 16:40:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 142. [2019-09-16 16:40:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-16 16:40:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2019-09-16 16:40:18,899 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 78 [2019-09-16 16:40:18,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:18,899 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2019-09-16 16:40:18,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2019-09-16 16:40:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 16:40:18,901 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:18,901 INFO L407 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] [2019-09-16 16:40:18,902 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:18,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:18,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1637525897, now seen corresponding path program 1 times [2019-09-16 16:40:18,902 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:18,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:18,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:18,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:18,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:19,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:19,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:40:19,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:40:19,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:40:19,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:19,007 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand 6 states. [2019-09-16 16:40:19,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:19,052 INFO L93 Difference]: Finished difference Result 274 states and 372 transitions. [2019-09-16 16:40:19,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:19,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-16 16:40:19,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:19,055 INFO L225 Difference]: With dead ends: 274 [2019-09-16 16:40:19,055 INFO L226 Difference]: Without dead ends: 152 [2019-09-16 16:40:19,056 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:19,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-16 16:40:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2019-09-16 16:40:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-16 16:40:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 191 transitions. [2019-09-16 16:40:19,079 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 191 transitions. Word has length 78 [2019-09-16 16:40:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:19,079 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 191 transitions. [2019-09-16 16:40:19,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:40:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 191 transitions. [2019-09-16 16:40:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 16:40:19,081 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:19,081 INFO L407 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] [2019-09-16 16:40:19,082 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:19,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:19,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2061172619, now seen corresponding path program 1 times [2019-09-16 16:40:19,082 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:19,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:19,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:19,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:19,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:19,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:19,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:40:19,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:40:19,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:40:19,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:19,185 INFO L87 Difference]: Start difference. First operand 147 states and 191 transitions. Second operand 4 states. [2019-09-16 16:40:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:19,366 INFO L93 Difference]: Finished difference Result 394 states and 533 transitions. [2019-09-16 16:40:19,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:40:19,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 16:40:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:19,369 INFO L225 Difference]: With dead ends: 394 [2019-09-16 16:40:19,370 INFO L226 Difference]: Without dead ends: 267 [2019-09-16 16:40:19,371 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:19,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-16 16:40:19,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2019-09-16 16:40:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-16 16:40:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 339 transitions. [2019-09-16 16:40:19,397 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 339 transitions. Word has length 78 [2019-09-16 16:40:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:19,397 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 339 transitions. [2019-09-16 16:40:19,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:40:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 339 transitions. [2019-09-16 16:40:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 16:40:19,399 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:19,400 INFO L407 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] [2019-09-16 16:40:19,400 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:19,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:19,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1710474006, now seen corresponding path program 1 times [2019-09-16 16:40:19,401 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:19,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:19,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:19,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:19,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:19,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:19,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:40:19,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:40:19,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:40:19,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:19,464 INFO L87 Difference]: Start difference. First operand 261 states and 339 transitions. Second operand 6 states. [2019-09-16 16:40:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:19,537 INFO L93 Difference]: Finished difference Result 509 states and 679 transitions. [2019-09-16 16:40:19,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:19,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-16 16:40:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:19,548 INFO L225 Difference]: With dead ends: 509 [2019-09-16 16:40:19,549 INFO L226 Difference]: Without dead ends: 268 [2019-09-16 16:40:19,550 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-16 16:40:19,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-09-16 16:40:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-16 16:40:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 343 transitions. [2019-09-16 16:40:19,579 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 343 transitions. Word has length 78 [2019-09-16 16:40:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:19,580 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 343 transitions. [2019-09-16 16:40:19,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:40:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 343 transitions. [2019-09-16 16:40:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 16:40:19,583 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:19,583 INFO L407 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] [2019-09-16 16:40:19,583 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:19,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:19,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1435714392, now seen corresponding path program 1 times [2019-09-16 16:40:19,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:19,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:19,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:19,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:19,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:19,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:19,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:19,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:19,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:19,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:19,702 INFO L87 Difference]: Start difference. First operand 266 states and 343 transitions. Second operand 5 states. [2019-09-16 16:40:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:20,047 INFO L93 Difference]: Finished difference Result 613 states and 797 transitions. [2019-09-16 16:40:20,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:20,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-16 16:40:20,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:20,051 INFO L225 Difference]: With dead ends: 613 [2019-09-16 16:40:20,051 INFO L226 Difference]: Without dead ends: 368 [2019-09-16 16:40:20,053 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-16 16:40:20,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 326. [2019-09-16 16:40:20,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-16 16:40:20,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 407 transitions. [2019-09-16 16:40:20,081 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 407 transitions. Word has length 78 [2019-09-16 16:40:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:20,081 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 407 transitions. [2019-09-16 16:40:20,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:20,081 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 407 transitions. [2019-09-16 16:40:20,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 16:40:20,083 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:20,083 INFO L407 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] [2019-09-16 16:40:20,083 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:20,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:20,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1945187482, now seen corresponding path program 1 times [2019-09-16 16:40:20,084 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:20,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:20,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:20,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:20,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:20,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:20,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:20,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:20,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:20,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:20,141 INFO L87 Difference]: Start difference. First operand 326 states and 407 transitions. Second operand 5 states. [2019-09-16 16:40:20,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:20,407 INFO L93 Difference]: Finished difference Result 631 states and 792 transitions. [2019-09-16 16:40:20,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:20,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-16 16:40:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:20,411 INFO L225 Difference]: With dead ends: 631 [2019-09-16 16:40:20,411 INFO L226 Difference]: Without dead ends: 326 [2019-09-16 16:40:20,412 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-16 16:40:20,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2019-09-16 16:40:20,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-16 16:40:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 403 transitions. [2019-09-16 16:40:20,435 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 403 transitions. Word has length 78 [2019-09-16 16:40:20,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:20,436 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 403 transitions. [2019-09-16 16:40:20,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 403 transitions. [2019-09-16 16:40:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 16:40:20,437 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:20,437 INFO L407 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] [2019-09-16 16:40:20,438 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:20,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:20,438 INFO L82 PathProgramCache]: Analyzing trace with hash -21959448, now seen corresponding path program 1 times [2019-09-16 16:40:20,438 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:20,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:20,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:20,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:20,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:20,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:20,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:20,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:20,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:20,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:20,490 INFO L87 Difference]: Start difference. First operand 326 states and 403 transitions. Second operand 5 states. [2019-09-16 16:40:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:20,909 INFO L93 Difference]: Finished difference Result 783 states and 1029 transitions. [2019-09-16 16:40:20,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:40:20,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-16 16:40:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:20,914 INFO L225 Difference]: With dead ends: 783 [2019-09-16 16:40:20,914 INFO L226 Difference]: Without dead ends: 477 [2019-09-16 16:40:20,916 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:40:20,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-16 16:40:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 397. [2019-09-16 16:40:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-16 16:40:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 486 transitions. [2019-09-16 16:40:20,953 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 486 transitions. Word has length 78 [2019-09-16 16:40:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:20,954 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 486 transitions. [2019-09-16 16:40:20,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 486 transitions. [2019-09-16 16:40:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 16:40:20,955 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:20,955 INFO L407 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] [2019-09-16 16:40:20,956 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:20,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1146914122, now seen corresponding path program 1 times [2019-09-16 16:40:20,956 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:20,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:20,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:21,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:21,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:21,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:21,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:21,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:21,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:21,004 INFO L87 Difference]: Start difference. First operand 397 states and 486 transitions. Second operand 5 states. [2019-09-16 16:40:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:21,462 INFO L93 Difference]: Finished difference Result 753 states and 932 transitions. [2019-09-16 16:40:21,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:40:21,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-16 16:40:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:21,466 INFO L225 Difference]: With dead ends: 753 [2019-09-16 16:40:21,466 INFO L226 Difference]: Without dead ends: 376 [2019-09-16 16:40:21,468 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-16 16:40:21,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 346. [2019-09-16 16:40:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-16 16:40:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 415 transitions. [2019-09-16 16:40:21,506 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 415 transitions. Word has length 79 [2019-09-16 16:40:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:21,507 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 415 transitions. [2019-09-16 16:40:21,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 415 transitions. [2019-09-16 16:40:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 16:40:21,508 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:21,508 INFO L407 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] [2019-09-16 16:40:21,509 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:21,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:21,509 INFO L82 PathProgramCache]: Analyzing trace with hash 40080166, now seen corresponding path program 1 times [2019-09-16 16:40:21,509 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:21,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:21,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:21,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:21,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:21,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:21,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:21,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:21,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:21,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:21,571 INFO L87 Difference]: Start difference. First operand 346 states and 415 transitions. Second operand 5 states. [2019-09-16 16:40:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:22,050 INFO L93 Difference]: Finished difference Result 763 states and 965 transitions. [2019-09-16 16:40:22,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:22,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-16 16:40:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:22,055 INFO L225 Difference]: With dead ends: 763 [2019-09-16 16:40:22,055 INFO L226 Difference]: Without dead ends: 438 [2019-09-16 16:40:22,058 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:40:22,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-09-16 16:40:22,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 377. [2019-09-16 16:40:22,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-16 16:40:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 440 transitions. [2019-09-16 16:40:22,102 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 440 transitions. Word has length 78 [2019-09-16 16:40:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:22,102 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 440 transitions. [2019-09-16 16:40:22,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 440 transitions. [2019-09-16 16:40:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 16:40:22,104 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:22,104 INFO L407 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] [2019-09-16 16:40:22,104 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:22,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:22,105 INFO L82 PathProgramCache]: Analyzing trace with hash 180628776, now seen corresponding path program 1 times [2019-09-16 16:40:22,105 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:22,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:22,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:22,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:22,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:22,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:22,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:40:22,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:40:22,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:40:22,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:40:22,155 INFO L87 Difference]: Start difference. First operand 377 states and 440 transitions. Second operand 3 states. [2019-09-16 16:40:22,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:22,239 INFO L93 Difference]: Finished difference Result 1052 states and 1275 transitions. [2019-09-16 16:40:22,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:40:22,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-16 16:40:22,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:22,246 INFO L225 Difference]: With dead ends: 1052 [2019-09-16 16:40:22,246 INFO L226 Difference]: Without dead ends: 695 [2019-09-16 16:40:22,249 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:40:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-09-16 16:40:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 691. [2019-09-16 16:40:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-16 16:40:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 812 transitions. [2019-09-16 16:40:22,334 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 812 transitions. Word has length 78 [2019-09-16 16:40:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:22,334 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 812 transitions. [2019-09-16 16:40:22,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:40:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 812 transitions. [2019-09-16 16:40:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-16 16:40:22,337 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:22,338 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:22,338 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:22,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:22,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1319133239, now seen corresponding path program 1 times [2019-09-16 16:40:22,339 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:22,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:22,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:22,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-16 16:40:22,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:22,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:40:22,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:40:22,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:40:22,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:22,419 INFO L87 Difference]: Start difference. First operand 691 states and 812 transitions. Second operand 4 states. [2019-09-16 16:40:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:22,773 INFO L93 Difference]: Finished difference Result 1746 states and 2075 transitions. [2019-09-16 16:40:22,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:40:22,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-16 16:40:22,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:22,781 INFO L225 Difference]: With dead ends: 1746 [2019-09-16 16:40:22,781 INFO L226 Difference]: Without dead ends: 814 [2019-09-16 16:40:22,786 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-09-16 16:40:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 806. [2019-09-16 16:40:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2019-09-16 16:40:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 911 transitions. [2019-09-16 16:40:22,882 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 911 transitions. Word has length 123 [2019-09-16 16:40:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:22,883 INFO L475 AbstractCegarLoop]: Abstraction has 806 states and 911 transitions. [2019-09-16 16:40:22,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:40:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 911 transitions. [2019-09-16 16:40:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-16 16:40:22,889 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:22,890 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:22,890 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:22,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:22,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1006491229, now seen corresponding path program 1 times [2019-09-16 16:40:22,891 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:22,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:22,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-16 16:40:22,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:40:22,966 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-16 16:40:22,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:40:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:23,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-16 16:40:23,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:40:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-16 16:40:23,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:40:23,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-16 16:40:23,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:40:23,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:40:23,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:23,169 INFO L87 Difference]: Start difference. First operand 806 states and 911 transitions. Second operand 4 states. [2019-09-16 16:40:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:23,446 INFO L93 Difference]: Finished difference Result 1925 states and 2192 transitions. [2019-09-16 16:40:23,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:40:23,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-16 16:40:23,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:23,453 INFO L225 Difference]: With dead ends: 1925 [2019-09-16 16:40:23,453 INFO L226 Difference]: Without dead ends: 571 [2019-09-16 16:40:23,458 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-16 16:40:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-09-16 16:40:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-16 16:40:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 630 transitions. [2019-09-16 16:40:23,532 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 630 transitions. Word has length 178 [2019-09-16 16:40:23,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:23,533 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 630 transitions. [2019-09-16 16:40:23,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:40:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 630 transitions. [2019-09-16 16:40:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-16 16:40:23,536 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:23,536 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:23,536 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:23,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:23,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2053123678, now seen corresponding path program 1 times [2019-09-16 16:40:23,537 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:23,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:23,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:23,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:23,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-16 16:40:23,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:23,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:40:23,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:40:23,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:40:23,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:23,693 INFO L87 Difference]: Start difference. First operand 571 states and 630 transitions. Second operand 6 states. [2019-09-16 16:40:24,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:24,430 INFO L93 Difference]: Finished difference Result 716 states and 797 transitions. [2019-09-16 16:40:24,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:40:24,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-09-16 16:40:24,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:24,436 INFO L225 Difference]: With dead ends: 716 [2019-09-16 16:40:24,436 INFO L226 Difference]: Without dead ends: 713 [2019-09-16 16:40:24,439 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:40:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-09-16 16:40:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 705. [2019-09-16 16:40:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-09-16 16:40:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 782 transitions. [2019-09-16 16:40:24,511 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 782 transitions. Word has length 178 [2019-09-16 16:40:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:24,512 INFO L475 AbstractCegarLoop]: Abstraction has 705 states and 782 transitions. [2019-09-16 16:40:24,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:40:24,512 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 782 transitions. [2019-09-16 16:40:24,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-16 16:40:24,515 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:24,515 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:24,516 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:24,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:24,516 INFO L82 PathProgramCache]: Analyzing trace with hash 5197958, now seen corresponding path program 1 times [2019-09-16 16:40:24,516 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:24,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:24,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:24,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:24,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-16 16:40:24,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:24,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:40:24,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:40:24,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:40:24,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:40:24,608 INFO L87 Difference]: Start difference. First operand 705 states and 782 transitions. Second operand 3 states. [2019-09-16 16:40:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:24,675 INFO L93 Difference]: Finished difference Result 1176 states and 1320 transitions. [2019-09-16 16:40:24,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:40:24,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-16 16:40:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:24,680 INFO L225 Difference]: With dead ends: 1176 [2019-09-16 16:40:24,680 INFO L226 Difference]: Without dead ends: 712 [2019-09-16 16:40:24,682 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:40:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-16 16:40:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2019-09-16 16:40:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-16 16:40:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 791 transitions. [2019-09-16 16:40:24,743 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 791 transitions. Word has length 182 [2019-09-16 16:40:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:24,744 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 791 transitions. [2019-09-16 16:40:24,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:40:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 791 transitions. [2019-09-16 16:40:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-16 16:40:24,747 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:24,747 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:40:24,747 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:24,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:24,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1390323253, now seen corresponding path program 1 times [2019-09-16 16:40:24,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:24,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:24,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:24,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:24,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 16:40:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 16:40:24,876 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-16 16:40:25,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:40:25 BoogieIcfgContainer [2019-09-16 16:40:25,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:40:25,079 INFO L168 Benchmark]: Toolchain (without parser) took 9655.43 ms. Allocated memory was 132.6 MB in the beginning and 429.4 MB in the end (delta: 296.7 MB). Free memory was 88.2 MB in the beginning and 296.7 MB in the end (delta: -208.5 MB). Peak memory consumption was 88.3 MB. Max. memory is 7.1 GB. [2019-09-16 16:40:25,081 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:40:25,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 456.61 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 88.0 MB in the beginning and 173.8 MB in the end (delta: -85.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-09-16 16:40:25,087 INFO L168 Benchmark]: Boogie Preprocessor took 50.77 ms. Allocated memory is still 199.2 MB. Free memory was 173.8 MB in the beginning and 171.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:40:25,088 INFO L168 Benchmark]: RCFGBuilder took 596.02 ms. Allocated memory is still 199.2 MB. Free memory was 171.9 MB in the beginning and 139.9 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:40:25,089 INFO L168 Benchmark]: TraceAbstraction took 8547.18 ms. Allocated memory was 199.2 MB in the beginning and 429.4 MB in the end (delta: 230.2 MB). Free memory was 139.9 MB in the beginning and 296.7 MB in the end (delta: -156.8 MB). Peak memory consumption was 73.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:40:25,102 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 456.61 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 88.0 MB in the beginning and 173.8 MB in the end (delta: -85.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.77 ms. Allocated memory is still 199.2 MB. Free memory was 173.8 MB in the beginning and 171.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 596.02 ms. Allocated memory is still 199.2 MB. Free memory was 171.9 MB in the beginning and 139.9 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8547.18 ms. Allocated memory was 199.2 MB in the beginning and 429.4 MB in the end (delta: 230.2 MB). Free memory was 139.9 MB in the beginning and 296.7 MB in the end (delta: -156.8 MB). Peak memory consumption was 73.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; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; VAL [\old(E_1)=7, \old(E_M)=12, \old(local)=3, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=11, \old(m_st)=10, \old(T1_E)=4, \old(t1_i)=13, \old(t1_pc)=8, \old(t1_st)=5, \old(token)=9, 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 [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 ; [L417] int tmp ; [L418] int tmp___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 [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 [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 ; [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() [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() [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 [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() [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 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [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 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [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 [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 [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() [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 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_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=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(); [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() [L49] local = token [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 ; [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() [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 [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() [L329] COND TRUE \read(tmp___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 [L53] m_pc = 1 [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 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [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 [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 ; [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 [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() [L321] COND TRUE \read(tmp) [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() [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 [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 [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() [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 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_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(); [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, 151 locations, 1 error locations. UNSAFE Result, 8.4s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3380 SDtfs, 3650 SDslu, 3395 SDs, 0 SdLazy, 2770 SolverSat, 1061 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 246 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=806occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 332 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1959 NumberOfCodeBlocks, 1959 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1759 ConstructedInterpolants, 0 QuantifiedInterpolants, 301568 SizeOfPredicates, 0 NumberOfNonLiveVariables, 711 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 456/461 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...