/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 18:57:08,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 18:57:08,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 18:57:08,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 18:57:08,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 18:57:08,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 18:57:08,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 18:57:08,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 18:57:08,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 18:57:08,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 18:57:08,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 18:57:08,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 18:57:08,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 18:57:08,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 18:57:08,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 18:57:08,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 18:57:08,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 18:57:08,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 18:57:08,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 18:57:08,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 18:57:08,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 18:57:08,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 18:57:08,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 18:57:08,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 18:57:08,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 18:57:08,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 18:57:08,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 18:57:08,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 18:57:08,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 18:57:08,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 18:57:08,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 18:57:08,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 18:57:08,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 18:57:08,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 18:57:08,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 18:57:08,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 18:57:08,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 18:57:08,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 18:57:08,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 18:57:08,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 18:57:08,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 18:57:08,399 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-23 18:57:08,426 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 18:57:08,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 18:57:08,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-23 18:57:08,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-23 18:57:08,428 INFO L138 SettingsManager]: * Use SBE=true [2020-10-23 18:57:08,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 18:57:08,429 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 18:57:08,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 18:57:08,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 18:57:08,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 18:57:08,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 18:57:08,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 18:57:08,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 18:57:08,430 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 18:57:08,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 18:57:08,431 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 18:57:08,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 18:57:08,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 18:57:08,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-23 18:57:08,432 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 18:57:08,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 18:57:08,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 18:57:08,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 18:57:08,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-23 18:57:08,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-23 18:57:08,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-23 18:57:08,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-23 18:57:08,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 18:57:08,434 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-23 18:57:08,434 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2020-10-23 18:57:08,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 18:57:08,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 18:57:08,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 18:57:08,875 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 18:57:08,876 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 18:57:08,877 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-10-23 18:57:08,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e6ad9ab/9b9dfca44e95494da6b4ca234e774793/FLAG62ba3e470 [2020-10-23 18:57:09,696 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 18:57:09,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-2.c [2020-10-23 18:57:09,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e6ad9ab/9b9dfca44e95494da6b4ca234e774793/FLAG62ba3e470 [2020-10-23 18:57:10,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e6ad9ab/9b9dfca44e95494da6b4ca234e774793 [2020-10-23 18:57:10,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 18:57:10,021 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 18:57:10,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 18:57:10,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 18:57:10,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 18:57:10,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:57:10" (1/1) ... [2020-10-23 18:57:10,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ebe2121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:10, skipping insertion in model container [2020-10-23 18:57:10,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:57:10" (1/1) ... [2020-10-23 18:57:10,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 18:57:10,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 18:57:10,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:57:10,396 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 18:57:10,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:57:10,529 INFO L208 MainTranslator]: Completed translation [2020-10-23 18:57:10,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:10 WrapperNode [2020-10-23 18:57:10,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 18:57:10,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 18:57:10,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 18:57:10,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 18:57:10,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:10" (1/1) ... [2020-10-23 18:57:10,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:10" (1/1) ... [2020-10-23 18:57:10,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:10" (1/1) ... [2020-10-23 18:57:10,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:10" (1/1) ... [2020-10-23 18:57:10,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:10" (1/1) ... [2020-10-23 18:57:10,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:10" (1/1) ... [2020-10-23 18:57:10,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:10" (1/1) ... [2020-10-23 18:57:10,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 18:57:10,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 18:57:10,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 18:57:10,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 18:57:10,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 18:57:10,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 18:57:10,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 18:57:10,746 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 18:57:10,746 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-10-23 18:57:10,747 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-10-23 18:57:10,747 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-10-23 18:57:10,747 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-10-23 18:57:10,747 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-10-23 18:57:10,747 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-10-23 18:57:10,747 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-10-23 18:57:10,748 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-10-23 18:57:10,748 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-10-23 18:57:10,748 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-10-23 18:57:10,748 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-10-23 18:57:10,748 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-10-23 18:57:10,748 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-10-23 18:57:10,749 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-10-23 18:57:10,749 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-10-23 18:57:10,749 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-10-23 18:57:10,749 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-10-23 18:57:10,749 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-10-23 18:57:10,750 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-10-23 18:57:10,750 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-10-23 18:57:10,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 18:57:10,750 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 18:57:10,750 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 18:57:10,751 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 18:57:10,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 18:57:10,751 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-10-23 18:57:10,751 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-10-23 18:57:10,751 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-10-23 18:57:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-10-23 18:57:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-10-23 18:57:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 18:57:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-10-23 18:57:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-10-23 18:57:10,753 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-10-23 18:57:10,753 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-10-23 18:57:10,753 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-10-23 18:57:10,753 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-10-23 18:57:10,753 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-10-23 18:57:10,754 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-10-23 18:57:10,754 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-10-23 18:57:10,754 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-10-23 18:57:10,754 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-10-23 18:57:10,754 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-10-23 18:57:10,755 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-10-23 18:57:10,755 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-10-23 18:57:10,755 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-10-23 18:57:10,755 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 18:57:10,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 18:57:10,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 18:57:10,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 18:57:10,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 18:57:10,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 18:57:10,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 18:57:11,484 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 18:57:11,484 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-10-23 18:57:11,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:57:11 BoogieIcfgContainer [2020-10-23 18:57:11,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 18:57:11,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 18:57:11,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 18:57:11,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 18:57:11,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:57:10" (1/3) ... [2020-10-23 18:57:11,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293efce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:57:11, skipping insertion in model container [2020-10-23 18:57:11,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:10" (2/3) ... [2020-10-23 18:57:11,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293efce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:57:11, skipping insertion in model container [2020-10-23 18:57:11,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:57:11" (3/3) ... [2020-10-23 18:57:11,502 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-10-23 18:57:11,513 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-23 18:57:11,520 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 18:57:11,534 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 18:57:11,563 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 18:57:11,563 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 18:57:11,563 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-23 18:57:11,564 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 18:57:11,564 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 18:57:11,564 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 18:57:11,564 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 18:57:11,564 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 18:57:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states. [2020-10-23 18:57:11,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 18:57:11,598 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:11,599 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] [2020-10-23 18:57:11,600 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:11,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:11,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1589352767, now seen corresponding path program 1 times [2020-10-23 18:57:11,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:11,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483586725] [2020-10-23 18:57:11,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:12,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:12,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:12,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:12,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:12,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:12,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:57:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:12,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:12,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:12,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:12,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:12,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:57:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:12,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483586725] [2020-10-23 18:57:12,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:12,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:57:12,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949386191] [2020-10-23 18:57:12,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:57:12,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:12,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:57:12,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:57:12,456 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 8 states. [2020-10-23 18:57:15,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:15,310 INFO L93 Difference]: Finished difference Result 663 states and 1033 transitions. [2020-10-23 18:57:15,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-23 18:57:15,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2020-10-23 18:57:15,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:15,346 INFO L225 Difference]: With dead ends: 663 [2020-10-23 18:57:15,346 INFO L226 Difference]: Without dead ends: 479 [2020-10-23 18:57:15,353 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2020-10-23 18:57:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2020-10-23 18:57:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 319. [2020-10-23 18:57:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2020-10-23 18:57:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 442 transitions. [2020-10-23 18:57:15,531 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 442 transitions. Word has length 93 [2020-10-23 18:57:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:15,533 INFO L481 AbstractCegarLoop]: Abstraction has 319 states and 442 transitions. [2020-10-23 18:57:15,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:57:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 442 transitions. [2020-10-23 18:57:15,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 18:57:15,550 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:15,551 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] [2020-10-23 18:57:15,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 18:57:15,552 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:15,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:15,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1323601987, now seen corresponding path program 1 times [2020-10-23 18:57:15,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:15,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603767403] [2020-10-23 18:57:15,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:57:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:57:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:16,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603767403] [2020-10-23 18:57:16,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:16,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:57:16,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454950385] [2020-10-23 18:57:16,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:57:16,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:16,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:57:16,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:57:16,020 INFO L87 Difference]: Start difference. First operand 319 states and 442 transitions. Second operand 9 states. [2020-10-23 18:57:16,485 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2020-10-23 18:57:18,542 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2020-10-23 18:57:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:21,532 INFO L93 Difference]: Finished difference Result 1218 states and 1775 transitions. [2020-10-23 18:57:21,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 18:57:21,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2020-10-23 18:57:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:21,544 INFO L225 Difference]: With dead ends: 1218 [2020-10-23 18:57:21,544 INFO L226 Difference]: Without dead ends: 919 [2020-10-23 18:57:21,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2020-10-23 18:57:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2020-10-23 18:57:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 615. [2020-10-23 18:57:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2020-10-23 18:57:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 859 transitions. [2020-10-23 18:57:21,664 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 859 transitions. Word has length 93 [2020-10-23 18:57:21,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:21,664 INFO L481 AbstractCegarLoop]: Abstraction has 615 states and 859 transitions. [2020-10-23 18:57:21,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:57:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 859 transitions. [2020-10-23 18:57:21,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 18:57:21,667 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:21,667 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] [2020-10-23 18:57:21,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 18:57:21,667 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1062907519, now seen corresponding path program 1 times [2020-10-23 18:57:21,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:21,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856994806] [2020-10-23 18:57:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:21,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:21,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:21,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:21,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:21,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:21,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:57:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:21,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:21,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:21,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:21,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:21,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:57:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:21,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856994806] [2020-10-23 18:57:21,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:21,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:21,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699639577] [2020-10-23 18:57:21,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:21,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:21,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:21,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:21,942 INFO L87 Difference]: Start difference. First operand 615 states and 859 transitions. Second operand 10 states. [2020-10-23 18:57:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:24,903 INFO L93 Difference]: Finished difference Result 1718 states and 2559 transitions. [2020-10-23 18:57:24,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 18:57:24,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2020-10-23 18:57:24,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:24,920 INFO L225 Difference]: With dead ends: 1718 [2020-10-23 18:57:24,921 INFO L226 Difference]: Without dead ends: 1124 [2020-10-23 18:57:24,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-10-23 18:57:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2020-10-23 18:57:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 759. [2020-10-23 18:57:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2020-10-23 18:57:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1018 transitions. [2020-10-23 18:57:25,070 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1018 transitions. Word has length 93 [2020-10-23 18:57:25,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:25,071 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 1018 transitions. [2020-10-23 18:57:25,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:25,071 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1018 transitions. [2020-10-23 18:57:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 18:57:25,073 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:25,073 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] [2020-10-23 18:57:25,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 18:57:25,074 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:25,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:25,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1649771266, now seen corresponding path program 1 times [2020-10-23 18:57:25,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:25,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267924744] [2020-10-23 18:57:25,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:57:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:57:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:25,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267924744] [2020-10-23 18:57:25,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:25,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:57:25,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484915127] [2020-10-23 18:57:25,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:57:25,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:25,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:57:25,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:57:25,326 INFO L87 Difference]: Start difference. First operand 759 states and 1018 transitions. Second operand 9 states. [2020-10-23 18:57:25,709 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-23 18:57:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:30,556 INFO L93 Difference]: Finished difference Result 2625 states and 3670 transitions. [2020-10-23 18:57:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 18:57:30,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2020-10-23 18:57:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:30,571 INFO L225 Difference]: With dead ends: 2625 [2020-10-23 18:57:30,572 INFO L226 Difference]: Without dead ends: 2075 [2020-10-23 18:57:30,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2020-10-23 18:57:30,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2020-10-23 18:57:30,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 1518. [2020-10-23 18:57:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1518 states. [2020-10-23 18:57:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 2049 transitions. [2020-10-23 18:57:30,797 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 2049 transitions. Word has length 93 [2020-10-23 18:57:30,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:30,797 INFO L481 AbstractCegarLoop]: Abstraction has 1518 states and 2049 transitions. [2020-10-23 18:57:30,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:57:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 2049 transitions. [2020-10-23 18:57:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 18:57:30,802 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:30,802 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] [2020-10-23 18:57:30,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 18:57:30,802 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:30,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:30,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1429042304, now seen corresponding path program 1 times [2020-10-23 18:57:30,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:30,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330911437] [2020-10-23 18:57:30,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:30,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:30,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:30,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:30,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:30,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:57:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:57:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:31,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330911437] [2020-10-23 18:57:31,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:31,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:57:31,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380787534] [2020-10-23 18:57:31,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:57:31,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:31,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:57:31,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:57:31,054 INFO L87 Difference]: Start difference. First operand 1518 states and 2049 transitions. Second operand 9 states. [2020-10-23 18:57:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:36,127 INFO L93 Difference]: Finished difference Result 5332 states and 7479 transitions. [2020-10-23 18:57:36,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 18:57:36,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2020-10-23 18:57:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:36,154 INFO L225 Difference]: With dead ends: 5332 [2020-10-23 18:57:36,154 INFO L226 Difference]: Without dead ends: 4143 [2020-10-23 18:57:36,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2020-10-23 18:57:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4143 states. [2020-10-23 18:57:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4143 to 3188. [2020-10-23 18:57:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2020-10-23 18:57:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 4372 transitions. [2020-10-23 18:57:36,558 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 4372 transitions. Word has length 93 [2020-10-23 18:57:36,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:36,559 INFO L481 AbstractCegarLoop]: Abstraction has 3188 states and 4372 transitions. [2020-10-23 18:57:36,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:57:36,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 4372 transitions. [2020-10-23 18:57:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 18:57:36,561 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:36,562 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] [2020-10-23 18:57:36,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 18:57:36,562 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:36,563 INFO L82 PathProgramCache]: Analyzing trace with hash 697074878, now seen corresponding path program 1 times [2020-10-23 18:57:36,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:36,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696718457] [2020-10-23 18:57:36,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:57:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:57:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:36,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696718457] [2020-10-23 18:57:36,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:36,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:36,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552705590] [2020-10-23 18:57:36,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:36,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:36,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:36,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:36,825 INFO L87 Difference]: Start difference. First operand 3188 states and 4372 transitions. Second operand 10 states. [2020-10-23 18:57:37,478 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-23 18:57:39,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:39,867 INFO L93 Difference]: Finished difference Result 7242 states and 10275 transitions. [2020-10-23 18:57:39,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 18:57:39,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2020-10-23 18:57:39,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:39,893 INFO L225 Difference]: With dead ends: 7242 [2020-10-23 18:57:39,893 INFO L226 Difference]: Without dead ends: 4076 [2020-10-23 18:57:39,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-10-23 18:57:39,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2020-10-23 18:57:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3303. [2020-10-23 18:57:40,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3303 states. [2020-10-23 18:57:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 4470 transitions. [2020-10-23 18:57:40,349 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 4470 transitions. Word has length 93 [2020-10-23 18:57:40,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:40,349 INFO L481 AbstractCegarLoop]: Abstraction has 3303 states and 4470 transitions. [2020-10-23 18:57:40,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 4470 transitions. [2020-10-23 18:57:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 18:57:40,353 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:40,353 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] [2020-10-23 18:57:40,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 18:57:40,353 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1140975552, now seen corresponding path program 1 times [2020-10-23 18:57:40,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:40,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296432736] [2020-10-23 18:57:40,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:40,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:40,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:40,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:40,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:40,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:40,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:57:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:40,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:40,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:40,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:40,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:40,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:57:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:40,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296432736] [2020-10-23 18:57:40,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:40,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:40,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160656710] [2020-10-23 18:57:40,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:40,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:40,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:40,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:40,619 INFO L87 Difference]: Start difference. First operand 3303 states and 4470 transitions. Second operand 10 states. [2020-10-23 18:57:43,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:43,701 INFO L93 Difference]: Finished difference Result 7545 states and 10537 transitions. [2020-10-23 18:57:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 18:57:43,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2020-10-23 18:57:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:43,724 INFO L225 Difference]: With dead ends: 7545 [2020-10-23 18:57:43,724 INFO L226 Difference]: Without dead ends: 4264 [2020-10-23 18:57:43,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:57:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4264 states. [2020-10-23 18:57:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4264 to 3463. [2020-10-23 18:57:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3463 states. [2020-10-23 18:57:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 4622 transitions. [2020-10-23 18:57:44,136 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 4622 transitions. Word has length 93 [2020-10-23 18:57:44,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:44,136 INFO L481 AbstractCegarLoop]: Abstraction has 3463 states and 4622 transitions. [2020-10-23 18:57:44,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:44,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 4622 transitions. [2020-10-23 18:57:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 18:57:44,139 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:44,139 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] [2020-10-23 18:57:44,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 18:57:44,139 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:44,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:44,140 INFO L82 PathProgramCache]: Analyzing trace with hash -908412290, now seen corresponding path program 1 times [2020-10-23 18:57:44,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:44,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243199885] [2020-10-23 18:57:44,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:44,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:44,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:44,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:44,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:44,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:44,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:57:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:44,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:44,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:44,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:44,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:44,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:57:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:44,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:44,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243199885] [2020-10-23 18:57:44,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:44,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:57:44,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368566565] [2020-10-23 18:57:44,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:57:44,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:44,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:57:44,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:57:44,354 INFO L87 Difference]: Start difference. First operand 3463 states and 4622 transitions. Second operand 8 states. [2020-10-23 18:57:44,483 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-23 18:57:48,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:48,284 INFO L93 Difference]: Finished difference Result 9713 states and 13455 transitions. [2020-10-23 18:57:48,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 18:57:48,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2020-10-23 18:57:48,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:48,317 INFO L225 Difference]: With dead ends: 9713 [2020-10-23 18:57:48,317 INFO L226 Difference]: Without dead ends: 6272 [2020-10-23 18:57:48,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-10-23 18:57:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6272 states. [2020-10-23 18:57:48,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6272 to 5368. [2020-10-23 18:57:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5368 states. [2020-10-23 18:57:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7229 transitions. [2020-10-23 18:57:48,980 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 7229 transitions. Word has length 93 [2020-10-23 18:57:48,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:48,981 INFO L481 AbstractCegarLoop]: Abstraction has 5368 states and 7229 transitions. [2020-10-23 18:57:48,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:57:48,981 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 7229 transitions. [2020-10-23 18:57:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 18:57:48,984 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:48,984 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] [2020-10-23 18:57:48,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 18:57:48,984 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:48,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1393587009, now seen corresponding path program 1 times [2020-10-23 18:57:48,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:48,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476100934] [2020-10-23 18:57:48,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:57:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:57:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:49,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476100934] [2020-10-23 18:57:49,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:49,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:49,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492308798] [2020-10-23 18:57:49,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:49,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:49,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:49,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:49,250 INFO L87 Difference]: Start difference. First operand 5368 states and 7229 transitions. Second operand 10 states. [2020-10-23 18:57:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:52,171 INFO L93 Difference]: Finished difference Result 11849 states and 16441 transitions. [2020-10-23 18:57:52,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 18:57:52,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2020-10-23 18:57:52,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:52,207 INFO L225 Difference]: With dead ends: 11849 [2020-10-23 18:57:52,208 INFO L226 Difference]: Without dead ends: 6503 [2020-10-23 18:57:52,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:57:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6503 states. [2020-10-23 18:57:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6503 to 5528. [2020-10-23 18:57:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5528 states. [2020-10-23 18:57:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5528 states to 5528 states and 7366 transitions. [2020-10-23 18:57:52,781 INFO L78 Accepts]: Start accepts. Automaton has 5528 states and 7366 transitions. Word has length 93 [2020-10-23 18:57:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:52,781 INFO L481 AbstractCegarLoop]: Abstraction has 5528 states and 7366 transitions. [2020-10-23 18:57:52,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 5528 states and 7366 transitions. [2020-10-23 18:57:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 18:57:52,784 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:52,784 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] [2020-10-23 18:57:52,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 18:57:52,785 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:52,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:52,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2057374785, now seen corresponding path program 1 times [2020-10-23 18:57:52,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:52,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652729765] [2020-10-23 18:57:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:52,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:52,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:52,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:52,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:52,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:52,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:57:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:52,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:52,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:52,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:52,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:53,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:57:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:53,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652729765] [2020-10-23 18:57:53,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:53,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:53,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065853648] [2020-10-23 18:57:53,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:53,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:53,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:53,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:53,031 INFO L87 Difference]: Start difference. First operand 5528 states and 7366 transitions. Second operand 10 states. [2020-10-23 18:57:53,965 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2020-10-23 18:57:56,045 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2020-10-23 18:57:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:57,587 INFO L93 Difference]: Finished difference Result 7213 states and 9696 transitions. [2020-10-23 18:57:57,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-23 18:57:57,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2020-10-23 18:57:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:57,604 INFO L225 Difference]: With dead ends: 7213 [2020-10-23 18:57:57,604 INFO L226 Difference]: Without dead ends: 4741 [2020-10-23 18:57:57,611 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2020-10-23 18:57:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4741 states. [2020-10-23 18:57:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4741 to 3887. [2020-10-23 18:57:58,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3887 states. [2020-10-23 18:57:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3887 states to 3887 states and 5074 transitions. [2020-10-23 18:57:58,105 INFO L78 Accepts]: Start accepts. Automaton has 3887 states and 5074 transitions. Word has length 93 [2020-10-23 18:57:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:58,105 INFO L481 AbstractCegarLoop]: Abstraction has 3887 states and 5074 transitions. [2020-10-23 18:57:58,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3887 states and 5074 transitions. [2020-10-23 18:57:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 18:57:58,107 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:58,107 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] [2020-10-23 18:57:58,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 18:57:58,108 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:58,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:58,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2080007039, now seen corresponding path program 1 times [2020-10-23 18:57:58,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:58,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344677503] [2020-10-23 18:57:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:58,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:58,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:58,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:58,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:58,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:57:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:58,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:57:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:58,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:58,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:58,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:57:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:58,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:57:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:58,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:57:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:58,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344677503] [2020-10-23 18:57:58,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:58,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:58,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344505555] [2020-10-23 18:57:58,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:58,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:58,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:58,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:58,391 INFO L87 Difference]: Start difference. First operand 3887 states and 5074 transitions. Second operand 10 states. [2020-10-23 18:57:59,303 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2020-10-23 18:57:59,489 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2020-10-23 18:58:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:03,188 INFO L93 Difference]: Finished difference Result 9695 states and 12965 transitions. [2020-10-23 18:58:03,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-23 18:58:03,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2020-10-23 18:58:03,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:03,215 INFO L225 Difference]: With dead ends: 9695 [2020-10-23 18:58:03,215 INFO L226 Difference]: Without dead ends: 6919 [2020-10-23 18:58:03,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2020-10-23 18:58:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6919 states. [2020-10-23 18:58:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6919 to 5765. [2020-10-23 18:58:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2020-10-23 18:58:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 7557 transitions. [2020-10-23 18:58:04,051 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 7557 transitions. Word has length 93 [2020-10-23 18:58:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:04,051 INFO L481 AbstractCegarLoop]: Abstraction has 5765 states and 7557 transitions. [2020-10-23 18:58:04,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:58:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 7557 transitions. [2020-10-23 18:58:04,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 18:58:04,054 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:04,054 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] [2020-10-23 18:58:04,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 18:58:04,054 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:04,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:04,055 INFO L82 PathProgramCache]: Analyzing trace with hash -828756863, now seen corresponding path program 1 times [2020-10-23 18:58:04,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:04,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683122229] [2020-10-23 18:58:04,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:04,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:04,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:04,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:04,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:04,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:04,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:58:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:04,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:04,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:04,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:04,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:58:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:04,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:58:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:58:04,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683122229] [2020-10-23 18:58:04,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:58:04,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:58:04,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568369651] [2020-10-23 18:58:04,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:58:04,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:04,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:58:04,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:58:04,305 INFO L87 Difference]: Start difference. First operand 5765 states and 7557 transitions. Second operand 10 states. [2020-10-23 18:58:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:08,483 INFO L93 Difference]: Finished difference Result 11928 states and 16115 transitions. [2020-10-23 18:58:08,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-23 18:58:08,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2020-10-23 18:58:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:08,512 INFO L225 Difference]: With dead ends: 11928 [2020-10-23 18:58:08,512 INFO L226 Difference]: Without dead ends: 6276 [2020-10-23 18:58:08,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2020-10-23 18:58:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6276 states. [2020-10-23 18:58:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6276 to 5025. [2020-10-23 18:58:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5025 states. [2020-10-23 18:58:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 5025 states and 6604 transitions. [2020-10-23 18:58:09,156 INFO L78 Accepts]: Start accepts. Automaton has 5025 states and 6604 transitions. Word has length 93 [2020-10-23 18:58:09,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:09,157 INFO L481 AbstractCegarLoop]: Abstraction has 5025 states and 6604 transitions. [2020-10-23 18:58:09,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:58:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5025 states and 6604 transitions. [2020-10-23 18:58:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 18:58:09,159 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:09,159 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] [2020-10-23 18:58:09,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 18:58:09,159 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:09,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1094471171, now seen corresponding path program 1 times [2020-10-23 18:58:09,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:09,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402652067] [2020-10-23 18:58:09,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:58:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:58:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:58:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:58:09,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402652067] [2020-10-23 18:58:09,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:58:09,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:58:09,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402997905] [2020-10-23 18:58:09,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:58:09,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:09,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:58:09,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:58:09,462 INFO L87 Difference]: Start difference. First operand 5025 states and 6604 transitions. Second operand 10 states. [2020-10-23 18:58:09,602 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-23 18:58:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:13,830 INFO L93 Difference]: Finished difference Result 9733 states and 13089 transitions. [2020-10-23 18:58:13,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-23 18:58:13,831 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2020-10-23 18:58:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:13,848 INFO L225 Difference]: With dead ends: 9733 [2020-10-23 18:58:13,849 INFO L226 Difference]: Without dead ends: 5556 [2020-10-23 18:58:13,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2020-10-23 18:58:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5556 states. [2020-10-23 18:58:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5556 to 4475. [2020-10-23 18:58:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4475 states. [2020-10-23 18:58:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4475 states to 4475 states and 5842 transitions. [2020-10-23 18:58:14,459 INFO L78 Accepts]: Start accepts. Automaton has 4475 states and 5842 transitions. Word has length 93 [2020-10-23 18:58:14,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:14,459 INFO L481 AbstractCegarLoop]: Abstraction has 4475 states and 5842 transitions. [2020-10-23 18:58:14,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:58:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 4475 states and 5842 transitions. [2020-10-23 18:58:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-23 18:58:14,461 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:14,461 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] [2020-10-23 18:58:14,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 18:58:14,461 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:14,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:14,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1156510785, now seen corresponding path program 1 times [2020-10-23 18:58:14,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:14,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768424763] [2020-10-23 18:58:14,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:14,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:14,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:14,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:14,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:14,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:14,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:58:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:14,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:14,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:14,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:14,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:58:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:14,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:58:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:58:14,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768424763] [2020-10-23 18:58:14,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:58:14,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 18:58:14,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857373442] [2020-10-23 18:58:14,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 18:58:14,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:14,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 18:58:14,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-23 18:58:14,679 INFO L87 Difference]: Start difference. First operand 4475 states and 5842 transitions. Second operand 7 states. [2020-10-23 18:58:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:17,662 INFO L93 Difference]: Finished difference Result 12787 states and 17736 transitions. [2020-10-23 18:58:17,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 18:58:17,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2020-10-23 18:58:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:17,687 INFO L225 Difference]: With dead ends: 12787 [2020-10-23 18:58:17,687 INFO L226 Difference]: Without dead ends: 8357 [2020-10-23 18:58:17,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:58:17,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8357 states. [2020-10-23 18:58:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8357 to 7128. [2020-10-23 18:58:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7128 states. [2020-10-23 18:58:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7128 states to 7128 states and 9601 transitions. [2020-10-23 18:58:18,534 INFO L78 Accepts]: Start accepts. Automaton has 7128 states and 9601 transitions. Word has length 93 [2020-10-23 18:58:18,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:18,535 INFO L481 AbstractCegarLoop]: Abstraction has 7128 states and 9601 transitions. [2020-10-23 18:58:18,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 18:58:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 7128 states and 9601 transitions. [2020-10-23 18:58:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-10-23 18:58:18,539 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:18,540 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:58:18,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 18:58:18,541 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:18,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:18,541 INFO L82 PathProgramCache]: Analyzing trace with hash -143423858, now seen corresponding path program 1 times [2020-10-23 18:58:18,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:18,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229508446] [2020-10-23 18:58:18,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:58:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:58:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:58:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-23 18:58:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:58:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2020-10-23 18:58:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-10-23 18:58:18,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229508446] [2020-10-23 18:58:18,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:58:18,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:58:18,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735223631] [2020-10-23 18:58:18,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:58:18,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:18,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:58:18,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:58:18,893 INFO L87 Difference]: Start difference. First operand 7128 states and 9601 transitions. Second operand 10 states. [2020-10-23 18:58:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:24,107 INFO L93 Difference]: Finished difference Result 24995 states and 38105 transitions. [2020-10-23 18:58:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-23 18:58:24,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 148 [2020-10-23 18:58:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:24,180 INFO L225 Difference]: With dead ends: 24995 [2020-10-23 18:58:24,181 INFO L226 Difference]: Without dead ends: 17978 [2020-10-23 18:58:24,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2020-10-23 18:58:24,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17978 states. [2020-10-23 18:58:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17978 to 14731. [2020-10-23 18:58:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14731 states. [2020-10-23 18:58:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14731 states to 14731 states and 20933 transitions. [2020-10-23 18:58:25,994 INFO L78 Accepts]: Start accepts. Automaton has 14731 states and 20933 transitions. Word has length 148 [2020-10-23 18:58:25,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:25,994 INFO L481 AbstractCegarLoop]: Abstraction has 14731 states and 20933 transitions. [2020-10-23 18:58:25,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:58:25,994 INFO L276 IsEmpty]: Start isEmpty. Operand 14731 states and 20933 transitions. [2020-10-23 18:58:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2020-10-23 18:58:26,004 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:26,005 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-23 18:58:26,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-23 18:58:26,005 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:26,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:26,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1574851082, now seen corresponding path program 1 times [2020-10-23 18:58:26,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:26,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593646181] [2020-10-23 18:58:26,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:58:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:58:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:58:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-10-23 18:58:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-10-23 18:58:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-10-23 18:58:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:58:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-10-23 18:58:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2020-10-23 18:58:26,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593646181] [2020-10-23 18:58:26,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571061508] [2020-10-23 18:58:26,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:58:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:26,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-23 18:58:26,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:58:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-23 18:58:26,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:58:26,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2020-10-23 18:58:26,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464753731] [2020-10-23 18:58:26,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:58:26,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:26,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:58:26,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:58:26,580 INFO L87 Difference]: Start difference. First operand 14731 states and 20933 transitions. Second operand 3 states. [2020-10-23 18:58:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:29,796 INFO L93 Difference]: Finished difference Result 39060 states and 57406 transitions. [2020-10-23 18:58:29,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:58:29,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2020-10-23 18:58:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:29,855 INFO L225 Difference]: With dead ends: 39060 [2020-10-23 18:58:29,856 INFO L226 Difference]: Without dead ends: 16589 [2020-10-23 18:58:29,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:58:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16589 states. [2020-10-23 18:58:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16589 to 16391. [2020-10-23 18:58:31,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16391 states. [2020-10-23 18:58:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16391 states to 16391 states and 22890 transitions. [2020-10-23 18:58:31,801 INFO L78 Accepts]: Start accepts. Automaton has 16391 states and 22890 transitions. Word has length 167 [2020-10-23 18:58:31,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:31,802 INFO L481 AbstractCegarLoop]: Abstraction has 16391 states and 22890 transitions. [2020-10-23 18:58:31,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:58:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 16391 states and 22890 transitions. [2020-10-23 18:58:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-10-23 18:58:31,827 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:31,827 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, 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] [2020-10-23 18:58:32,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-10-23 18:58:32,045 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:32,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1235837077, now seen corresponding path program 1 times [2020-10-23 18:58:32,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:32,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274558558] [2020-10-23 18:58:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:58:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:58:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:58:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-10-23 18:58:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-10-23 18:58:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-10-23 18:58:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-10-23 18:58:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:58:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-10-23 18:58:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:58:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2020-10-23 18:58:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2020-10-23 18:58:32,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274558558] [2020-10-23 18:58:32,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889908231] [2020-10-23 18:58:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:58:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:32,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-23 18:58:32,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:58:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-23 18:58:32,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:58:32,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-10-23 18:58:32,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403050352] [2020-10-23 18:58:32,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:58:32,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:32,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:58:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:58:32,780 INFO L87 Difference]: Start difference. First operand 16391 states and 22890 transitions. Second operand 3 states. [2020-10-23 18:58:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:35,125 INFO L93 Difference]: Finished difference Result 33870 states and 48617 transitions. [2020-10-23 18:58:35,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:58:35,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2020-10-23 18:58:35,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:35,198 INFO L225 Difference]: With dead ends: 33870 [2020-10-23 18:58:35,198 INFO L226 Difference]: Without dead ends: 17693 [2020-10-23 18:58:35,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:58:35,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17693 states. [2020-10-23 18:58:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17693 to 17635. [2020-10-23 18:58:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17635 states. [2020-10-23 18:58:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17635 states to 17635 states and 23821 transitions. [2020-10-23 18:58:37,367 INFO L78 Accepts]: Start accepts. Automaton has 17635 states and 23821 transitions. Word has length 218 [2020-10-23 18:58:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:37,367 INFO L481 AbstractCegarLoop]: Abstraction has 17635 states and 23821 transitions. [2020-10-23 18:58:37,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:58:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 17635 states and 23821 transitions. [2020-10-23 18:58:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-10-23 18:58:37,390 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:37,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:58:37,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-10-23 18:58:37,605 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:37,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:37,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1051253760, now seen corresponding path program 1 times [2020-10-23 18:58:37,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:37,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231756155] [2020-10-23 18:58:37,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:58:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:58:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:58:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-23 18:58:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-23 18:58:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-10-23 18:58:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-10-23 18:58:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:58:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-10-23 18:58:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:58:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2020-10-23 18:58:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 36 proven. 13 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-10-23 18:58:37,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231756155] [2020-10-23 18:58:37,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343040023] [2020-10-23 18:58:37,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:58:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:38,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-23 18:58:38,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:58:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-23 18:58:38,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:58:38,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-10-23 18:58:38,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560497409] [2020-10-23 18:58:38,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:58:38,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:38,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:58:38,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:58:38,361 INFO L87 Difference]: Start difference. First operand 17635 states and 23821 transitions. Second operand 3 states. [2020-10-23 18:58:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:41,192 INFO L93 Difference]: Finished difference Result 43477 states and 62726 transitions. [2020-10-23 18:58:41,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:58:41,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2020-10-23 18:58:41,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:41,288 INFO L225 Difference]: With dead ends: 43477 [2020-10-23 18:58:41,288 INFO L226 Difference]: Without dead ends: 26000 [2020-10-23 18:58:41,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:58:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26000 states. [2020-10-23 18:58:44,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26000 to 25886. [2020-10-23 18:58:44,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25886 states. [2020-10-23 18:58:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25886 states to 25886 states and 35126 transitions. [2020-10-23 18:58:44,282 INFO L78 Accepts]: Start accepts. Automaton has 25886 states and 35126 transitions. Word has length 219 [2020-10-23 18:58:44,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:44,283 INFO L481 AbstractCegarLoop]: Abstraction has 25886 states and 35126 transitions. [2020-10-23 18:58:44,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:58:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand 25886 states and 35126 transitions. [2020-10-23 18:58:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-10-23 18:58:44,316 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:44,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:58:44,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-23 18:58:44,529 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:44,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:44,530 INFO L82 PathProgramCache]: Analyzing trace with hash 555289778, now seen corresponding path program 1 times [2020-10-23 18:58:44,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:44,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336512154] [2020-10-23 18:58:44,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:58:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:58:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:58:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-23 18:58:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-23 18:58:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 18:58:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:58:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2020-10-23 18:58:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:58:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2020-10-23 18:58:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-10-23 18:58:44,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336512154] [2020-10-23 18:58:44,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:58:44,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 18:58:44,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146647540] [2020-10-23 18:58:44,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:58:44,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:44,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:58:44,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:58:44,923 INFO L87 Difference]: Start difference. First operand 25886 states and 35126 transitions. Second operand 12 states. [2020-10-23 18:58:45,098 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-23 18:58:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:51,759 INFO L93 Difference]: Finished difference Result 50274 states and 71469 transitions. [2020-10-23 18:58:51,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-23 18:58:51,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 212 [2020-10-23 18:58:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:51,828 INFO L225 Difference]: With dead ends: 50274 [2020-10-23 18:58:51,829 INFO L226 Difference]: Without dead ends: 24521 [2020-10-23 18:58:51,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2020-10-23 18:58:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24521 states. [2020-10-23 18:58:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24521 to 22064. [2020-10-23 18:58:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22064 states. [2020-10-23 18:58:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22064 states to 22064 states and 28990 transitions. [2020-10-23 18:58:54,337 INFO L78 Accepts]: Start accepts. Automaton has 22064 states and 28990 transitions. Word has length 212 [2020-10-23 18:58:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:58:54,338 INFO L481 AbstractCegarLoop]: Abstraction has 22064 states and 28990 transitions. [2020-10-23 18:58:54,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:58:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 22064 states and 28990 transitions. [2020-10-23 18:58:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-10-23 18:58:54,357 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:58:54,358 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, 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] [2020-10-23 18:58:54,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-23 18:58:54,358 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:58:54,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:58:54,359 INFO L82 PathProgramCache]: Analyzing trace with hash 111438820, now seen corresponding path program 1 times [2020-10-23 18:58:54,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:58:54,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979380293] [2020-10-23 18:58:54,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:58:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:58:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:58:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:58:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:58:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:58:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:58:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:58:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-23 18:58:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:58:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2020-10-23 18:58:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2020-10-23 18:58:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-10-23 18:58:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:58:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:58:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:58:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:58:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:58:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2020-10-23 18:58:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-10-23 18:58:54,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979380293] [2020-10-23 18:58:54,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744460885] [2020-10-23 18:58:54,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:58:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:58:54,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-23 18:58:54,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:58:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-23 18:58:55,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:58:55,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-10-23 18:58:55,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906678038] [2020-10-23 18:58:55,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:58:55,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:58:55,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:58:55,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:58:55,132 INFO L87 Difference]: Start difference. First operand 22064 states and 28990 transitions. Second operand 3 states. [2020-10-23 18:58:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:58:59,565 INFO L93 Difference]: Finished difference Result 50237 states and 68997 transitions. [2020-10-23 18:58:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:58:59,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2020-10-23 18:58:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:58:59,705 INFO L225 Difference]: With dead ends: 50237 [2020-10-23 18:58:59,706 INFO L226 Difference]: Without dead ends: 23233 [2020-10-23 18:58:59,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:58:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23233 states. [2020-10-23 18:59:03,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23233 to 23228. [2020-10-23 18:59:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23228 states. [2020-10-23 18:59:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23228 states to 23228 states and 31273 transitions. [2020-10-23 18:59:03,746 INFO L78 Accepts]: Start accepts. Automaton has 23228 states and 31273 transitions. Word has length 215 [2020-10-23 18:59:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:59:03,746 INFO L481 AbstractCegarLoop]: Abstraction has 23228 states and 31273 transitions. [2020-10-23 18:59:03,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:59:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 23228 states and 31273 transitions. [2020-10-23 18:59:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2020-10-23 18:59:03,823 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:59:03,823 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:59:04,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:59:04,038 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:59:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:59:04,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1650865250, now seen corresponding path program 1 times [2020-10-23 18:59:04,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:59:04,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238350617] [2020-10-23 18:59:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:59:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:59:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:59:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:59:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:59:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:59:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:59:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:59:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-10-23 18:59:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:59:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-10-23 18:59:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:59:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-10-23 18:59:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-10-23 18:59:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2020-10-23 18:59:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:59:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-10-23 18:59:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2020-10-23 18:59:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2020-10-23 18:59:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2020-10-23 18:59:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2020-10-23 18:59:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:59:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:59:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2020-10-23 18:59:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:59:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-23 18:59:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:59:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2020-10-23 18:59:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:59:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:59:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2020-10-23 18:59:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2020-10-23 18:59:04,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238350617] [2020-10-23 18:59:04,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724269068] [2020-10-23 18:59:04,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:59:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:04,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 1429 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-23 18:59:04,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:59:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2020-10-23 18:59:04,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:59:04,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2020-10-23 18:59:04,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439214951] [2020-10-23 18:59:04,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:59:04,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:59:04,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:59:04,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:59:04,802 INFO L87 Difference]: Start difference. First operand 23228 states and 31273 transitions. Second operand 3 states. [2020-10-23 18:59:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:59:06,957 INFO L93 Difference]: Finished difference Result 43874 states and 62479 transitions. [2020-10-23 18:59:06,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:59:06,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2020-10-23 18:59:06,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:59:07,075 INFO L225 Difference]: With dead ends: 43874 [2020-10-23 18:59:07,075 INFO L226 Difference]: Without dead ends: 22237 [2020-10-23 18:59:07,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 433 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:59:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22237 states. [2020-10-23 18:59:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22237 to 22237. [2020-10-23 18:59:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22237 states. [2020-10-23 18:59:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22237 states to 22237 states and 29457 transitions. [2020-10-23 18:59:10,292 INFO L78 Accepts]: Start accepts. Automaton has 22237 states and 29457 transitions. Word has length 353 [2020-10-23 18:59:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:59:10,293 INFO L481 AbstractCegarLoop]: Abstraction has 22237 states and 29457 transitions. [2020-10-23 18:59:10,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:59:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 22237 states and 29457 transitions. [2020-10-23 18:59:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2020-10-23 18:59:10,327 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:59:10,327 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:59:10,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-10-23 18:59:10,541 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:59:10,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:59:10,542 INFO L82 PathProgramCache]: Analyzing trace with hash -504197709, now seen corresponding path program 1 times [2020-10-23 18:59:10,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:59:10,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108180512] [2020-10-23 18:59:10,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:59:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:59:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:59:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:59:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:59:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:59:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:59:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:59:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:59:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-23 18:59:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-23 18:59:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-10-23 18:59:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:59:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:59:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2020-10-23 18:59:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2020-10-23 18:59:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2020-10-23 18:59:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:59:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:59:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2020-10-23 18:59:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:59:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:59:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:10,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2020-10-23 18:59:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 26 proven. 37 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2020-10-23 18:59:11,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108180512] [2020-10-23 18:59:11,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456262996] [2020-10-23 18:59:11,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:59:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:11,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-23 18:59:11,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:59:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-10-23 18:59:11,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:59:11,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2020-10-23 18:59:11,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942246220] [2020-10-23 18:59:11,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:59:11,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:59:11,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:59:11,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:59:11,330 INFO L87 Difference]: Start difference. First operand 22237 states and 29457 transitions. Second operand 3 states. [2020-10-23 18:59:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:59:13,393 INFO L93 Difference]: Finished difference Result 38191 states and 51052 transitions. [2020-10-23 18:59:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:59:13,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2020-10-23 18:59:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:59:13,473 INFO L225 Difference]: With dead ends: 38191 [2020-10-23 18:59:13,473 INFO L226 Difference]: Without dead ends: 21417 [2020-10-23 18:59:13,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:59:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21417 states. [2020-10-23 18:59:15,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21417 to 21410. [2020-10-23 18:59:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2020-10-23 18:59:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 26797 transitions. [2020-10-23 18:59:15,989 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 26797 transitions. Word has length 278 [2020-10-23 18:59:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:59:15,990 INFO L481 AbstractCegarLoop]: Abstraction has 21410 states and 26797 transitions. [2020-10-23 18:59:15,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:59:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 26797 transitions. [2020-10-23 18:59:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2020-10-23 18:59:16,010 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:59:16,011 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:59:16,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:59:16,226 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:59:16,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:59:16,227 INFO L82 PathProgramCache]: Analyzing trace with hash 554889507, now seen corresponding path program 1 times [2020-10-23 18:59:16,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:59:16,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078462077] [2020-10-23 18:59:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:59:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:59:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:59:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:59:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:59:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:59:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:59:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:59:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-10-23 18:59:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:59:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 18:59:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:59:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-10-23 18:59:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-10-23 18:59:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-10-23 18:59:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:59:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-10-23 18:59:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2020-10-23 18:59:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2020-10-23 18:59:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2020-10-23 18:59:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2020-10-23 18:59:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:59:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:59:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2020-10-23 18:59:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2020-10-23 18:59:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2020-10-23 18:59:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:59:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-23 18:59:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:59:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2020-10-23 18:59:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:59:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:59:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2020-10-23 18:59:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 42 proven. 52 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2020-10-23 18:59:16,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078462077] [2020-10-23 18:59:16,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379176698] [2020-10-23 18:59:16,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:59:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:17,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 1482 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-23 18:59:17,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:59:17,110 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2020-10-23 18:59:17,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:59:17,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2020-10-23 18:59:17,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897176238] [2020-10-23 18:59:17,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:59:17,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:59:17,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:59:17,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:59:17,112 INFO L87 Difference]: Start difference. First operand 21410 states and 26797 transitions. Second operand 3 states. [2020-10-23 18:59:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:59:19,029 INFO L93 Difference]: Finished difference Result 34548 states and 44698 transitions. [2020-10-23 18:59:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:59:19,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 373 [2020-10-23 18:59:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:59:19,085 INFO L225 Difference]: With dead ends: 34548 [2020-10-23 18:59:19,085 INFO L226 Difference]: Without dead ends: 14499 [2020-10-23 18:59:19,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 458 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:59:19,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14499 states. [2020-10-23 18:59:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14499 to 14471. [2020-10-23 18:59:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14471 states. [2020-10-23 18:59:20,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14471 states to 14471 states and 17131 transitions. [2020-10-23 18:59:20,950 INFO L78 Accepts]: Start accepts. Automaton has 14471 states and 17131 transitions. Word has length 373 [2020-10-23 18:59:20,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:59:20,951 INFO L481 AbstractCegarLoop]: Abstraction has 14471 states and 17131 transitions. [2020-10-23 18:59:20,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:59:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 14471 states and 17131 transitions. [2020-10-23 18:59:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2020-10-23 18:59:20,967 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:59:20,967 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:59:21,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:59:21,182 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:59:21,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:59:21,183 INFO L82 PathProgramCache]: Analyzing trace with hash -352578689, now seen corresponding path program 1 times [2020-10-23 18:59:21,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:59:21,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502299959] [2020-10-23 18:59:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:59:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:59:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:59:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:59:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:59:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:59:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:59:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:59:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-10-23 18:59:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 18:59:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 18:59:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-23 18:59:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-23 18:59:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2020-10-23 18:59:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-10-23 18:59:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2020-10-23 18:59:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:59:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-10-23 18:59:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2020-10-23 18:59:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-10-23 18:59:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-10-23 18:59:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2020-10-23 18:59:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:59:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:59:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2020-10-23 18:59:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:59:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-23 18:59:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:59:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2020-10-23 18:59:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:59:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:59:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2020-10-23 18:59:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:21,729 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 37 proven. 12 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2020-10-23 18:59:21,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502299959] [2020-10-23 18:59:21,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101284421] [2020-10-23 18:59:21,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:59:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:22,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-23 18:59:22,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:59:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2020-10-23 18:59:22,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:59:22,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 15 [2020-10-23 18:59:22,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567495725] [2020-10-23 18:59:22,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:59:22,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:59:22,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:59:22,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-10-23 18:59:22,110 INFO L87 Difference]: Start difference. First operand 14471 states and 17131 transitions. Second operand 6 states. [2020-10-23 18:59:22,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:59:22,849 INFO L93 Difference]: Finished difference Result 18828 states and 22161 transitions. [2020-10-23 18:59:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-23 18:59:22,849 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 362 [2020-10-23 18:59:22,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:59:22,867 INFO L225 Difference]: With dead ends: 18828 [2020-10-23 18:59:22,868 INFO L226 Difference]: Without dead ends: 4494 [2020-10-23 18:59:22,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-10-23 18:59:22,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2020-10-23 18:59:23,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 4118. [2020-10-23 18:59:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4118 states. [2020-10-23 18:59:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4118 states to 4118 states and 4536 transitions. [2020-10-23 18:59:23,424 INFO L78 Accepts]: Start accepts. Automaton has 4118 states and 4536 transitions. Word has length 362 [2020-10-23 18:59:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:59:23,424 INFO L481 AbstractCegarLoop]: Abstraction has 4118 states and 4536 transitions. [2020-10-23 18:59:23,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:59:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 4118 states and 4536 transitions. [2020-10-23 18:59:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2020-10-23 18:59:23,429 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:59:23,429 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:59:23,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-10-23 18:59:23,644 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:59:23,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:59:23,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1482546099, now seen corresponding path program 1 times [2020-10-23 18:59:23,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:59:23,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079296804] [2020-10-23 18:59:23,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:59:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:59:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:59:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:59:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:59:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:59:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:59:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-23 18:59:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-10-23 18:59:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-10-23 18:59:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:59:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:59:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-10-23 18:59:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2020-10-23 18:59:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2020-10-23 18:59:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:59:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-23 18:59:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:59:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:23,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2020-10-23 18:59:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:24,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:59:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:24,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:24,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:24,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:24,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:59:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:24,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2020-10-23 18:59:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2020-10-23 18:59:24,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079296804] [2020-10-23 18:59:24,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273343023] [2020-10-23 18:59:24,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:59:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:24,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-23 18:59:24,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:59:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2020-10-23 18:59:24,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:59:24,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 12 [2020-10-23 18:59:24,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979532923] [2020-10-23 18:59:24,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:59:24,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:59:24,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:59:24,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:59:24,467 INFO L87 Difference]: Start difference. First operand 4118 states and 4536 transitions. Second operand 3 states. [2020-10-23 18:59:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:59:24,782 INFO L93 Difference]: Finished difference Result 5743 states and 6310 transitions. [2020-10-23 18:59:24,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:59:24,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2020-10-23 18:59:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:59:24,787 INFO L225 Difference]: With dead ends: 5743 [2020-10-23 18:59:24,787 INFO L226 Difference]: Without dead ends: 1984 [2020-10-23 18:59:24,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:59:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2020-10-23 18:59:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1984. [2020-10-23 18:59:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1984 states. [2020-10-23 18:59:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2155 transitions. [2020-10-23 18:59:25,041 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 2155 transitions. Word has length 262 [2020-10-23 18:59:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:59:25,041 INFO L481 AbstractCegarLoop]: Abstraction has 1984 states and 2155 transitions. [2020-10-23 18:59:25,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:59:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2155 transitions. [2020-10-23 18:59:25,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2020-10-23 18:59:25,043 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:59:25,043 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:59:25,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:59:25,258 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:59:25,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:59:25,259 INFO L82 PathProgramCache]: Analyzing trace with hash -922414755, now seen corresponding path program 1 times [2020-10-23 18:59:25,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:59:25,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545995746] [2020-10-23 18:59:25,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:59:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:59:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:59:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:59:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:59:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:59:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:59:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:59:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:59:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-23 18:59:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-23 18:59:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-10-23 18:59:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-10-23 18:59:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:59:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:59:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-10-23 18:59:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:59:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-23 18:59:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:59:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-10-23 18:59:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:59:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:59:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2020-10-23 18:59:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-23 18:59:25,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545995746] [2020-10-23 18:59:25,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770356554] [2020-10-23 18:59:25,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:59:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:26,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 23 conjunts are in the unsatisfiable core [2020-10-23 18:59:26,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:59:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 70 proven. 66 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2020-10-23 18:59:26,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:59:26,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 14 [2020-10-23 18:59:26,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215381701] [2020-10-23 18:59:26,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 18:59:26,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:59:26,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 18:59:26,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:59:26,204 INFO L87 Difference]: Start difference. First operand 1984 states and 2155 transitions. Second operand 14 states. [2020-10-23 18:59:26,391 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-23 18:59:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:59:29,981 INFO L93 Difference]: Finished difference Result 2104 states and 2311 transitions. [2020-10-23 18:59:29,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-23 18:59:29,982 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 268 [2020-10-23 18:59:29,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:59:29,987 INFO L225 Difference]: With dead ends: 2104 [2020-10-23 18:59:29,987 INFO L226 Difference]: Without dead ends: 2100 [2020-10-23 18:59:29,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 337 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2020-10-23 18:59:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2020-10-23 18:59:30,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1983. [2020-10-23 18:59:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2020-10-23 18:59:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2149 transitions. [2020-10-23 18:59:30,298 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2149 transitions. Word has length 268 [2020-10-23 18:59:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:59:30,299 INFO L481 AbstractCegarLoop]: Abstraction has 1983 states and 2149 transitions. [2020-10-23 18:59:30,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 18:59:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2149 transitions. [2020-10-23 18:59:30,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-10-23 18:59:30,301 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:59:30,302 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:59:30,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-10-23 18:59:30,518 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:59:30,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:59:30,519 INFO L82 PathProgramCache]: Analyzing trace with hash -340653003, now seen corresponding path program 1 times [2020-10-23 18:59:30,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:59:30,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100194017] [2020-10-23 18:59:30,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:59:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:59:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:59:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:59:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:59:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-23 18:59:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:59:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-23 18:59:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-23 18:59:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-23 18:59:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-10-23 18:59:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-10-23 18:59:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-10-23 18:59:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-23 18:59:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-10-23 18:59:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2020-10-23 18:59:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:59:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-23 18:59:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-23 18:59:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2020-10-23 18:59:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:59:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:59:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:59:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:59:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:59:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2020-10-23 18:59:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2020-10-23 18:59:30,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100194017] [2020-10-23 18:59:30,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880261444] [2020-10-23 18:59:30,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:59:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:59:31,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-23 18:59:31,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:59:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-10-23 18:59:31,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-23 18:59:31,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-10-23 18:59:31,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850622223] [2020-10-23 18:59:31,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-23 18:59:31,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:59:31,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-23 18:59:31,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:59:31,246 INFO L87 Difference]: Start difference. First operand 1983 states and 2149 transitions. Second operand 3 states. [2020-10-23 18:59:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:59:31,459 INFO L93 Difference]: Finished difference Result 3498 states and 3824 transitions. [2020-10-23 18:59:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-23 18:59:31,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2020-10-23 18:59:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:59:31,464 INFO L225 Difference]: With dead ends: 3498 [2020-10-23 18:59:31,464 INFO L226 Difference]: Without dead ends: 2018 [2020-10-23 18:59:31,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:59:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2020-10-23 18:59:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1988. [2020-10-23 18:59:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1988 states. [2020-10-23 18:59:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 2154 transitions. [2020-10-23 18:59:31,660 INFO L78 Accepts]: Start accepts. Automaton has 1988 states and 2154 transitions. Word has length 272 [2020-10-23 18:59:31,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:59:31,660 INFO L481 AbstractCegarLoop]: Abstraction has 1988 states and 2154 transitions. [2020-10-23 18:59:31,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-23 18:59:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 2154 transitions. [2020-10-23 18:59:31,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2020-10-23 18:59:31,662 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:59:31,662 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:59:31,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-10-23 18:59:31,863 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:59:31,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:59:31,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1776175046, now seen corresponding path program 1 times [2020-10-23 18:59:31,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:59:31,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752757655] [2020-10-23 18:59:31,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:59:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:59:31,892 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:59:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:59:31,929 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:59:32,136 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-23 18:59:32,136 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-23 18:59:32,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-23 18:59:32,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:59:32 BoogieIcfgContainer [2020-10-23 18:59:32,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 18:59:32,421 INFO L168 Benchmark]: Toolchain (without parser) took 142405.41 ms. Allocated memory was 156.2 MB in the beginning and 5.2 GB in the end (delta: 5.0 GB). Free memory was 130.8 MB in the beginning and 3.5 GB in the end (delta: -3.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 8.0 GB. [2020-10-23 18:59:32,421 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 156.2 MB. Free memory was 128.8 MB in the beginning and 128.8 MB in the end (delta: 89.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 18:59:32,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.58 ms. Allocated memory is still 156.2 MB. Free memory was 130.2 MB in the beginning and 116.3 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-10-23 18:59:32,422 INFO L168 Benchmark]: Boogie Preprocessor took 115.71 ms. Allocated memory is still 156.2 MB. Free memory was 116.3 MB in the beginning and 114.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-23 18:59:32,423 INFO L168 Benchmark]: RCFGBuilder took 838.71 ms. Allocated memory is still 156.2 MB. Free memory was 114.0 MB in the beginning and 111.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 17.2 MB. Max. memory is 8.0 GB. [2020-10-23 18:59:32,423 INFO L168 Benchmark]: TraceAbstraction took 140927.95 ms. Allocated memory was 156.2 MB in the beginning and 5.2 GB in the end (delta: 5.0 GB). Free memory was 110.9 MB in the beginning and 3.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 8.0 GB. [2020-10-23 18:59:32,427 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.18 ms. Allocated memory is still 156.2 MB. Free memory was 128.8 MB in the beginning and 128.8 MB in the end (delta: 89.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 507.58 ms. Allocated memory is still 156.2 MB. Free memory was 130.2 MB in the beginning and 116.3 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 115.71 ms. Allocated memory is still 156.2 MB. Free memory was 116.3 MB in the beginning and 114.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 838.71 ms. Allocated memory is still 156.2 MB. Free memory was 114.0 MB in the beginning and 111.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 17.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 140927.95 ms. Allocated memory was 156.2 MB in the beginning and 5.2 GB in the end (delta: 5.0 GB). Free memory was 110.9 MB in the beginning and 3.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int t2_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int t2_st ; [L22] int m_i ; [L23] int t1_i ; [L24] int t2_i ; [L25] int M_E = 2; [L26] int T1_E = 2; [L27] int T2_E = 2; [L28] int E_M = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; [L35] int token ; [L37] int local ; VAL [\old(E_1)=72, \old(E_2)=63, \old(E_M)=57, \old(local)=70, \old(M_E)=60, \old(m_i)=52, \old(m_pc)=66, \old(m_st)=55, \old(T1_E)=49, \old(t1_i)=68, \old(t1_pc)=65, \old(t1_st)=50, \old(T2_E)=69, \old(t2_i)=51, \old(t2_pc)=64, \old(t2_st)=54, \old(token)=73, E_1=2, E_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L602] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L606] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L516] m_i = 1 [L517] t1_i = 1 [L518] t2_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L606] RET init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L607] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L543] int kernel_st ; [L544] int tmp ; [L545] int tmp___0 ; [L549] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L551] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L235] COND TRUE m_i == 1 [L236] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L240] COND TRUE t1_i == 1 [L241] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L245] COND TRUE t2_i == 1 [L246] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L551] RET init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L552] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L348] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L353] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L358] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L363] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L368] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L373] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L552] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L553] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L427] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L167] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L170] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L182] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L427] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L435] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L186] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L189] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L201] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L435] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L443] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L205] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L208] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L220] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L443] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit2_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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L553] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L554] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L386] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L391] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L396] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L401] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L406] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L411] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L554] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L557] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L560] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L561] CALL eval() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L281] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L285] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L288] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L255] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L276] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L288] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L315] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L98] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L109] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L111] t1_pc = 1 [L112] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L315] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L329] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L134] COND TRUE t2_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L145] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L147] t2_pc = 1 [L148] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L329] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L285] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L288] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L255] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L276] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L288] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L301] CALL master() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L53] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L56] token = __VERIFIER_nondet_int() [L57] local = token [L58] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L59] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L459] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L427] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L167] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L170] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L180] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L182] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L427] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_master_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=-1] [L435] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L186] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L189] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L190] COND TRUE E_1 == 1 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=1, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L201] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L435] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit1_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=-1] [L435] tmp___0 = is_transmit1_triggered() [L437] COND TRUE \read(tmp___0) [L438] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=-1] [L443] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L205] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L208] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L209] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L218] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L220] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L443] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit2_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=-1] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=-1] [L459] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L59] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L60] E_1 = 2 [L61] m_pc = 1 [L62] m_st = 2 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=-1] [L301] RET master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=1, tmp_ndt_3=1, token=-1] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=1, tmp_ndt_3=1, token=-1] [L315] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L98] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L101] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=-1] [L117] token += 1 [L118] E_2 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L119] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L459] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L427] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L167] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L170] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L171] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L182] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L427] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_master_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L435] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L186] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L189] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L190] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L199] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L201] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, \result=0, __retres1=0, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L435] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_transmit1_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=0] [L443] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L205] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L208] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L209] COND TRUE E_2 == 1 [L210] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, __retres1=1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L220] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, \result=1, __retres1=1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L443] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, is_transmit2_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=0] [L443] tmp___1 = is_transmit2_triggered() [L445] COND TRUE \read(tmp___1) [L446] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=0] [L459] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L119] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=1, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L120] E_2 = 2 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L109] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L111] t1_pc = 1 [L112] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=-1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=0] [L315] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L329] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=0] [L134] COND FALSE !(t2_pc == 0) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=0] [L137] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=0] [L153] token += 1 [L154] E_M = 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L155] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L459] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L427] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L167] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L170] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L171] COND TRUE E_M == 1 [L172] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L182] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L427] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_master_triggered()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L427] tmp = is_master_triggered() [L429] COND TRUE \read(tmp) [L430] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=1] [L435] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L186] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L189] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L190] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L199] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L201] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L435] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_transmit1_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=1] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=1] [L443] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L205] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L208] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L209] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L218] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L220] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L443] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, is_transmit2_triggered()=0, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=1] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=1] [L459] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L155] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L156] E_M = 2 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L145] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L147] t2_pc = 1 [L148] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L329] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L285] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L288] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L255] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L276] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L288] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-3, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L301] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L45] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L67] COND FALSE !(token != local + 2) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L72] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L73] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L78] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L79] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L80] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=1] [L81] CALL error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L12] CALL reach_error() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L3] __assert_fail("0", "token_ring.02.cil-2.c", 3, "reach_error") VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(local)=-1, \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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=1, E_1=2, E_2=2, E_M=2, local=-1, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 24 procedures, 185 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 140.5s, OverallIterations: 28, TraceHistogramMax: 7, AutomataDifference: 93.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6986 SDtfs, 19447 SDslu, 3317 SDs, 0 SdLazy, 30376 SolverSat, 8733 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4617 GetRequests, 4150 SyntacticMatches, 9 SemanticMatches, 458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1784 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25886occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 18000 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 7909 NumberOfCodeBlocks, 7909 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 7598 ConstructedInterpolants, 0 QuantifiedInterpolants, 3641333 SizeOfPredicates, 11 NumberOfNonLiveVariables, 12970 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 38 InterpolantComputations, 26 PerfectInterpolantSequences, 5584/5892 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...