/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-36cd7be [2021-02-24 00:32:29,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-24 00:32:29,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-24 00:32:29,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-24 00:32:29,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-24 00:32:29,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-24 00:32:29,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-24 00:32:29,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-24 00:32:29,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-24 00:32:29,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-24 00:32:29,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-24 00:32:29,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-24 00:32:29,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-24 00:32:29,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-24 00:32:29,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-24 00:32:29,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-24 00:32:29,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-24 00:32:29,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-24 00:32:29,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-24 00:32:29,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-24 00:32:29,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-24 00:32:29,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-24 00:32:29,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-24 00:32:29,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-24 00:32:29,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-24 00:32:29,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-24 00:32:29,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-24 00:32:29,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-24 00:32:29,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-24 00:32:29,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-24 00:32:29,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-24 00:32:29,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-24 00:32:29,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-24 00:32:29,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-24 00:32:29,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-24 00:32:29,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-24 00:32:29,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-24 00:32:29,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-24 00:32:29,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-24 00:32:29,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-24 00:32:29,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-24 00:32:29,527 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-24 00:32:29,545 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-24 00:32:29,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-24 00:32:29,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-24 00:32:29,547 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-24 00:32:29,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-24 00:32:29,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-24 00:32:29,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-24 00:32:29,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-24 00:32:29,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-24 00:32:29,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-24 00:32:29,549 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-24 00:32:29,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-24 00:32:29,550 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-24 00:32:29,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-24 00:32:29,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-24 00:32:29,551 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-24 00:32:29,551 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-24 00:32:29,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-24 00:32:29,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-24 00:32:29,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-24 00:32:29,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-24 00:32:29,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-24 00:32:29,553 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2021-02-24 00:32:29,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-24 00:32:29,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-24 00:32:29,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-24 00:32:29,971 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-24 00:32:29,971 INFO L275 PluginConnector]: CDTParser initialized [2021-02-24 00:32:29,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2021-02-24 00:32:30,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06927429a/ee360de400134a7ebbde49c51b62c7fc/FLAGd2a5173e2 [2021-02-24 00:32:30,715 INFO L306 CDTParser]: Found 1 translation units. [2021-02-24 00:32:30,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c [2021-02-24 00:32:30,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06927429a/ee360de400134a7ebbde49c51b62c7fc/FLAGd2a5173e2 [2021-02-24 00:32:31,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06927429a/ee360de400134a7ebbde49c51b62c7fc [2021-02-24 00:32:31,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-24 00:32:31,105 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-24 00:32:31,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-24 00:32:31,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-24 00:32:31,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-24 00:32:31,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:32:31" (1/1) ... [2021-02-24 00:32:31,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2431705f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:31, skipping insertion in model container [2021-02-24 00:32:31,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:32:31" (1/1) ... [2021-02-24 00:32:31,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-24 00:32:31,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-24 00:32:31,301 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c[366,379] [2021-02-24 00:32:31,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 00:32:31,380 INFO L203 MainTranslator]: Completed pre-run [2021-02-24 00:32:31,394 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-2.c[366,379] [2021-02-24 00:32:31,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-24 00:32:31,446 INFO L208 MainTranslator]: Completed translation [2021-02-24 00:32:31,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:31 WrapperNode [2021-02-24 00:32:31,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-24 00:32:31,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-24 00:32:31,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-24 00:32:31,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-24 00:32:31,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:31" (1/1) ... [2021-02-24 00:32:31,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:31" (1/1) ... [2021-02-24 00:32:31,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:31" (1/1) ... [2021-02-24 00:32:31,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:31" (1/1) ... [2021-02-24 00:32:31,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:31" (1/1) ... [2021-02-24 00:32:31,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:31" (1/1) ... [2021-02-24 00:32:31,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:31" (1/1) ... [2021-02-24 00:32:31,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-24 00:32:31,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-24 00:32:31,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-24 00:32:31,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-24 00:32:31,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:31" (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 [2021-02-24 00:32:31,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-24 00:32:31,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-24 00:32:31,636 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-24 00:32:31,636 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-02-24 00:32:31,637 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2021-02-24 00:32:31,637 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2021-02-24 00:32:31,637 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2021-02-24 00:32:31,637 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2021-02-24 00:32:31,637 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-02-24 00:32:31,638 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2021-02-24 00:32:31,638 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-02-24 00:32:31,639 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2021-02-24 00:32:31,639 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-02-24 00:32:31,639 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-02-24 00:32:31,640 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-02-24 00:32:31,640 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-02-24 00:32:31,640 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2021-02-24 00:32:31,641 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2021-02-24 00:32:31,641 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2021-02-24 00:32:31,641 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2021-02-24 00:32:31,644 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2021-02-24 00:32:31,645 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-24 00:32:31,645 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-24 00:32:31,645 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-24 00:32:31,645 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-24 00:32:31,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-24 00:32:31,646 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-02-24 00:32:31,646 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2021-02-24 00:32:31,646 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2021-02-24 00:32:31,646 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-02-24 00:32:31,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-24 00:32:31,646 INFO L130 BoogieDeclarations]: Found specification of procedure master [2021-02-24 00:32:31,646 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2021-02-24 00:32:31,646 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-02-24 00:32:31,647 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2021-02-24 00:32:31,647 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-02-24 00:32:31,647 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2021-02-24 00:32:31,647 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-02-24 00:32:31,647 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-02-24 00:32:31,647 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-02-24 00:32:31,647 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2021-02-24 00:32:31,648 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2021-02-24 00:32:31,648 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2021-02-24 00:32:31,648 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2021-02-24 00:32:31,648 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2021-02-24 00:32:31,648 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-24 00:32:31,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-24 00:32:31,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-24 00:32:31,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-24 00:32:31,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-24 00:32:31,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-24 00:32:31,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-24 00:32:32,315 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-24 00:32:32,316 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-02-24 00:32:32,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:32:32 BoogieIcfgContainer [2021-02-24 00:32:32,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-24 00:32:32,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-24 00:32:32,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-24 00:32:32,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-24 00:32:32,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 12:32:31" (1/3) ... [2021-02-24 00:32:32,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1145ba18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:32:32, skipping insertion in model container [2021-02-24 00:32:32,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:32:31" (2/3) ... [2021-02-24 00:32:32,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1145ba18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:32:32, skipping insertion in model container [2021-02-24 00:32:32,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:32:32" (3/3) ... [2021-02-24 00:32:32,330 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2021-02-24 00:32:32,339 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-24 00:32:32,345 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-24 00:32:32,368 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-24 00:32:32,400 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-24 00:32:32,400 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-24 00:32:32,400 INFO L378 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2021-02-24 00:32:32,401 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-24 00:32:32,401 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-24 00:32:32,401 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-24 00:32:32,401 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-24 00:32:32,401 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-24 00:32:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2021-02-24 00:32:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-02-24 00:32:32,448 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:32:32,449 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:32:32,449 INFO L428 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:32:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:32:32,457 INFO L82 PathProgramCache]: Analyzing trace with hash -925240097, now seen corresponding path program 1 times [2021-02-24 00:32:32,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:32:32,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [282568281] [2021-02-24 00:32:32,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:32:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:32,951 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,952 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:32,966 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,966 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:32,967 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,968 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:32,969 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,969 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:32,970 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,971 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:32,972 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:32,972 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:33,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:33,146 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:33,149 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:33,150 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:33,150 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:33,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:32:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:33,181 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:33,182 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:33,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:32:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:33,197 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:33,198 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:33,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:32:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:33,228 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:33,229 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:33,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:32:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:33,271 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:33,272 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:33,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:32:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:33,304 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:33,305 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:33,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:33,313 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:33,314 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:33,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:33,324 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:33,328 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:33,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:32:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:33,341 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:33,342 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:33,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:32:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:33,364 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:33,365 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-24 00:32:33,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [282568281] [2021-02-24 00:32:33,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:32:33,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-02-24 00:32:33,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337145613] [2021-02-24 00:32:33,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-02-24 00:32:33,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:32:33,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-02-24 00:32:33,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-02-24 00:32:33,465 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 7 states. [2021-02-24 00:32:36,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:32:36,060 INFO L93 Difference]: Finished difference Result 803 states and 1076 transitions. [2021-02-24 00:32:36,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-02-24 00:32:36,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2021-02-24 00:32:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:32:36,099 INFO L225 Difference]: With dead ends: 803 [2021-02-24 00:32:36,099 INFO L226 Difference]: Without dead ends: 592 [2021-02-24 00:32:36,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-02-24 00:32:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-02-24 00:32:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 411. [2021-02-24 00:32:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2021-02-24 00:32:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 500 transitions. [2021-02-24 00:32:36,324 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 500 transitions. Word has length 118 [2021-02-24 00:32:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:32:36,325 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 500 transitions. [2021-02-24 00:32:36,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-02-24 00:32:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 500 transitions. [2021-02-24 00:32:36,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-02-24 00:32:36,332 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:32:36,332 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:32:36,333 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-24 00:32:36,333 INFO L428 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:32:36,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:32:36,334 INFO L82 PathProgramCache]: Analyzing trace with hash -283101501, now seen corresponding path program 1 times [2021-02-24 00:32:36,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:32:36,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1684981150] [2021-02-24 00:32:36,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:32:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,525 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,527 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,529 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,530 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:36,536 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,537 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:36,538 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,538 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:36,539 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,539 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:36,540 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,541 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,627 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,628 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:32:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,642 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,643 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:32:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,656 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,657 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:32:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,678 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,679 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,680 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,681 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:36,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:32:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,701 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,701 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:32:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,720 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,721 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:36,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,736 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,737 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,754 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,755 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:32:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,761 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,762 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:32:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,767 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,768 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-24 00:32:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,834 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,834 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:36,848 WARN L141 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-02-24 00:32:36,850 WARN L147 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size 14 [2021-02-24 00:32:36,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-24 00:32:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,897 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,898 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:32:36,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,920 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,921 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:36,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,928 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,928 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,936 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,937 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:36,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-02-24 00:32:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:36,968 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:36,969 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-02-24 00:32:37,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1684981150] [2021-02-24 00:32:37,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:32:37,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-24 00:32:37,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635423491] [2021-02-24 00:32:37,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-24 00:32:37,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:32:37,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-24 00:32:37,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-02-24 00:32:37,046 INFO L87 Difference]: Start difference. First operand 411 states and 500 transitions. Second operand 10 states. [2021-02-24 00:32:40,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:32:40,524 INFO L93 Difference]: Finished difference Result 1570 states and 2153 transitions. [2021-02-24 00:32:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-02-24 00:32:40,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2021-02-24 00:32:40,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:32:40,550 INFO L225 Difference]: With dead ends: 1570 [2021-02-24 00:32:40,550 INFO L226 Difference]: Without dead ends: 1207 [2021-02-24 00:32:40,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2021-02-24 00:32:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2021-02-24 00:32:40,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 785. [2021-02-24 00:32:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2021-02-24 00:32:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 993 transitions. [2021-02-24 00:32:40,820 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 993 transitions. Word has length 184 [2021-02-24 00:32:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:32:40,822 INFO L480 AbstractCegarLoop]: Abstraction has 785 states and 993 transitions. [2021-02-24 00:32:40,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-24 00:32:40,822 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 993 transitions. [2021-02-24 00:32:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-02-24 00:32:40,828 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:32:40,828 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:32:40,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-24 00:32:40,829 INFO L428 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:32:40,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:32:40,830 INFO L82 PathProgramCache]: Analyzing trace with hash -453914013, now seen corresponding path program 1 times [2021-02-24 00:32:40,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:32:40,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626702020] [2021-02-24 00:32:40,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:32:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:40,867 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:40,868 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:40,869 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:40,869 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:40,873 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:40,874 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:40,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:40,953 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:40,954 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:40,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:32:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:40,966 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:40,967 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:40,970 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:40,971 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:32:40,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:32:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:40,977 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:40,978 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:40,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:32:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:40,993 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:40,994 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:40,994 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:40,995 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:32:41,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:32:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,022 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,028 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:32:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,034 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,035 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,038 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,039 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,041 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,042 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:32:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,046 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,047 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:32:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,050 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,050 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-24 00:32:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,078 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,078 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-24 00:32:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,084 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,084 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,089 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,090 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,093 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,094 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,097 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,098 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-02-24 00:32:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:41,104 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:41,104 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-02-24 00:32:41,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [626702020] [2021-02-24 00:32:41,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:32:41,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-02-24 00:32:41,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350797724] [2021-02-24 00:32:41,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-24 00:32:41,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:32:41,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-24 00:32:41,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-02-24 00:32:41,140 INFO L87 Difference]: Start difference. First operand 785 states and 993 transitions. Second operand 9 states. [2021-02-24 00:32:41,651 WARN L202 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-02-24 00:32:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:32:43,422 INFO L93 Difference]: Finished difference Result 1832 states and 2383 transitions. [2021-02-24 00:32:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-02-24 00:32:43,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2021-02-24 00:32:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:32:43,433 INFO L225 Difference]: With dead ends: 1832 [2021-02-24 00:32:43,433 INFO L226 Difference]: Without dead ends: 1093 [2021-02-24 00:32:43,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2021-02-24 00:32:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-02-24 00:32:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 779. [2021-02-24 00:32:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2021-02-24 00:32:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 982 transitions. [2021-02-24 00:32:43,622 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 982 transitions. Word has length 184 [2021-02-24 00:32:43,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:32:43,623 INFO L480 AbstractCegarLoop]: Abstraction has 779 states and 982 transitions. [2021-02-24 00:32:43,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-24 00:32:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 982 transitions. [2021-02-24 00:32:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-02-24 00:32:43,627 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:32:43,627 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:32:43,627 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-24 00:32:43,628 INFO L428 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:32:43,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:32:43,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1497123805, now seen corresponding path program 1 times [2021-02-24 00:32:43,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:32:43,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [197662261] [2021-02-24 00:32:43,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:32:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,686 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,687 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:43,691 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,692 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:43,692 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,693 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:43,694 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,694 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,695 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,695 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:32:43,699 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,700 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,769 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,769 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,770 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,771 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:32:43,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:32:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,785 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,785 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:32:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,788 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,789 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:32:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,803 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,804 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:32:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,822 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,823 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:32:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,830 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,831 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,834 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,835 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,838 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,839 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:32:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,843 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,844 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:32:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,848 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,848 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-24 00:32:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,883 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,883 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,884 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,885 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:43,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-24 00:32:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,900 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,902 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,907 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,909 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,913 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,913 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,917 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,918 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-02-24 00:32:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:43,928 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,929 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:43,929 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:43,930 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:44,008 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-02-24 00:32:44,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [197662261] [2021-02-24 00:32:44,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:32:44,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-24 00:32:44,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040342130] [2021-02-24 00:32:44,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-24 00:32:44,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:32:44,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-24 00:32:44,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-02-24 00:32:44,011 INFO L87 Difference]: Start difference. First operand 779 states and 982 transitions. Second operand 11 states. [2021-02-24 00:32:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:32:51,225 INFO L93 Difference]: Finished difference Result 4526 states and 6148 transitions. [2021-02-24 00:32:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-02-24 00:32:51,226 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2021-02-24 00:32:51,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:32:51,262 INFO L225 Difference]: With dead ends: 4526 [2021-02-24 00:32:51,262 INFO L226 Difference]: Without dead ends: 3792 [2021-02-24 00:32:51,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2021-02-24 00:32:51,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2021-02-24 00:32:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 3004. [2021-02-24 00:32:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2021-02-24 00:32:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 3803 transitions. [2021-02-24 00:32:52,080 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 3803 transitions. Word has length 189 [2021-02-24 00:32:52,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:32:52,081 INFO L480 AbstractCegarLoop]: Abstraction has 3004 states and 3803 transitions. [2021-02-24 00:32:52,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-24 00:32:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 3803 transitions. [2021-02-24 00:32:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-02-24 00:32:52,089 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:32:52,090 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:32:52,090 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-24 00:32:52,090 INFO L428 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:32:52,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:32:52,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1911718646, now seen corresponding path program 1 times [2021-02-24 00:32:52,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:32:52,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1070181268] [2021-02-24 00:32:52,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:32:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,139 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,140 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,140 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,141 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,205 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,206 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:32:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,217 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,217 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:32:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,220 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,220 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:32:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,236 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,237 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:32:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,262 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,263 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:32:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,267 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,268 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,271 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,275 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,278 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,279 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:32:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,285 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,286 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:32:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,289 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,290 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-24 00:32:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,335 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,335 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,336 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,340 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-24 00:32:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,352 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,353 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,378 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,379 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,381 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,382 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:32:52,399 WARN L141 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size [2021-02-24 00:32:52,400 WARN L147 QuantifierPusher]: treesize reduction 9, result has 50.0 percent of original size 9 [2021-02-24 00:32:52,417 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,418 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,429 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,430 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,433 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,434 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:32:52,448 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,449 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:32:52,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:32:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,470 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,471 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-02-24 00:32:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,527 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,529 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-24 00:32:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,538 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,539 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,547 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,548 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,551 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,552 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-02-24 00:32:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,556 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,557 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-02-24 00:32:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:52,570 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:52,570 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-02-24 00:32:52,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1070181268] [2021-02-24 00:32:52,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-24 00:32:52,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-02-24 00:32:52,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674569237] [2021-02-24 00:32:52,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-24 00:32:52,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:32:52,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-24 00:32:52,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-02-24 00:32:52,677 INFO L87 Difference]: Start difference. First operand 3004 states and 3803 transitions. Second operand 12 states. [2021-02-24 00:32:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:32:56,206 INFO L93 Difference]: Finished difference Result 6537 states and 8543 transitions. [2021-02-24 00:32:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-02-24 00:32:56,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 233 [2021-02-24 00:32:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:32:56,235 INFO L225 Difference]: With dead ends: 6537 [2021-02-24 00:32:56,236 INFO L226 Difference]: Without dead ends: 3268 [2021-02-24 00:32:56,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=224, Invalid=532, Unknown=0, NotChecked=0, Total=756 [2021-02-24 00:32:56,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3268 states. [2021-02-24 00:32:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3268 to 2458. [2021-02-24 00:32:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2458 states. [2021-02-24 00:32:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 3048 transitions. [2021-02-24 00:32:56,901 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 3048 transitions. Word has length 233 [2021-02-24 00:32:56,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:32:56,902 INFO L480 AbstractCegarLoop]: Abstraction has 2458 states and 3048 transitions. [2021-02-24 00:32:56,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-24 00:32:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 3048 transitions. [2021-02-24 00:32:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-02-24 00:32:56,908 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:32:56,909 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:32:56,909 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-24 00:32:56,909 INFO L428 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:32:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:32:56,910 INFO L82 PathProgramCache]: Analyzing trace with hash 759361234, now seen corresponding path program 1 times [2021-02-24 00:32:56,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:32:56,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [646773064] [2021-02-24 00:32:56,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:32:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:56,972 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,973 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:56,979 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,979 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:56,980 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,981 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:56,981 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,981 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:56,982 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:56,982 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,043 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,044 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,044 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,045 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:57,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:32:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,058 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,058 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:32:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,061 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,062 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:32:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,075 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,076 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:32:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,095 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,095 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:32:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,101 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,102 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,107 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,108 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,110 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,111 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:32:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,115 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,115 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:32:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,119 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,120 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-24 00:32:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,149 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,149 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-24 00:32:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,155 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,156 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,162 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,164 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,168 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,168 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:32:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,173 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,173 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-02-24 00:32:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,208 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,209 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,210 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,210 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:32:57,223 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,223 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-24 00:32:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,231 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,232 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:32:57,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:32:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,251 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,252 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,255 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,256 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:32:57,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:32:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,260 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,261 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:32:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,272 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,272 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,273 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,280 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-24 00:32:57,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-02-24 00:32:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:32:57,290 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:32:57,290 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:32:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-02-24 00:32:57,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [646773064] [2021-02-24 00:32:57,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:32:57,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-24 00:32:57,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078881243] [2021-02-24 00:32:57,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-24 00:32:57,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:32:57,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-24 00:32:57,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-02-24 00:32:57,455 INFO L87 Difference]: Start difference. First operand 2458 states and 3048 transitions. Second operand 11 states. [2021-02-24 00:33:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:01,923 INFO L93 Difference]: Finished difference Result 7017 states and 9122 transitions. [2021-02-24 00:33:01,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-02-24 00:33:01,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 233 [2021-02-24 00:33:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:01,958 INFO L225 Difference]: With dead ends: 7017 [2021-02-24 00:33:01,958 INFO L226 Difference]: Without dead ends: 4604 [2021-02-24 00:33:01,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2021-02-24 00:33:01,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4604 states. [2021-02-24 00:33:02,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4604 to 3690. [2021-02-24 00:33:02,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3690 states. [2021-02-24 00:33:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 4490 transitions. [2021-02-24 00:33:02,815 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 4490 transitions. Word has length 233 [2021-02-24 00:33:02,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:02,815 INFO L480 AbstractCegarLoop]: Abstraction has 3690 states and 4490 transitions. [2021-02-24 00:33:02,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-24 00:33:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 4490 transitions. [2021-02-24 00:33:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2021-02-24 00:33:02,826 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:02,826 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:33:02,826 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-24 00:33:02,827 INFO L428 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:02,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:02,827 INFO L82 PathProgramCache]: Analyzing trace with hash -209033575, now seen corresponding path program 1 times [2021-02-24 00:33:02,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:02,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2019484725] [2021-02-24 00:33:02,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:02,872 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:02,873 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:02,876 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:02,876 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:02,877 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:02,877 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:02,878 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:02,878 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:02,879 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:02,879 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:33:02,883 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:02,883 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:02,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:02,949 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:02,949 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:02,950 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:02,950 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:33:02,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:02,963 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:02,964 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:02,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:33:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:02,966 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:02,968 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:02,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:02,981 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:02,982 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:02,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:33:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:02,999 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,000 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:33:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,005 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,007 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,011 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,011 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,014 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,015 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:33:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,019 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,019 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:33:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,022 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,022 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-02-24 00:33:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,048 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,049 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-24 00:33:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,053 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,054 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,059 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,059 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,063 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,063 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,068 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,069 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-02-24 00:33:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,094 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,094 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,095 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,095 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:03,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2021-02-24 00:33:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,107 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,108 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,109 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,109 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:03,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2021-02-24 00:33:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,127 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,127 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-24 00:33:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,133 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,133 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,138 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,139 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,142 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,142 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:33:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,145 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,145 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-02-24 00:33:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:03,151 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:03,152 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 38 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-02-24 00:33:03,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2019484725] [2021-02-24 00:33:03,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-24 00:33:03,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-02-24 00:33:03,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257503857] [2021-02-24 00:33:03,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-24 00:33:03,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:03,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-24 00:33:03,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-02-24 00:33:03,224 INFO L87 Difference]: Start difference. First operand 3690 states and 4490 transitions. Second operand 12 states. [2021-02-24 00:33:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:11,062 INFO L93 Difference]: Finished difference Result 7123 states and 8791 transitions. [2021-02-24 00:33:11,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-02-24 00:33:11,062 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 262 [2021-02-24 00:33:11,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:11,094 INFO L225 Difference]: With dead ends: 7123 [2021-02-24 00:33:11,095 INFO L226 Difference]: Without dead ends: 4639 [2021-02-24 00:33:11,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=689, Invalid=3217, Unknown=0, NotChecked=0, Total=3906 [2021-02-24 00:33:11,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4639 states. [2021-02-24 00:33:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4639 to 3732. [2021-02-24 00:33:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3732 states. [2021-02-24 00:33:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 4438 transitions. [2021-02-24 00:33:11,798 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 4438 transitions. Word has length 262 [2021-02-24 00:33:11,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:11,799 INFO L480 AbstractCegarLoop]: Abstraction has 3732 states and 4438 transitions. [2021-02-24 00:33:11,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-24 00:33:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 4438 transitions. [2021-02-24 00:33:11,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-02-24 00:33:11,809 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:11,810 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:33:11,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-24 00:33:11,810 INFO L428 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:11,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:11,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1959177767, now seen corresponding path program 1 times [2021-02-24 00:33:11,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:11,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1976479627] [2021-02-24 00:33:11,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:11,860 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:11,860 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:11,863 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:11,864 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:11,864 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:11,865 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:11,865 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:11,866 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:11,866 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:11,866 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:11,867 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:11,867 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:33:11,871 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:11,872 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:11,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:11,933 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:11,933 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:11,935 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:11,935 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:33:11,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:11,948 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:11,950 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:11,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:33:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:11,952 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:11,953 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:11,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:11,965 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:11,966 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:11,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:33:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:11,984 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:11,986 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:11,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:33:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,004 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,005 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,007 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,007 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,009 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,010 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:33:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,013 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,014 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:33:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,017 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,017 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-02-24 00:33:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,037 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,038 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-02-24 00:33:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,040 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,040 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-02-24 00:33:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,069 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,069 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,071 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,071 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:12,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-24 00:33:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,083 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,084 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,087 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,088 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,090 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,090 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,093 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,093 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2021-02-24 00:33:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,104 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,105 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:33:12,114 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,114 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,115 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,115 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-24 00:33:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,122 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,123 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,130 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,131 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,131 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,132 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:12,143 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,143 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:12,155 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,155 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,158 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,158 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:33:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,162 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,163 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,163 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,164 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:12,177 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,177 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:12,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-02-24 00:33:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:12,196 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:12,197 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-02-24 00:33:12,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1976479627] [2021-02-24 00:33:12,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-24 00:33:12,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-02-24 00:33:12,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152973474] [2021-02-24 00:33:12,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-02-24 00:33:12,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:12,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-02-24 00:33:12,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-02-24 00:33:12,274 INFO L87 Difference]: Start difference. First operand 3732 states and 4438 transitions. Second operand 17 states. [2021-02-24 00:33:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:23,100 INFO L93 Difference]: Finished difference Result 8547 states and 10741 transitions. [2021-02-24 00:33:23,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-02-24 00:33:23,100 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 268 [2021-02-24 00:33:23,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:23,134 INFO L225 Difference]: With dead ends: 8547 [2021-02-24 00:33:23,135 INFO L226 Difference]: Without dead ends: 4859 [2021-02-24 00:33:23,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3889 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1782, Invalid=8724, Unknown=0, NotChecked=0, Total=10506 [2021-02-24 00:33:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4859 states. [2021-02-24 00:33:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4859 to 3740. [2021-02-24 00:33:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3740 states. [2021-02-24 00:33:24,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 4345 transitions. [2021-02-24 00:33:24,299 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 4345 transitions. Word has length 268 [2021-02-24 00:33:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:24,300 INFO L480 AbstractCegarLoop]: Abstraction has 3740 states and 4345 transitions. [2021-02-24 00:33:24,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-02-24 00:33:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 4345 transitions. [2021-02-24 00:33:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-02-24 00:33:24,311 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:24,311 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:33:24,311 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-24 00:33:24,312 INFO L428 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:24,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:24,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1148524118, now seen corresponding path program 1 times [2021-02-24 00:33:24,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:24,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [520314706] [2021-02-24 00:33:24,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,414 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,415 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,416 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,416 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:33:24,423 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,424 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-24 00:33:24,433 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,433 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-02-24 00:33:24,438 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,439 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,501 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,502 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,514 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,514 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:33:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,516 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,516 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,528 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,529 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:33:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,546 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,546 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:33:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,550 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,550 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,552 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,553 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,555 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,555 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:33:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,558 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,559 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:33:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,561 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,562 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-02-24 00:33:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,582 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,582 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-02-24 00:33:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,584 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,585 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-02-24 00:33:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,615 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,616 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,617 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,617 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-24 00:33:24,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-24 00:33:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,623 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,624 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,627 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,628 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,630 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,630 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,632 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,633 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2021-02-24 00:33:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,651 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,651 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-02-24 00:33:24,663 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,664 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-02-24 00:33:24,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-24 00:33:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,683 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,683 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,687 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,688 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,690 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,691 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:33:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,693 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,693 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-02-24 00:33:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:24,700 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:24,700 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-02-24 00:33:24,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [520314706] [2021-02-24 00:33:24,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-24 00:33:24,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-02-24 00:33:24,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384398681] [2021-02-24 00:33:24,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-24 00:33:24,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:24,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-24 00:33:24,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-02-24 00:33:24,786 INFO L87 Difference]: Start difference. First operand 3740 states and 4345 transitions. Second operand 12 states. [2021-02-24 00:33:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:31,633 INFO L93 Difference]: Finished difference Result 10452 states and 12466 transitions. [2021-02-24 00:33:31,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-02-24 00:33:31,633 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 268 [2021-02-24 00:33:31,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:31,688 INFO L225 Difference]: With dead ends: 10452 [2021-02-24 00:33:31,688 INFO L226 Difference]: Without dead ends: 7672 [2021-02-24 00:33:31,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2021-02-24 00:33:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7672 states. [2021-02-24 00:33:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7672 to 6301. [2021-02-24 00:33:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6301 states. [2021-02-24 00:33:33,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6301 states to 6301 states and 7426 transitions. [2021-02-24 00:33:33,046 INFO L78 Accepts]: Start accepts. Automaton has 6301 states and 7426 transitions. Word has length 268 [2021-02-24 00:33:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:33,047 INFO L480 AbstractCegarLoop]: Abstraction has 6301 states and 7426 transitions. [2021-02-24 00:33:33,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-24 00:33:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 6301 states and 7426 transitions. [2021-02-24 00:33:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-02-24 00:33:33,055 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:33,056 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:33:33,056 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-24 00:33:33,056 INFO L428 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:33,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:33,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1399302786, now seen corresponding path program 1 times [2021-02-24 00:33:33,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:33,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [595476669] [2021-02-24 00:33:33,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,100 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,101 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,101 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,102 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-24 00:33:33,105 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,105 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,162 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,163 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-02-24 00:33:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,173 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,174 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-02-24 00:33:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,176 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,176 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-02-24 00:33:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,187 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,187 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-02-24 00:33:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,203 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,204 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-02-24 00:33:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,207 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,208 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,210 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,210 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,213 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,213 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-02-24 00:33:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,217 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,217 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-02-24 00:33:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,219 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,220 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-02-24 00:33:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,238 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,239 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-02-24 00:33:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,240 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,241 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-02-24 00:33:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,266 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,267 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-02-24 00:33:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,271 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,271 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,274 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,275 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,277 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,277 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-02-24 00:33:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,280 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,280 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2021-02-24 00:33:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,287 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,287 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-02-24 00:33:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,291 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,292 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-24 00:33:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,296 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,296 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-02-24 00:33:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,299 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,299 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-24 00:33:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,301 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,302 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-02-24 00:33:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-24 00:33:33,306 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-24 00:33:33,307 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-24 00:33:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2021-02-24 00:33:33,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [595476669] [2021-02-24 00:33:33,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-24 00:33:33,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-02-24 00:33:33,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535772993] [2021-02-24 00:33:33,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-02-24 00:33:33,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-24 00:33:33,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-02-24 00:33:33,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-02-24 00:33:33,370 INFO L87 Difference]: Start difference. First operand 6301 states and 7426 transitions. Second operand 9 states. [2021-02-24 00:33:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-24 00:33:36,823 INFO L93 Difference]: Finished difference Result 11985 states and 14311 transitions. [2021-02-24 00:33:36,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-02-24 00:33:36,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 272 [2021-02-24 00:33:36,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-24 00:33:36,879 INFO L225 Difference]: With dead ends: 11985 [2021-02-24 00:33:36,879 INFO L226 Difference]: Without dead ends: 7490 [2021-02-24 00:33:36,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2021-02-24 00:33:36,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7490 states. [2021-02-24 00:33:38,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7490 to 6363. [2021-02-24 00:33:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6363 states. [2021-02-24 00:33:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6363 states to 6363 states and 7508 transitions. [2021-02-24 00:33:38,238 INFO L78 Accepts]: Start accepts. Automaton has 6363 states and 7508 transitions. Word has length 272 [2021-02-24 00:33:38,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-24 00:33:38,239 INFO L480 AbstractCegarLoop]: Abstraction has 6363 states and 7508 transitions. [2021-02-24 00:33:38,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-02-24 00:33:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand 6363 states and 7508 transitions. [2021-02-24 00:33:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2021-02-24 00:33:38,248 INFO L414 BasicCegarLoop]: Found error trace [2021-02-24 00:33:38,248 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-24 00:33:38,248 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-24 00:33:38,249 INFO L428 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-24 00:33:38,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-24 00:33:38,249 INFO L82 PathProgramCache]: Analyzing trace with hash 800512033, now seen corresponding path program 1 times [2021-02-24 00:33:38,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-24 00:33:38,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2025728437] [2021-02-24 00:33:38,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-24 00:33:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-02-24 00:33:38,275 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-02-24 00:33:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-02-24 00:33:38,300 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-02-24 00:33:38,433 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2021-02-24 00:33:38,434 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-02-24 00:33:38,434 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-02-24 00:33:38,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 12:33:38 BoogieIcfgContainer [2021-02-24 00:33:38,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-02-24 00:33:38,674 INFO L168 Benchmark]: Toolchain (without parser) took 67578.95 ms. Allocated memory was 155.2 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 131.7 MB in the beginning and 524.4 MB in the end (delta: -392.7 MB). Peak memory consumption was 703.0 MB. Max. memory is 8.0 GB. [2021-02-24 00:33:38,674 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 155.2 MB. Free memory is still 127.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-24 00:33:38,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.75 ms. Allocated memory is still 155.2 MB. Free memory was 130.6 MB in the beginning and 117.7 MB in the end (delta: 12.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-02-24 00:33:38,675 INFO L168 Benchmark]: Boogie Preprocessor took 53.12 ms. Allocated memory is still 155.2 MB. Free memory was 117.7 MB in the beginning and 115.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-24 00:33:38,675 INFO L168 Benchmark]: RCFGBuilder took 817.01 ms. Allocated memory is still 155.2 MB. Free memory was 115.7 MB in the beginning and 107.2 MB in the end (delta: 8.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-02-24 00:33:38,676 INFO L168 Benchmark]: TraceAbstraction took 66351.49 ms. Allocated memory was 155.2 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 106.8 MB in the beginning and 524.4 MB in the end (delta: -417.6 MB). Peak memory consumption was 678.0 MB. Max. memory is 8.0 GB. [2021-02-24 00:33:38,677 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 155.2 MB. Free memory is still 127.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 339.75 ms. Allocated memory is still 155.2 MB. Free memory was 130.6 MB in the beginning and 117.7 MB in the end (delta: 12.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 53.12 ms. Allocated memory is still 155.2 MB. Free memory was 117.7 MB in the beginning and 115.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 817.01 ms. Allocated memory is still 155.2 MB. Free memory was 115.7 MB in the beginning and 107.2 MB in the end (delta: 8.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 66351.49 ms. Allocated memory was 155.2 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 106.8 MB in the beginning and 524.4 MB in the end (delta: -417.6 MB). Peak memory consumption was 678.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=53, m_pc=0, m_st=56, T1_E=50, t1_i=64, t1_pc=54, t1_st=51, token=68] [L17] int t1_pc = 0; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=53, m_pc=0, m_st=56, T1_E=50, t1_i=64, t1_pc=0, t1_st=51, token=68] [L18] int m_st ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=53, m_pc=0, m_st=0, T1_E=50, t1_i=64, t1_pc=0, t1_st=51, token=68] [L19] int t1_st ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=53, m_pc=0, m_st=0, T1_E=50, t1_i=64, t1_pc=0, t1_st=0, token=68] [L20] int m_i ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=64, t1_pc=0, t1_st=0, token=68] [L21] int t1_i ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=63, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=0, t1_pc=0, t1_st=0, token=68] [L22] int M_E = 2; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=50, t1_i=0, t1_pc=0, t1_st=0, token=68] [L23] int T1_E = 2; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=59, local=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=68] [L24] int E_M = 2; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=67, E_M=2, local=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=68] [L25] int E_1 = 2; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=2, E_M=2, local=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=68] [L29] int token ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=2, E_M=2, local=65, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L31] int local ; VAL [\old(E_1)=67, \old(E_M)=59, \old(local)=65, \old(M_E)=63, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=64, \old(t1_pc)=54, \old(t1_st)=51, \old(token)=68, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L477] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L481] CALL init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L392] m_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L393] t1_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L481] RET init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L482] CALL start_simulation() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L418] int kernel_st ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L419] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L420] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] kernel_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] FCALL update_channels() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] CALL init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L174] COND TRUE m_i == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L175] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L179] COND TRUE t1_i == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L180] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] RET init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L263] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L268] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L273] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L278] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L428] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L316] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L317] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L125] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L128] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L140] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L323] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L329] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L144] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L147] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L159] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L329] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L331] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L428] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L429] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L291] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L296] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L301] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L306] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L429] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L432] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] kernel_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL eval() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L210] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L214] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L189] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L192] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L193] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L205] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L219] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L224] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L225] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L226] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L227] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L238] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L239] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L240] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L241] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L243] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L244] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L92] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L105] t1_pc = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L106] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L244] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L214] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L217] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L189] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L192] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L193] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L205] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L217] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L217] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L219] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L224] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L225] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_2=1, token=0] [L226] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L227] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L229] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L230] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L34] int tmp_var = __VERIFIER_nondet_int(); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L36] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L47] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L50] token = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __VERIFIER_nondet_int()=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L51] local = token VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L52] E_1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L53] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L345] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L316] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L317] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L125] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L128] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L140] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L323] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L329] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L144] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L147] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L148] COND TRUE E_1 == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L149] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L159] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L329] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L329] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, tmp___0=1, token=0] [L331] COND TRUE \read(tmp___0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, tmp___0=1, token=0] [L332] t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L345] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L53] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L54] E_1 = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L55] m_pc = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L56] m_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L230] RET master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L238] COND TRUE t1_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L239] int tmp_ndt_2; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, token=0] [L240] tmp_ndt_2 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L241] COND TRUE \read(tmp_ndt_2) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L243] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L244] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L92] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L95] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L111] token += 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L113] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L345] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L316] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L317] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L125] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L128] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L129] COND TRUE E_M == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L130] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L140] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] tmp = is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L323] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L324] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L329] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L144] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L147] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L148] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L159] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L329] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L329] tmp___0 = is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L331] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L345] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L113] RET immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L114] E_M = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L105] t1_pc = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L106] t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L244] RET transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L214] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L217] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L189] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L192] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L193] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L205] return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L217] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L217] tmp = exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L219] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L224] COND TRUE m_st == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L225] int tmp_ndt_1; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_2=1, token=1] [L226] tmp_ndt_1 = __VERIFIER_nondet_int() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __VERIFIER_nondet_int()=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L227] COND TRUE \read(tmp_ndt_1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L229] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L230] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L34] int tmp_var = __VERIFIER_nondet_int(); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, __VERIFIER_nondet_int()=5, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L36] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L39] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L61] COND FALSE !(token != local + 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L66] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L67] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L72] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L73] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L74] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L75] CALL error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L12] reach_error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 239 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 66.0s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 53.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3278 SDtfs, 17714 SDslu, 1400 SDs, 0 SdLazy, 21053 SolverSat, 6331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 929 GetRequests, 536 SyntacticMatches, 2 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7214 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6363occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 7953 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2484 NumberOfCodeBlocks, 2484 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2201 ConstructedInterpolants, 0 QuantifiedInterpolants, 1114630 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 930/954 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...