java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:10:12,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:10:12,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:10:12,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:10:12,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:10:12,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:10:12,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:10:12,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:10:12,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:10:12,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:10:12,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:10:12,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:10:12,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:10:12,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:10:12,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:10:12,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:10:12,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:10:12,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:10:12,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:10:12,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:10:12,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:10:12,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:10:12,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:10:12,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:10:12,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:10:12,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:10:12,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:10:12,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:10:12,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:10:12,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:10:12,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:10:12,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:10:12,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:10:12,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:10:12,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:10:12,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:10:12,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:10:12,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:10:12,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:10:12,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:10:12,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:10:12,616 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:10:12,632 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:10:12,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:10:12,634 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:10:12,634 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:10:12,635 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:10:12,635 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:10:12,636 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:10:12,636 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:10:12,636 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:10:12,636 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:10:12,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:10:12,637 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:10:12,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:10:12,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:10:12,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:10:12,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:10:12,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:10:12,640 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:10:12,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:10:12,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:10:12,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:10:12,640 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:10:12,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:10:12,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:10:12,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:10:12,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:10:12,642 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:10:12,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:10:12,642 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:10:12,642 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:10:12,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:10:12,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:10:12,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:10:12,703 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:10:12,703 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:10:12,704 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c [2019-09-16 17:10:12,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/765e2ba3f/46c000648ed842cf81437511c922e225/FLAG7f3fc9484 [2019-09-16 17:10:13,226 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:10:13,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2019-09-16 17:10:13,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/765e2ba3f/46c000648ed842cf81437511c922e225/FLAG7f3fc9484 [2019-09-16 17:10:13,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/765e2ba3f/46c000648ed842cf81437511c922e225 [2019-09-16 17:10:13,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:10:13,562 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:10:13,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:10:13,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:10:13,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:10:13,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:10:13" (1/1) ... [2019-09-16 17:10:13,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f5589eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:13, skipping insertion in model container [2019-09-16 17:10:13,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:10:13" (1/1) ... [2019-09-16 17:10:13,580 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:10:13,623 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:10:13,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:10:13,881 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:10:14,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:10:14,056 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:10:14,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:14 WrapperNode [2019-09-16 17:10:14,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:10:14,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:10:14,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:10:14,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:10:14,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:14" (1/1) ... [2019-09-16 17:10:14,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:14" (1/1) ... [2019-09-16 17:10:14,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:14" (1/1) ... [2019-09-16 17:10:14,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:14" (1/1) ... [2019-09-16 17:10:14,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:14" (1/1) ... [2019-09-16 17:10:14,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:14" (1/1) ... [2019-09-16 17:10:14,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:14" (1/1) ... [2019-09-16 17:10:14,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:10:14,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:10:14,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:10:14,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:10:14,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:10:14,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:10:14,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:10:14,176 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-16 17:10:14,176 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-16 17:10:14,176 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-16 17:10:14,177 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-16 17:10:14,177 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-16 17:10:14,177 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-16 17:10:14,177 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-16 17:10:14,177 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-16 17:10:14,177 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-16 17:10:14,177 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-16 17:10:14,177 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-16 17:10:14,178 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-16 17:10:14,178 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-16 17:10:14,178 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-16 17:10:14,178 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-16 17:10:14,178 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-16 17:10:14,179 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-16 17:10:14,179 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-16 17:10:14,179 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-16 17:10:14,179 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-16 17:10:14,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:10:14,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:10:14,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:10:14,180 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-16 17:10:14,180 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-16 17:10:14,180 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-16 17:10:14,180 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-16 17:10:14,180 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-16 17:10:14,181 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-16 17:10:14,181 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-16 17:10:14,181 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-16 17:10:14,181 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-16 17:10:14,181 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-16 17:10:14,181 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-16 17:10:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-16 17:10:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-16 17:10:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-16 17:10:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-16 17:10:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-16 17:10:14,182 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-16 17:10:14,183 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-16 17:10:14,183 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-16 17:10:14,183 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-16 17:10:14,183 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:10:14,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:10:14,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:10:14,787 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:10:14,787 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-09-16 17:10:14,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:10:14 BoogieIcfgContainer [2019-09-16 17:10:14,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:10:14,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:10:14,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:10:14,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:10:14,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:10:13" (1/3) ... [2019-09-16 17:10:14,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eda488e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:10:14, skipping insertion in model container [2019-09-16 17:10:14,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:14" (2/3) ... [2019-09-16 17:10:14,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eda488e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:10:14, skipping insertion in model container [2019-09-16 17:10:14,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:10:14" (3/3) ... [2019-09-16 17:10:14,799 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2019-09-16 17:10:14,810 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:10:14,819 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:10:14,837 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:10:14,865 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:10:14,865 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:10:14,865 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:10:14,866 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:10:14,866 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:10:14,866 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:10:14,866 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:10:14,867 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:10:14,889 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2019-09-16 17:10:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:10:14,905 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:14,906 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:14,909 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:14,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:14,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1996614335, now seen corresponding path program 1 times [2019-09-16 17:10:14,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:14,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:14,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:14,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:14,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:15,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:15,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:10:15,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:15,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:10:15,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:10:15,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:10:15,288 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 4 states. [2019-09-16 17:10:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:15,533 INFO L93 Difference]: Finished difference Result 167 states and 219 transitions. [2019-09-16 17:10:15,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:10:15,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-16 17:10:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:15,551 INFO L225 Difference]: With dead ends: 167 [2019-09-16 17:10:15,551 INFO L226 Difference]: Without dead ends: 160 [2019-09-16 17:10:15,553 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:10:15,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-16 17:10:15,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-09-16 17:10:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-16 17:10:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 212 transitions. [2019-09-16 17:10:15,618 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 212 transitions. Word has length 90 [2019-09-16 17:10:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:15,620 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 212 transitions. [2019-09-16 17:10:15,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:10:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 212 transitions. [2019-09-16 17:10:15,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:10:15,625 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:15,625 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:15,625 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:15,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:15,626 INFO L82 PathProgramCache]: Analyzing trace with hash -387310403, now seen corresponding path program 1 times [2019-09-16 17:10:15,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:15,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:15,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:15,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:15,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:15,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:15,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:15,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:15,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:15,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:15,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:15,822 INFO L87 Difference]: Start difference. First operand 160 states and 212 transitions. Second operand 5 states. [2019-09-16 17:10:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:16,343 INFO L93 Difference]: Finished difference Result 188 states and 258 transitions. [2019-09-16 17:10:16,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:16,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-16 17:10:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:16,350 INFO L225 Difference]: With dead ends: 188 [2019-09-16 17:10:16,350 INFO L226 Difference]: Without dead ends: 188 [2019-09-16 17:10:16,353 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-16 17:10:16,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 160. [2019-09-16 17:10:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-16 17:10:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 211 transitions. [2019-09-16 17:10:16,390 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 211 transitions. Word has length 90 [2019-09-16 17:10:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:16,391 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 211 transitions. [2019-09-16 17:10:16,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 211 transitions. [2019-09-16 17:10:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:10:16,401 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:16,401 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:16,401 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:16,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:16,402 INFO L82 PathProgramCache]: Analyzing trace with hash 566629755, now seen corresponding path program 1 times [2019-09-16 17:10:16,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:16,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:16,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:16,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:16,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:16,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:16,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:16,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:16,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:16,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:16,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:16,573 INFO L87 Difference]: Start difference. First operand 160 states and 211 transitions. Second operand 5 states. [2019-09-16 17:10:16,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:16,992 INFO L93 Difference]: Finished difference Result 188 states and 258 transitions. [2019-09-16 17:10:16,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:16,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-16 17:10:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:16,995 INFO L225 Difference]: With dead ends: 188 [2019-09-16 17:10:16,995 INFO L226 Difference]: Without dead ends: 188 [2019-09-16 17:10:16,996 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:16,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-16 17:10:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 160. [2019-09-16 17:10:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-16 17:10:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 210 transitions. [2019-09-16 17:10:17,013 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 210 transitions. Word has length 90 [2019-09-16 17:10:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:17,015 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 210 transitions. [2019-09-16 17:10:17,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 210 transitions. [2019-09-16 17:10:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:10:17,020 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:17,021 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:17,021 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:17,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:17,021 INFO L82 PathProgramCache]: Analyzing trace with hash -649523971, now seen corresponding path program 1 times [2019-09-16 17:10:17,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:17,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:17,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:17,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:17,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:17,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:17,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:17,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:17,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:17,167 INFO L87 Difference]: Start difference. First operand 160 states and 210 transitions. Second operand 5 states. [2019-09-16 17:10:17,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:17,565 INFO L93 Difference]: Finished difference Result 186 states and 253 transitions. [2019-09-16 17:10:17,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:17,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-16 17:10:17,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:17,569 INFO L225 Difference]: With dead ends: 186 [2019-09-16 17:10:17,569 INFO L226 Difference]: Without dead ends: 186 [2019-09-16 17:10:17,569 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:17,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-16 17:10:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 160. [2019-09-16 17:10:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-16 17:10:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2019-09-16 17:10:17,583 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 90 [2019-09-16 17:10:17,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:17,583 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2019-09-16 17:10:17,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:17,583 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2019-09-16 17:10:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:10:17,585 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:17,585 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:17,585 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:17,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:17,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1381491397, now seen corresponding path program 1 times [2019-09-16 17:10:17,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:17,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:17,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:17,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:17,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:17,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:17,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:17,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:17,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:17,662 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand 5 states. [2019-09-16 17:10:18,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:18,109 INFO L93 Difference]: Finished difference Result 201 states and 276 transitions. [2019-09-16 17:10:18,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:18,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-16 17:10:18,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:18,112 INFO L225 Difference]: With dead ends: 201 [2019-09-16 17:10:18,112 INFO L226 Difference]: Without dead ends: 201 [2019-09-16 17:10:18,113 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-16 17:10:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 160. [2019-09-16 17:10:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-16 17:10:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 208 transitions. [2019-09-16 17:10:18,125 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 208 transitions. Word has length 90 [2019-09-16 17:10:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:18,126 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 208 transitions. [2019-09-16 17:10:18,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 208 transitions. [2019-09-16 17:10:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:10:18,127 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:18,127 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:18,128 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:18,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:18,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1435884295, now seen corresponding path program 1 times [2019-09-16 17:10:18,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:18,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:18,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:18,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:18,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:18,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:18,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:10:18,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:18,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:10:18,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:10:18,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:18,195 INFO L87 Difference]: Start difference. First operand 160 states and 208 transitions. Second operand 6 states. [2019-09-16 17:10:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:18,228 INFO L93 Difference]: Finished difference Result 173 states and 228 transitions. [2019-09-16 17:10:18,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:10:18,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-16 17:10:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:18,231 INFO L225 Difference]: With dead ends: 173 [2019-09-16 17:10:18,231 INFO L226 Difference]: Without dead ends: 173 [2019-09-16 17:10:18,232 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:10:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-16 17:10:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 165. [2019-09-16 17:10:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-16 17:10:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 213 transitions. [2019-09-16 17:10:18,250 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 213 transitions. Word has length 90 [2019-09-16 17:10:18,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:18,251 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 213 transitions. [2019-09-16 17:10:18,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:10:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 213 transitions. [2019-09-16 17:10:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:10:18,253 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:18,254 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:18,254 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:18,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:18,255 INFO L82 PathProgramCache]: Analyzing trace with hash 830496891, now seen corresponding path program 1 times [2019-09-16 17:10:18,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:18,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:18,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:18,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:18,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:18,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:18,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:18,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:10:18,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:18,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:10:18,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:10:18,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:18,350 INFO L87 Difference]: Start difference. First operand 165 states and 213 transitions. Second operand 6 states. [2019-09-16 17:10:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:18,380 INFO L93 Difference]: Finished difference Result 175 states and 228 transitions. [2019-09-16 17:10:18,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:10:18,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-16 17:10:18,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:18,383 INFO L225 Difference]: With dead ends: 175 [2019-09-16 17:10:18,383 INFO L226 Difference]: Without dead ends: 175 [2019-09-16 17:10:18,383 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:10:18,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-16 17:10:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2019-09-16 17:10:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-16 17:10:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 218 transitions. [2019-09-16 17:10:18,398 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 218 transitions. Word has length 90 [2019-09-16 17:10:18,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:18,398 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 218 transitions. [2019-09-16 17:10:18,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:10:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 218 transitions. [2019-09-16 17:10:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:10:18,400 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:18,401 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:18,401 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:18,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:18,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1078643385, now seen corresponding path program 1 times [2019-09-16 17:10:18,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:18,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:18,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:18,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:18,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:18,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:18,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:10:18,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:18,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:10:18,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:10:18,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:18,499 INFO L87 Difference]: Start difference. First operand 170 states and 218 transitions. Second operand 6 states. [2019-09-16 17:10:18,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:18,537 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2019-09-16 17:10:18,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:10:18,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-16 17:10:18,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:18,542 INFO L225 Difference]: With dead ends: 177 [2019-09-16 17:10:18,542 INFO L226 Difference]: Without dead ends: 177 [2019-09-16 17:10:18,543 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:10:18,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-16 17:10:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2019-09-16 17:10:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-16 17:10:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 223 transitions. [2019-09-16 17:10:18,561 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 223 transitions. Word has length 90 [2019-09-16 17:10:18,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:18,562 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 223 transitions. [2019-09-16 17:10:18,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:10:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 223 transitions. [2019-09-16 17:10:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:10:18,564 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:18,565 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:18,565 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:18,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:18,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1006256827, now seen corresponding path program 1 times [2019-09-16 17:10:18,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:18,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:18,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:18,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:18,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:18,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:18,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:18,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:18,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:18,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:18,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:18,670 INFO L87 Difference]: Start difference. First operand 175 states and 223 transitions. Second operand 5 states. [2019-09-16 17:10:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:19,208 INFO L93 Difference]: Finished difference Result 274 states and 349 transitions. [2019-09-16 17:10:19,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 17:10:19,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-16 17:10:19,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:19,211 INFO L225 Difference]: With dead ends: 274 [2019-09-16 17:10:19,211 INFO L226 Difference]: Without dead ends: 274 [2019-09-16 17:10:19,212 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:10:19,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-16 17:10:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 226. [2019-09-16 17:10:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-16 17:10:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 286 transitions. [2019-09-16 17:10:19,223 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 286 transitions. Word has length 90 [2019-09-16 17:10:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:19,223 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 286 transitions. [2019-09-16 17:10:19,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:19,224 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 286 transitions. [2019-09-16 17:10:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:10:19,225 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:19,225 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:19,225 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:19,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:19,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1902507075, now seen corresponding path program 1 times [2019-09-16 17:10:19,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:19,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:19,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:19,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:19,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:19,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:19,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:19,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:19,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:19,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:19,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:19,286 INFO L87 Difference]: Start difference. First operand 226 states and 286 transitions. Second operand 5 states. [2019-09-16 17:10:19,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:19,605 INFO L93 Difference]: Finished difference Result 226 states and 283 transitions. [2019-09-16 17:10:19,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:19,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-16 17:10:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:19,609 INFO L225 Difference]: With dead ends: 226 [2019-09-16 17:10:19,609 INFO L226 Difference]: Without dead ends: 226 [2019-09-16 17:10:19,610 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-16 17:10:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-09-16 17:10:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-16 17:10:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 283 transitions. [2019-09-16 17:10:19,619 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 283 transitions. Word has length 90 [2019-09-16 17:10:19,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:19,620 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 283 transitions. [2019-09-16 17:10:19,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:19,620 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 283 transitions. [2019-09-16 17:10:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:10:19,621 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:19,622 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:19,622 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:19,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:19,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1882987131, now seen corresponding path program 1 times [2019-09-16 17:10:19,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:19,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:19,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:19,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:19,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:19,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:19,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:19,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:19,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:19,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:19,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:19,689 INFO L87 Difference]: Start difference. First operand 226 states and 283 transitions. Second operand 5 states. [2019-09-16 17:10:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:20,047 INFO L93 Difference]: Finished difference Result 226 states and 280 transitions. [2019-09-16 17:10:20,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:20,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-16 17:10:20,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:20,049 INFO L225 Difference]: With dead ends: 226 [2019-09-16 17:10:20,050 INFO L226 Difference]: Without dead ends: 226 [2019-09-16 17:10:20,050 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:20,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-16 17:10:20,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-09-16 17:10:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-16 17:10:20,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 280 transitions. [2019-09-16 17:10:20,059 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 280 transitions. Word has length 90 [2019-09-16 17:10:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:20,060 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 280 transitions. [2019-09-16 17:10:20,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 280 transitions. [2019-09-16 17:10:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:10:20,061 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:20,061 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:20,062 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:20,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:20,062 INFO L82 PathProgramCache]: Analyzing trace with hash -488752131, now seen corresponding path program 1 times [2019-09-16 17:10:20,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:20,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:20,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:20,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:20,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:20,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:20,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:20,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:20,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:20,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:20,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:20,150 INFO L87 Difference]: Start difference. First operand 226 states and 280 transitions. Second operand 5 states. [2019-09-16 17:10:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:20,673 INFO L93 Difference]: Finished difference Result 335 states and 435 transitions. [2019-09-16 17:10:20,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 17:10:20,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-16 17:10:20,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:20,677 INFO L225 Difference]: With dead ends: 335 [2019-09-16 17:10:20,677 INFO L226 Difference]: Without dead ends: 335 [2019-09-16 17:10:20,677 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:10:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-16 17:10:20,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 276. [2019-09-16 17:10:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-16 17:10:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 342 transitions. [2019-09-16 17:10:20,723 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 342 transitions. Word has length 90 [2019-09-16 17:10:20,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:20,723 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 342 transitions. [2019-09-16 17:10:20,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 342 transitions. [2019-09-16 17:10:20,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-16 17:10:20,725 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:20,725 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:20,725 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:20,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:20,726 INFO L82 PathProgramCache]: Analyzing trace with hash 291922076, now seen corresponding path program 1 times [2019-09-16 17:10:20,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:20,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:20,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:20,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:20,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:20,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:20,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:20,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:20,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:20,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:20,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:20,792 INFO L87 Difference]: Start difference. First operand 276 states and 342 transitions. Second operand 5 states. [2019-09-16 17:10:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:21,111 INFO L93 Difference]: Finished difference Result 300 states and 382 transitions. [2019-09-16 17:10:21,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:21,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-16 17:10:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:21,114 INFO L225 Difference]: With dead ends: 300 [2019-09-16 17:10:21,114 INFO L226 Difference]: Without dead ends: 300 [2019-09-16 17:10:21,115 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-16 17:10:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 262. [2019-09-16 17:10:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-16 17:10:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 317 transitions. [2019-09-16 17:10:21,127 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 317 transitions. Word has length 91 [2019-09-16 17:10:21,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:21,128 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 317 transitions. [2019-09-16 17:10:21,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:21,128 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 317 transitions. [2019-09-16 17:10:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:10:21,130 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:21,130 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:21,130 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:21,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:21,131 INFO L82 PathProgramCache]: Analyzing trace with hash -426712517, now seen corresponding path program 1 times [2019-09-16 17:10:21,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:21,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:21,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:21,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:21,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:21,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:21,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:21,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:21,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:21,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:21,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:21,201 INFO L87 Difference]: Start difference. First operand 262 states and 317 transitions. Second operand 5 states. [2019-09-16 17:10:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:21,654 INFO L93 Difference]: Finished difference Result 330 states and 409 transitions. [2019-09-16 17:10:21,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:10:21,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-16 17:10:21,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:21,657 INFO L225 Difference]: With dead ends: 330 [2019-09-16 17:10:21,657 INFO L226 Difference]: Without dead ends: 330 [2019-09-16 17:10:21,658 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:10:21,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-16 17:10:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 287. [2019-09-16 17:10:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-16 17:10:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 339 transitions. [2019-09-16 17:10:21,675 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 339 transitions. Word has length 90 [2019-09-16 17:10:21,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:21,676 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 339 transitions. [2019-09-16 17:10:21,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:21,676 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 339 transitions. [2019-09-16 17:10:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:10:21,677 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:21,677 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:21,678 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:21,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:21,678 INFO L82 PathProgramCache]: Analyzing trace with hash -286163907, now seen corresponding path program 1 times [2019-09-16 17:10:21,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:21,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:21,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:21,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:21,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:21,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:21,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:10:21,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:21,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:10:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:10:21,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:10:21,711 INFO L87 Difference]: Start difference. First operand 287 states and 339 transitions. Second operand 3 states. [2019-09-16 17:10:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:21,732 INFO L93 Difference]: Finished difference Result 504 states and 598 transitions. [2019-09-16 17:10:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:10:21,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-16 17:10:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:21,735 INFO L225 Difference]: With dead ends: 504 [2019-09-16 17:10:21,735 INFO L226 Difference]: Without dead ends: 504 [2019-09-16 17:10:21,736 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:10:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-16 17:10:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 499. [2019-09-16 17:10:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-16 17:10:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 594 transitions. [2019-09-16 17:10:21,757 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 594 transitions. Word has length 90 [2019-09-16 17:10:21,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:21,757 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 594 transitions. [2019-09-16 17:10:21,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:10:21,757 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 594 transitions. [2019-09-16 17:10:21,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-16 17:10:21,759 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:21,759 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:21,759 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:21,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:21,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1417763379, now seen corresponding path program 1 times [2019-09-16 17:10:21,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:21,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:21,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:21,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:21,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:21,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:21,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:10:21,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:21,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:10:21,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:10:21,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:10:21,811 INFO L87 Difference]: Start difference. First operand 499 states and 594 transitions. Second operand 3 states. [2019-09-16 17:10:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:21,833 INFO L93 Difference]: Finished difference Result 929 states and 1127 transitions. [2019-09-16 17:10:21,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:10:21,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-16 17:10:21,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:21,840 INFO L225 Difference]: With dead ends: 929 [2019-09-16 17:10:21,840 INFO L226 Difference]: Without dead ends: 929 [2019-09-16 17:10:21,840 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:10:21,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-09-16 17:10:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 927. [2019-09-16 17:10:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-09-16 17:10:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1124 transitions. [2019-09-16 17:10:21,870 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1124 transitions. Word has length 91 [2019-09-16 17:10:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:21,871 INFO L475 AbstractCegarLoop]: Abstraction has 927 states and 1124 transitions. [2019-09-16 17:10:21,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:10:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1124 transitions. [2019-09-16 17:10:21,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-16 17:10:21,874 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:21,875 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:10:21,875 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:21,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:21,875 INFO L82 PathProgramCache]: Analyzing trace with hash 36587625, now seen corresponding path program 1 times [2019-09-16 17:10:21,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:21,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:21,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:21,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:21,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-16 17:10:21,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:21,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:10:21,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:21,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:10:21,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:10:21,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:10:21,931 INFO L87 Difference]: Start difference. First operand 927 states and 1124 transitions. Second operand 3 states. [2019-09-16 17:10:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:21,972 INFO L93 Difference]: Finished difference Result 1808 states and 2207 transitions. [2019-09-16 17:10:21,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:10:21,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-16 17:10:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:21,981 INFO L225 Difference]: With dead ends: 1808 [2019-09-16 17:10:21,981 INFO L226 Difference]: Without dead ends: 1366 [2019-09-16 17:10:21,982 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:10:21,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-09-16 17:10:22,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1366. [2019-09-16 17:10:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1366 states. [2019-09-16 17:10:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1653 transitions. [2019-09-16 17:10:22,033 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1653 transitions. Word has length 111 [2019-09-16 17:10:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:22,033 INFO L475 AbstractCegarLoop]: Abstraction has 1366 states and 1653 transitions. [2019-09-16 17:10:22,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:10:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1653 transitions. [2019-09-16 17:10:22,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:10:22,038 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:22,038 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-16 17:10:22,038 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:22,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:22,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1178118941, now seen corresponding path program 1 times [2019-09-16 17:10:22,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:22,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:22,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:22,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:22,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-16 17:10:22,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:22,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:10:22,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:22,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:10:22,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:10:22,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:10:22,088 INFO L87 Difference]: Start difference. First operand 1366 states and 1653 transitions. Second operand 3 states. [2019-09-16 17:10:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:22,127 INFO L93 Difference]: Finished difference Result 2424 states and 3011 transitions. [2019-09-16 17:10:22,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:10:22,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-16 17:10:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:22,143 INFO L225 Difference]: With dead ends: 2424 [2019-09-16 17:10:22,143 INFO L226 Difference]: Without dead ends: 2424 [2019-09-16 17:10:22,144 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:10:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2019-09-16 17:10:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2421. [2019-09-16 17:10:22,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2421 states. [2019-09-16 17:10:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 3009 transitions. [2019-09-16 17:10:22,232 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 3009 transitions. Word has length 155 [2019-09-16 17:10:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:22,232 INFO L475 AbstractCegarLoop]: Abstraction has 2421 states and 3009 transitions. [2019-09-16 17:10:22,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:10:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 3009 transitions. [2019-09-16 17:10:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:10:22,239 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:22,239 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-16 17:10:22,239 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:22,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:22,240 INFO L82 PathProgramCache]: Analyzing trace with hash -390866386, now seen corresponding path program 1 times [2019-09-16 17:10:22,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:22,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:22,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:22,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:22,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-16 17:10:22,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:10:22,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:10:22,336 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2019-09-16 17:10:22,339 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [55], [56], [61], [75], [78], [81], [85], [87], [89], [90], [95], [101], [107], [113], [119], [121], [122], [132], [134], [136], [137], [170], [171], [173], [178], [181], [186], [189], [192], [194], [196], [197], [200], [214], [215], [216], [226], [228], [230], [231], [236], [242], [248], [254], [260], [262], [265], [271], [277], [281], [326], [327], [328], [337], [340], [343], [349], [355], [362], [365], [368], [375], [378], [390], [391], [405], [407], [440], [441], [442], [443], [444], [446], [447], [448], [452], [453], [454], [455], [456], [457], [458], [459], [462], [463], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [500], [501], [502] [2019-09-16 17:10:22,413 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:10:22,413 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:10:22,772 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:10:22,776 INFO L272 AbstractInterpreter]: Visited 99 different actions 116 times. Merged at 10 different actions 10 times. Never widened. Performed 492 root evaluator evaluations with a maximum evaluation depth of 4. Performed 492 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2019-09-16 17:10:22,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:22,782 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:10:23,097 INFO L227 lantSequenceWeakener]: Weakened 110 states. On average, predicates are now at 69.87% of their original sizes. [2019-09-16 17:10:23,097 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:10:24,118 INFO L420 sIntCurrentIteration]: We unified 155 AI predicates to 155 [2019-09-16 17:10:24,118 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:10:24,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:10:24,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [6] total 51 [2019-09-16 17:10:24,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:24,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-16 17:10:24,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-16 17:10:24,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1725, Unknown=0, NotChecked=0, Total=2162 [2019-09-16 17:10:24,122 INFO L87 Difference]: Start difference. First operand 2421 states and 3009 transitions. Second operand 47 states. [2019-09-16 17:10:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:33,731 INFO L93 Difference]: Finished difference Result 3436 states and 4253 transitions. [2019-09-16 17:10:33,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-16 17:10:33,731 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 156 [2019-09-16 17:10:33,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:33,757 INFO L225 Difference]: With dead ends: 3436 [2019-09-16 17:10:33,757 INFO L226 Difference]: Without dead ends: 3436 [2019-09-16 17:10:33,760 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2373 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1457, Invalid=6199, Unknown=0, NotChecked=0, Total=7656 [2019-09-16 17:10:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2019-09-16 17:10:33,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3387. [2019-09-16 17:10:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3387 states. [2019-09-16 17:10:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4186 transitions. [2019-09-16 17:10:33,937 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4186 transitions. Word has length 156 [2019-09-16 17:10:33,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:33,937 INFO L475 AbstractCegarLoop]: Abstraction has 3387 states and 4186 transitions. [2019-09-16 17:10:33,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-16 17:10:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4186 transitions. [2019-09-16 17:10:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-16 17:10:33,944 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:33,944 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:10:33,945 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:33,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:33,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2099994738, now seen corresponding path program 1 times [2019-09-16 17:10:33,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:33,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:33,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:33,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:33,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-16 17:10:34,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:34,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:10:34,032 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:34,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:10:34,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:10:34,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:10:34,034 INFO L87 Difference]: Start difference. First operand 3387 states and 4186 transitions. Second operand 4 states. [2019-09-16 17:10:34,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:34,221 INFO L93 Difference]: Finished difference Result 3534 states and 4144 transitions. [2019-09-16 17:10:34,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:10:34,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-09-16 17:10:34,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:34,242 INFO L225 Difference]: With dead ends: 3534 [2019-09-16 17:10:34,242 INFO L226 Difference]: Without dead ends: 3534 [2019-09-16 17:10:34,243 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:10:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3534 states. [2019-09-16 17:10:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3534 to 3449. [2019-09-16 17:10:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3449 states. [2019-09-16 17:10:34,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4055 transitions. [2019-09-16 17:10:34,359 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4055 transitions. Word has length 199 [2019-09-16 17:10:34,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:34,360 INFO L475 AbstractCegarLoop]: Abstraction has 3449 states and 4055 transitions. [2019-09-16 17:10:34,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:10:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4055 transitions. [2019-09-16 17:10:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-16 17:10:34,366 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:34,367 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-16 17:10:34,367 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:34,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:34,368 INFO L82 PathProgramCache]: Analyzing trace with hash 580969083, now seen corresponding path program 1 times [2019-09-16 17:10:34,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:34,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:34,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:34,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:34,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-16 17:10:34,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:10:34,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:10:34,472 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2019-09-16 17:10:34,473 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [55], [56], [61], [75], [78], [81], [85], [87], [89], [90], [95], [101], [107], [113], [119], [121], [122], [132], [134], [136], [137], [170], [171], [173], [178], [181], [186], [189], [192], [194], [196], [197], [200], [202], [205], [214], [215], [216], [226], [228], [230], [231], [236], [242], [248], [254], [260], [262], [265], [271], [277], [281], [284], [300], [302], [304], [313], [315], [323], [326], [327], [328], [337], [340], [343], [349], [352], [358], [362], [365], [368], [375], [378], [390], [391], [405], [407], [440], [441], [442], [443], [444], [446], [447], [448], [452], [453], [454], [455], [456], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [500], [501], [502] [2019-09-16 17:10:34,483 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:10:34,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:10:34,562 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:10:34,562 INFO L272 AbstractInterpreter]: Visited 120 different actions 230 times. Merged at 16 different actions 19 times. Never widened. Performed 767 root evaluator evaluations with a maximum evaluation depth of 4. Performed 767 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 36 variables. [2019-09-16 17:10:34,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:34,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:10:34,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:10:34,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-16 17:10:34,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:34,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:10:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:34,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 17:10:34,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:10:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-16 17:10:34,842 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:10:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-16 17:10:35,080 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:10:35,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 8 [2019-09-16 17:10:35,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:35,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:10:35,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:10:35,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:10:35,083 INFO L87 Difference]: Start difference. First operand 3449 states and 4055 transitions. Second operand 3 states. [2019-09-16 17:10:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:35,114 INFO L93 Difference]: Finished difference Result 2694 states and 3061 transitions. [2019-09-16 17:10:35,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:10:35,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-09-16 17:10:35,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:35,122 INFO L225 Difference]: With dead ends: 2694 [2019-09-16 17:10:35,123 INFO L226 Difference]: Without dead ends: 1610 [2019-09-16 17:10:35,123 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:10:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2019-09-16 17:10:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1532. [2019-09-16 17:10:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1532 states. [2019-09-16 17:10:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1685 transitions. [2019-09-16 17:10:35,209 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1685 transitions. Word has length 199 [2019-09-16 17:10:35,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:35,212 INFO L475 AbstractCegarLoop]: Abstraction has 1532 states and 1685 transitions. [2019-09-16 17:10:35,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:10:35,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1685 transitions. [2019-09-16 17:10:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-16 17:10:35,216 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:35,216 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:35,217 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:35,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:35,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1102829376, now seen corresponding path program 1 times [2019-09-16 17:10:35,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:35,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:35,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:35,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:35,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-16 17:10:35,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:10:35,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:10:35,321 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2019-09-16 17:10:35,322 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [55], [56], [61], [75], [78], [81], [85], [87], [89], [90], [95], [101], [107], [113], [119], [121], [122], [125], [130], [132], [134], [136], [137], [170], [171], [173], [178], [181], [186], [189], [192], [194], [196], [197], [200], [202], [205], [214], [215], [216], [226], [228], [230], [231], [236], [242], [248], [254], [260], [262], [265], [271], [277], [281], [284], [300], [302], [304], [313], [315], [323], [326], [327], [328], [337], [340], [343], [349], [352], [358], [362], [365], [368], [375], [378], [390], [391], [405], [407], [440], [441], [442], [443], [444], [446], [447], [448], [452], [453], [454], [455], [456], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [500], [501], [502] [2019-09-16 17:10:35,325 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:10:35,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:10:35,368 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:10:35,369 INFO L272 AbstractInterpreter]: Visited 120 different actions 193 times. Merged at 14 different actions 19 times. Never widened. Performed 724 root evaluator evaluations with a maximum evaluation depth of 4. Performed 724 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 36 variables. [2019-09-16 17:10:35,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:35,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:10:35,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:10:35,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:10:35,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:35,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:10:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:35,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 17:10:35,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:10:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-16 17:10:35,575 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:10:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-16 17:10:35,761 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:10:35,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 7 [2019-09-16 17:10:35,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:35,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:10:35,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:10:35,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:10:35,763 INFO L87 Difference]: Start difference. First operand 1532 states and 1685 transitions. Second operand 3 states. [2019-09-16 17:10:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:35,794 INFO L93 Difference]: Finished difference Result 2126 states and 2360 transitions. [2019-09-16 17:10:35,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:10:35,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-09-16 17:10:35,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:35,807 INFO L225 Difference]: With dead ends: 2126 [2019-09-16 17:10:35,807 INFO L226 Difference]: Without dead ends: 2126 [2019-09-16 17:10:35,807 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:10:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2019-09-16 17:10:35,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2120. [2019-09-16 17:10:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2019-09-16 17:10:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 2352 transitions. [2019-09-16 17:10:35,870 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 2352 transitions. Word has length 200 [2019-09-16 17:10:35,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:35,871 INFO L475 AbstractCegarLoop]: Abstraction has 2120 states and 2352 transitions. [2019-09-16 17:10:35,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:10:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2352 transitions. [2019-09-16 17:10:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-16 17:10:35,876 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:35,876 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-16 17:10:35,876 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:35,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash 826028549, now seen corresponding path program 1 times [2019-09-16 17:10:35,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:35,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:35,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:35,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:35,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-16 17:10:35,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:10:35,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:10:35,959 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2019-09-16 17:10:35,960 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [55], [56], [61], [75], [78], [81], [85], [87], [89], [90], [95], [101], [107], [113], [119], [121], [122], [125], [130], [132], [134], [136], [137], [170], [171], [173], [178], [181], [186], [189], [192], [194], [196], [197], [200], [202], [205], [214], [215], [216], [219], [224], [226], [228], [230], [231], [236], [242], [248], [254], [260], [262], [265], [271], [277], [281], [284], [300], [302], [304], [313], [315], [323], [326], [327], [328], [337], [340], [343], [349], [352], [358], [362], [365], [368], [375], [378], [390], [391], [405], [407], [440], [441], [442], [443], [444], [446], [447], [448], [452], [453], [454], [455], [456], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [500], [501], [502] [2019-09-16 17:10:35,965 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:10:35,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:10:36,018 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:10:36,019 INFO L272 AbstractInterpreter]: Visited 122 different actions 236 times. Merged at 16 different actions 19 times. Never widened. Performed 773 root evaluator evaluations with a maximum evaluation depth of 4. Performed 773 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 36 variables. [2019-09-16 17:10:36,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:36,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:10:36,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:10:36,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:10:36,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:36,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:10:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:36,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-16 17:10:36,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:10:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 61 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-16 17:10:36,276 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:10:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-16 17:10:36,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-16 17:10:36,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-16 17:10:36,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:36,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:36,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:36,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:10:36,537 INFO L87 Difference]: Start difference. First operand 2120 states and 2352 transitions. Second operand 5 states. [2019-09-16 17:10:37,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:37,046 INFO L93 Difference]: Finished difference Result 2238 states and 2461 transitions. [2019-09-16 17:10:37,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:37,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 201 [2019-09-16 17:10:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:37,056 INFO L225 Difference]: With dead ends: 2238 [2019-09-16 17:10:37,057 INFO L226 Difference]: Without dead ends: 1567 [2019-09-16 17:10:37,058 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 395 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:10:37,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2019-09-16 17:10:37,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1558. [2019-09-16 17:10:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-09-16 17:10:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 1715 transitions. [2019-09-16 17:10:37,102 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 1715 transitions. Word has length 201 [2019-09-16 17:10:37,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:37,102 INFO L475 AbstractCegarLoop]: Abstraction has 1558 states and 1715 transitions. [2019-09-16 17:10:37,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1715 transitions. [2019-09-16 17:10:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-16 17:10:37,106 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:37,106 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2019-09-16 17:10:37,107 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:37,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:37,107 INFO L82 PathProgramCache]: Analyzing trace with hash 89354437, now seen corresponding path program 1 times [2019-09-16 17:10:37,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:37,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:37,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:37,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:37,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 17:10:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-16 17:10:37,268 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-16 17:10:37,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:10:37 BoogieIcfgContainer [2019-09-16 17:10:37,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:10:37,495 INFO L168 Benchmark]: Toolchain (without parser) took 23931.82 ms. Allocated memory was 136.3 MB in the beginning and 609.2 MB in the end (delta: 472.9 MB). Free memory was 82.5 MB in the beginning and 368.1 MB in the end (delta: -285.6 MB). Peak memory consumption was 187.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:10:37,497 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 136.3 MB. Free memory was 101.1 MB in the beginning and 100.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:10:37,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 494.45 ms. Allocated memory was 136.3 MB in the beginning and 197.1 MB in the end (delta: 60.8 MB). Free memory was 82.3 MB in the beginning and 172.5 MB in the end (delta: -90.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:10:37,500 INFO L168 Benchmark]: Boogie Preprocessor took 48.16 ms. Allocated memory is still 197.1 MB. Free memory was 172.5 MB in the beginning and 169.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-09-16 17:10:37,506 INFO L168 Benchmark]: RCFGBuilder took 682.66 ms. Allocated memory is still 197.1 MB. Free memory was 169.9 MB in the beginning and 134.9 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:10:37,507 INFO L168 Benchmark]: TraceAbstraction took 22701.40 ms. Allocated memory was 197.1 MB in the beginning and 609.2 MB in the end (delta: 412.1 MB). Free memory was 134.3 MB in the beginning and 368.1 MB in the end (delta: -233.8 MB). Peak memory consumption was 178.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:10:37,519 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 136.3 MB. Free memory was 101.1 MB in the beginning and 100.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 494.45 ms. Allocated memory was 136.3 MB in the beginning and 197.1 MB in the end (delta: 60.8 MB). Free memory was 82.3 MB in the beginning and 172.5 MB in the end (delta: -90.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.16 ms. Allocated memory is still 197.1 MB. Free memory was 172.5 MB in the beginning and 169.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 682.66 ms. Allocated memory is still 197.1 MB. Free memory was 169.9 MB in the beginning and 134.9 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22701.40 ms. Allocated memory was 197.1 MB in the beginning and 609.2 MB in the end (delta: 412.1 MB). Free memory was 134.3 MB in the beginning and 368.1 MB in the end (delta: -233.8 MB). Peak memory consumption was 178.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int t2_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int t2_st ; [L21] int m_i ; [L22] int t1_i ; [L23] int t2_i ; [L24] int M_E = 2; [L25] int T1_E = 2; [L26] int T2_E = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; VAL [\old(E_1)=16, \old(E_2)=5, \old(M_E)=13, \old(m_i)=7, \old(m_pc)=11, \old(m_st)=12, \old(T1_E)=3, \old(t1_i)=15, \old(t1_pc)=8, \old(t1_st)=4, \old(T2_E)=14, \old(t2_i)=6, \old(t2_pc)=9, \old(t2_st)=10, E_1=2, E_2=2, 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] [L563] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L567] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L477] m_i = 1 [L478] t1_i = 1 [L479] t2_i = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L567] RET init_model() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L568] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L504] int kernel_st ; [L505] int tmp ; [L506] int tmp___0 ; [L510] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, kernel_st=0, 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] [L511] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, kernel_st=0, 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] [L512] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L211] COND TRUE m_i == 1 [L212] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L216] COND TRUE t1_i == 1 [L217] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L221] COND TRUE t2_i == 1 [L222] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L512] RET init_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, kernel_st=0, 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] [L513] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L324] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L329] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L334] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L339] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L344] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L513] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, kernel_st=0, 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] [L514] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L393] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L143] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L146] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L156] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, __retres1=0, E_1=2, E_2=2, 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] [L158] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, \result=0, __retres1=0, E_1=2, E_2=2, 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] [L393] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, is_master_triggered()=0, 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] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L401] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L162] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L165] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L175] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, __retres1=0, E_1=2, E_2=2, 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] [L177] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, \result=0, __retres1=0, E_1=2, E_2=2, 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] [L401] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, is_transmit1_triggered()=0, 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] [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L409] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L181] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L184] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L194] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, __retres1=0, E_1=2, E_2=2, 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] [L196] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, \result=0, __retres1=0, E_1=2, E_2=2, 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] [L409] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, is_transmit2_triggered()=0, 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] [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L514] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, kernel_st=0, 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] [L515] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L357] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L362] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L367] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L372] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L377] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L515] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, kernel_st=0, 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] [L518] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, kernel_st=0, 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] [L521] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, kernel_st=1, 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] [L522] CALL eval() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L257] int tmp ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L261] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L264] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L231] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, __retres1=1, E_1=2, E_2=2, 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] [L252] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, \result=1, __retres1=1, E_1=2, E_2=2, 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] [L264] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, exists_runnable_thread()=1, 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] [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L291] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=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, E_1=2, E_2=2, 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] [L78] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=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, E_1=2, E_2=2, 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] [L89] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=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, E_1=2, E_2=2, 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] [L91] t1_pc = 1 [L92] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=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, E_1=2, E_2=2, 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] [L291] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L305] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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)=1, E_1=2, E_2=2, 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] [L113] COND TRUE t2_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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)=1, E_1=2, E_2=2, 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] [L124] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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)=1, E_1=2, E_2=2, 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] [L126] t2_pc = 1 [L127] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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)=1, E_1=2, E_2=2, 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] [L305] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L261] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L264] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L231] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, __retres1=1, E_1=2, E_2=2, 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] [L252] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, \result=1, __retres1=1, E_1=2, E_2=2, 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] [L264] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, exists_runnable_thread()=1, 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] [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND TRUE \read(tmp_ndt_1) [L276] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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=1, tmp_ndt_2=1, tmp_ndt_3=1] [L277] CALL master() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L37] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L48] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L51] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L52] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L425] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L393] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L143] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L146] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L156] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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, __retres1=0, E_1=1, E_2=2, 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] [L158] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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, \result=0, __retres1=0, E_1=1, E_2=2, 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] [L393] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, is_master_triggered()=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] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L401] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L162] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L165] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L166] COND TRUE E_1 == 1 [L167] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, __retres1=1, E_1=1, E_2=2, 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] [L177] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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, \result=1, __retres1=1, E_1=1, E_2=2, 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] [L401] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, is_transmit1_triggered()=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] [L401] tmp___0 = is_transmit1_triggered() [L403] COND TRUE \read(tmp___0) [L404] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L409] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L181] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L184] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L185] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L194] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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, __retres1=0, E_1=1, E_2=2, 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] [L196] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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, \result=0, __retres1=0, E_1=1, E_2=2, 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] [L409] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, is_transmit2_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L425] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L52] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=1, E_2=2, 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] [L53] E_1 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L56] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L58] m_pc = 1 [L59] m_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L277] RET master() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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=1, tmp_ndt_2=1, tmp_ndt_3=1] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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=1, tmp_ndt_2=1, tmp_ndt_3=1] [L291] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L78] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L81] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L97] E_2 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L98] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L425] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L393] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L143] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L146] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L147] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L156] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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, __retres1=0, E_1=2, E_2=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] [L158] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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, \result=0, __retres1=0, E_1=2, E_2=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] [L393] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=1, is_master_triggered()=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L401] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L162] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L165] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L166] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L175] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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, __retres1=0, E_1=2, E_2=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] [L177] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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, \result=0, __retres1=0, E_1=2, E_2=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] [L401] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=1, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L409] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L181] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L184] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L185] COND TRUE E_2 == 1 [L186] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, __retres1=1, E_1=2, E_2=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] [L196] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=2, \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, \result=1, __retres1=1, E_1=2, E_2=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] [L409] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=1, is_transmit2_triggered()=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] [L409] tmp___1 = is_transmit2_triggered() [L411] COND TRUE \read(tmp___1) [L412] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L425] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L98] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=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] [L99] E_2 = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L89] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L91] t1_pc = 1 [L92] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=2, \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, E_1=2, E_2=2, 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] [L291] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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=1, tmp_ndt_2=1, tmp_ndt_3=1] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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, E_1=2, E_2=2, 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=1, tmp_ndt_2=1, tmp_ndt_3=1] [L305] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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)=1, \old(t2_st)=1, E_1=2, E_2=2, 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] [L113] COND FALSE !(t2_pc == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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)=1, \old(t2_st)=1, E_1=2, E_2=2, 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] [L116] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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)=1, \old(t2_st)=1, E_1=2, E_2=2, 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] [L132] CALL error() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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)=1, \old(t2_st)=1, E_1=2, E_2=2, 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] [L11] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(m_i)=0, \old(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)=1, \old(t2_st)=1, E_1=2, E_2=2, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 169 locations, 1 error locations. UNSAFE Result, 22.6s OverallTime, 24 OverallIterations, 3 TraceHistogramMax, 15.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5412 SDtfs, 6150 SDslu, 7177 SDs, 0 SdLazy, 4330 SolverSat, 1771 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1565 GetRequests, 1378 SyntacticMatches, 15 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2407 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3449occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.9886059309798054 AbsIntWeakeningRatio, 0.567741935483871 AbsIntAvgWeakeningVarsNumRemoved, 9.23225806451613 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 563 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 3471 NumberOfCodeBlocks, 3471 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3834 ConstructedInterpolants, 0 QuantifiedInterpolants, 883752 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2322 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 29 InterpolantComputations, 24 PerfectInterpolantSequences, 1040/1178 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...