/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/systemc/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-03 01:28:19,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-03 01:28:19,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-03 01:28:19,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-03 01:28:19,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-03 01:28:19,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-03 01:28:19,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-03 01:28:19,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-03 01:28:19,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-03 01:28:19,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-03 01:28:19,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-03 01:28:19,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-03 01:28:19,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-03 01:28:19,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-03 01:28:19,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-03 01:28:19,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-03 01:28:19,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-03 01:28:19,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-03 01:28:19,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-03 01:28:19,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-03 01:28:19,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-03 01:28:19,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-03 01:28:19,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-03 01:28:19,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-03 01:28:19,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-03 01:28:19,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-03 01:28:19,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-03 01:28:19,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-03 01:28:19,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-03 01:28:19,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-03 01:28:19,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-03 01:28:19,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-03 01:28:19,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-03 01:28:19,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-03 01:28:19,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-03 01:28:19,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-03 01:28:19,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-03 01:28:19,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-03 01:28:19,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-03 01:28:19,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-03 01:28:19,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-03 01:28:19,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-03 01:28:19,916 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-03 01:28:19,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-03 01:28:19,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-03 01:28:19,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-03 01:28:19,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-03 01:28:19,918 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-03 01:28:19,918 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-03 01:28:19,918 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-03 01:28:19,918 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-03 01:28:19,918 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-03 01:28:19,918 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-03 01:28:19,918 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-03 01:28:19,919 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-03 01:28:19,919 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-03 01:28:19,919 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-03 01:28:19,919 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-03 01:28:19,919 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-03 01:28:19,919 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-03 01:28:19,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-03 01:28:19,920 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-03 01:28:19,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-03 01:28:19,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-03 01:28:19,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-03 01:28:19,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-03 01:28:19,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-03 01:28:19,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-03 01:28:19,920 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-03 01:28:19,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-03 01:28:19,921 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-03 01:28:19,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-03 01:28:19,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-03 01:28:19,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-03 01:28:19,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-03 01:28:19,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-03 01:28:19,922 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-03 01:28:19,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-03 01:28:19,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-03 01:28:19,922 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-03 01:28:19,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-03 01:28:19,922 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-03 01:28:19,922 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-03 01:28:19,922 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-03 01:28:20,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-03 01:28:20,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-03 01:28:20,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-03 01:28:20,117 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-03 01:28:20,117 INFO L275 PluginConnector]: CDTParser initialized [2023-04-03 01:28:20,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.02.cil.c [2023-04-03 01:28:21,162 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-03 01:28:21,321 INFO L351 CDTParser]: Found 1 translation units. [2023-04-03 01:28:21,321 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2023-04-03 01:28:21,329 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e8575b45/2b274bf66711484ab7e1cd748f525762/FLAG553b6d3d5 [2023-04-03 01:28:21,343 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e8575b45/2b274bf66711484ab7e1cd748f525762 [2023-04-03 01:28:21,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-03 01:28:21,346 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-03 01:28:21,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-03 01:28:21,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-03 01:28:21,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-03 01:28:21,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 01:28:21" (1/1) ... [2023-04-03 01:28:21,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@445d3938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:28:21, skipping insertion in model container [2023-04-03 01:28:21,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 01:28:21" (1/1) ... [2023-04-03 01:28:21,363 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-03 01:28:21,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-03 01:28:21,503 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2023-04-03 01:28:21,549 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-03 01:28:21,558 INFO L203 MainTranslator]: Completed pre-run [2023-04-03 01:28:21,568 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2023-04-03 01:28:21,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-03 01:28:21,604 INFO L208 MainTranslator]: Completed translation [2023-04-03 01:28:21,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:28:21 WrapperNode [2023-04-03 01:28:21,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-03 01:28:21,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-03 01:28:21,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-03 01:28:21,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-03 01:28:21,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:28:21" (1/1) ... [2023-04-03 01:28:21,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:28:21" (1/1) ... [2023-04-03 01:28:21,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:28:21" (1/1) ... [2023-04-03 01:28:21,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:28:21" (1/1) ... [2023-04-03 01:28:21,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:28:21" (1/1) ... [2023-04-03 01:28:21,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:28:21" (1/1) ... [2023-04-03 01:28:21,645 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:28:21" (1/1) ... [2023-04-03 01:28:21,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:28:21" (1/1) ... [2023-04-03 01:28:21,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-03 01:28:21,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-03 01:28:21,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-03 01:28:21,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-03 01:28:21,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:28:21" (1/1) ... [2023-04-03 01:28:21,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-03 01:28:21,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:28:21,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-03 01:28:21,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-03 01:28:21,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-03 01:28:21,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-03 01:28:21,708 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-03 01:28:21,709 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-04-03 01:28:21,709 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2023-04-03 01:28:21,709 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2023-04-03 01:28:21,709 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2023-04-03 01:28:21,709 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2023-04-03 01:28:21,709 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2023-04-03 01:28:21,709 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2023-04-03 01:28:21,709 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-04-03 01:28:21,709 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2023-04-03 01:28:21,709 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-04-03 01:28:21,710 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2023-04-03 01:28:21,710 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-04-03 01:28:21,710 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-04-03 01:28:21,710 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-04-03 01:28:21,710 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-04-03 01:28:21,710 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2023-04-03 01:28:21,710 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2023-04-03 01:28:21,710 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2023-04-03 01:28:21,710 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2023-04-03 01:28:21,710 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2023-04-03 01:28:21,711 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-03 01:28:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-03 01:28:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-03 01:28:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-03 01:28:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-03 01:28:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-03 01:28:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-04-03 01:28:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2023-04-03 01:28:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2023-04-03 01:28:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2023-04-03 01:28:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-04-03 01:28:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure master [2023-04-03 01:28:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2023-04-03 01:28:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2023-04-03 01:28:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-04-03 01:28:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2023-04-03 01:28:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-04-03 01:28:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2023-04-03 01:28:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-04-03 01:28:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-04-03 01:28:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-04-03 01:28:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2023-04-03 01:28:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2023-04-03 01:28:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2023-04-03 01:28:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2023-04-03 01:28:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2023-04-03 01:28:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-03 01:28:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-03 01:28:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-03 01:28:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-03 01:28:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-03 01:28:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-03 01:28:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-03 01:28:21,807 INFO L236 CfgBuilder]: Building ICFG [2023-04-03 01:28:21,809 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-03 01:28:22,212 INFO L277 CfgBuilder]: Performing block encoding [2023-04-03 01:28:22,293 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-03 01:28:22,294 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-04-03 01:28:22,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 01:28:22 BoogieIcfgContainer [2023-04-03 01:28:22,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-03 01:28:22,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-03 01:28:22,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-03 01:28:22,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-03 01:28:22,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.04 01:28:21" (1/3) ... [2023-04-03 01:28:22,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9b2a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 01:28:22, skipping insertion in model container [2023-04-03 01:28:22,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:28:21" (2/3) ... [2023-04-03 01:28:22,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9b2a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 01:28:22, skipping insertion in model container [2023-04-03 01:28:22,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 01:28:22" (3/3) ... [2023-04-03 01:28:22,303 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2023-04-03 01:28:22,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-03 01:28:22,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-03 01:28:22,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-03 01:28:22,377 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@69e40da0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-03 01:28:22,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-03 01:28:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 75 states have internal predecessors, (94), 31 states have call successors, (31), 22 states have call predecessors, (31), 22 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-04-03 01:28:22,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-04-03 01:28:22,390 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:28:22,391 INFO L195 NwaCegarLoop]: 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] [2023-04-03 01:28:22,392 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:28:22,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:28:22,398 INFO L85 PathProgramCache]: Analyzing trace with hash -176831506, now seen corresponding path program 1 times [2023-04-03 01:28:22,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:28:22,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347592763] [2023-04-03 01:28:22,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:22,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:28:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-03 01:28:22,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:28:22,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347592763] [2023-04-03 01:28:22,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347592763] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:28:22,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:28:22,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-03 01:28:22,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746970185] [2023-04-03 01:28:22,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:28:22,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-03 01:28:22,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:28:22,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-03 01:28:22,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-03 01:28:22,922 INFO L87 Difference]: Start difference. First operand has 123 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 75 states have internal predecessors, (94), 31 states have call successors, (31), 22 states have call predecessors, (31), 22 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-04-03 01:28:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:28:23,909 INFO L93 Difference]: Finished difference Result 892 states and 1297 transitions. [2023-04-03 01:28:23,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-03 01:28:23,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 64 [2023-04-03 01:28:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:28:23,925 INFO L225 Difference]: With dead ends: 892 [2023-04-03 01:28:23,925 INFO L226 Difference]: Without dead ends: 737 [2023-04-03 01:28:23,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-04-03 01:28:23,934 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 939 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-03 01:28:23,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 685 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-03 01:28:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2023-04-03 01:28:24,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 711. [2023-04-03 01:28:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 424 states have (on average 1.2877358490566038) internal successors, (546), 447 states have internal predecessors, (546), 168 states have call successors, (168), 128 states have call predecessors, (168), 118 states have return successors, (247), 157 states have call predecessors, (247), 164 states have call successors, (247) [2023-04-03 01:28:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 961 transitions. [2023-04-03 01:28:24,064 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 961 transitions. Word has length 64 [2023-04-03 01:28:24,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:28:24,064 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 961 transitions. [2023-04-03 01:28:24,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-04-03 01:28:24,065 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 961 transitions. [2023-04-03 01:28:24,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-04-03 01:28:24,068 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:28:24,068 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-03 01:28:24,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-03 01:28:24,069 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:28:24,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:28:24,070 INFO L85 PathProgramCache]: Analyzing trace with hash -571091947, now seen corresponding path program 1 times [2023-04-03 01:28:24,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:28:24,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204405236] [2023-04-03 01:28:24,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:24,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:28:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-03 01:28:24,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:28:24,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204405236] [2023-04-03 01:28:24,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204405236] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:28:24,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:28:24,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-03 01:28:24,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244817615] [2023-04-03 01:28:24,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:28:24,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-03 01:28:24,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:28:24,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-03 01:28:24,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-04-03 01:28:24,336 INFO L87 Difference]: Start difference. First operand 711 states and 961 transitions. Second operand has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-04-03 01:28:24,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:28:24,911 INFO L93 Difference]: Finished difference Result 2354 states and 3547 transitions. [2023-04-03 01:28:24,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-03 01:28:24,911 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 78 [2023-04-03 01:28:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:28:24,925 INFO L225 Difference]: With dead ends: 2354 [2023-04-03 01:28:24,925 INFO L226 Difference]: Without dead ends: 1660 [2023-04-03 01:28:24,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2023-04-03 01:28:24,935 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 393 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-03 01:28:24,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 408 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-03 01:28:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2023-04-03 01:28:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1524. [2023-04-03 01:28:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 934 states have (on average 1.3126338329764453) internal successors, (1226), 1008 states have internal predecessors, (1226), 336 states have call successors, (336), 231 states have call predecessors, (336), 253 states have return successors, (648), 340 states have call predecessors, (648), 332 states have call successors, (648) [2023-04-03 01:28:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2210 transitions. [2023-04-03 01:28:25,127 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 2210 transitions. Word has length 78 [2023-04-03 01:28:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:28:25,128 INFO L495 AbstractCegarLoop]: Abstraction has 1524 states and 2210 transitions. [2023-04-03 01:28:25,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-04-03 01:28:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 2210 transitions. [2023-04-03 01:28:25,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-04-03 01:28:25,135 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:28:25,135 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-03 01:28:25,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-03 01:28:25,136 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:28:25,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:28:25,138 INFO L85 PathProgramCache]: Analyzing trace with hash -381762039, now seen corresponding path program 1 times [2023-04-03 01:28:25,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:28:25,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691890774] [2023-04-03 01:28:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:25,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:28:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-03 01:28:25,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:28:25,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691890774] [2023-04-03 01:28:25,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691890774] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:28:25,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:28:25,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-03 01:28:25,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710986480] [2023-04-03 01:28:25,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:28:25,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-03 01:28:25,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:28:25,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-03 01:28:25,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-04-03 01:28:25,375 INFO L87 Difference]: Start difference. First operand 1524 states and 2210 transitions. Second operand has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-04-03 01:28:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:28:26,141 INFO L93 Difference]: Finished difference Result 5366 states and 9493 transitions. [2023-04-03 01:28:26,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-03 01:28:26,143 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 80 [2023-04-03 01:28:26,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:28:26,171 INFO L225 Difference]: With dead ends: 5366 [2023-04-03 01:28:26,172 INFO L226 Difference]: Without dead ends: 3859 [2023-04-03 01:28:26,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2023-04-03 01:28:26,191 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 408 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-03 01:28:26,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 414 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-03 01:28:26,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3859 states. [2023-04-03 01:28:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3859 to 3230. [2023-04-03 01:28:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3230 states, 2061 states have (on average 1.3231441048034935) internal successors, (2727), 2234 states have internal predecessors, (2727), 659 states have call successors, (659), 428 states have call predecessors, (659), 509 states have return successors, (1748), 661 states have call predecessors, (1748), 655 states have call successors, (1748) [2023-04-03 01:28:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 5134 transitions. [2023-04-03 01:28:26,578 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 5134 transitions. Word has length 80 [2023-04-03 01:28:26,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:28:26,579 INFO L495 AbstractCegarLoop]: Abstraction has 3230 states and 5134 transitions. [2023-04-03 01:28:26,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-04-03 01:28:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 5134 transitions. [2023-04-03 01:28:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-04-03 01:28:26,582 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:28:26,582 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-03 01:28:26,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-03 01:28:26,583 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:28:26,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:28:26,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2068213399, now seen corresponding path program 1 times [2023-04-03 01:28:26,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:28:26,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307832562] [2023-04-03 01:28:26,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:26,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:28:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-03 01:28:26,664 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:28:26,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307832562] [2023-04-03 01:28:26,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307832562] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:28:26,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:28:26,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-03 01:28:26,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081606579] [2023-04-03 01:28:26,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:28:26,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-03 01:28:26,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:28:26,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-03 01:28:26,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-03 01:28:26,667 INFO L87 Difference]: Start difference. First operand 3230 states and 5134 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-04-03 01:28:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:28:26,980 INFO L93 Difference]: Finished difference Result 5018 states and 8255 transitions. [2023-04-03 01:28:26,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-03 01:28:26,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 82 [2023-04-03 01:28:26,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:28:27,002 INFO L225 Difference]: With dead ends: 5018 [2023-04-03 01:28:27,002 INFO L226 Difference]: Without dead ends: 3940 [2023-04-03 01:28:27,012 INFO L412 NwaCegarLoop]: 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 [2023-04-03 01:28:27,017 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 67 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:28:27,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 311 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:28:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2023-04-03 01:28:27,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 3858. [2023-04-03 01:28:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3858 states, 2482 states have (on average 1.3158742949234488) internal successors, (3266), 2702 states have internal predecessors, (3266), 778 states have call successors, (778), 515 states have call predecessors, (778), 597 states have return successors, (2181), 747 states have call predecessors, (2181), 774 states have call successors, (2181) [2023-04-03 01:28:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 6225 transitions. [2023-04-03 01:28:27,368 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 6225 transitions. Word has length 82 [2023-04-03 01:28:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:28:27,372 INFO L495 AbstractCegarLoop]: Abstraction has 3858 states and 6225 transitions. [2023-04-03 01:28:27,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-04-03 01:28:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 6225 transitions. [2023-04-03 01:28:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-04-03 01:28:27,380 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:28:27,380 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-03 01:28:27,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-03 01:28:27,381 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:28:27,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:28:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1571285458, now seen corresponding path program 1 times [2023-04-03 01:28:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:28:27,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932108356] [2023-04-03 01:28:27,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:27,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:28:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-04-03 01:28:27,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:28:27,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932108356] [2023-04-03 01:28:27,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932108356] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:28:27,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:28:27,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-03 01:28:27,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979748569] [2023-04-03 01:28:27,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:28:27,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-03 01:28:27,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:28:27,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-03 01:28:27,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-03 01:28:27,517 INFO L87 Difference]: Start difference. First operand 3858 states and 6225 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-04-03 01:28:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:28:27,783 INFO L93 Difference]: Finished difference Result 5388 states and 8840 transitions. [2023-04-03 01:28:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-03 01:28:27,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 100 [2023-04-03 01:28:27,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:28:27,802 INFO L225 Difference]: With dead ends: 5388 [2023-04-03 01:28:27,802 INFO L226 Difference]: Without dead ends: 3518 [2023-04-03 01:28:27,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-03 01:28:27,818 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 106 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:28:27,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 241 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:28:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3518 states. [2023-04-03 01:28:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3518 to 3434. [2023-04-03 01:28:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3434 states, 2211 states have (on average 1.3021257349615558) internal successors, (2879), 2411 states have internal predecessors, (2879), 693 states have call successors, (693), 459 states have call predecessors, (693), 529 states have return successors, (1756), 662 states have call predecessors, (1756), 689 states have call successors, (1756) [2023-04-03 01:28:28,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 5328 transitions. [2023-04-03 01:28:28,113 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 5328 transitions. Word has length 100 [2023-04-03 01:28:28,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:28:28,113 INFO L495 AbstractCegarLoop]: Abstraction has 3434 states and 5328 transitions. [2023-04-03 01:28:28,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-04-03 01:28:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 5328 transitions. [2023-04-03 01:28:28,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-04-03 01:28:28,119 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:28:28,119 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:28:28,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-03 01:28:28,119 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:28:28,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:28:28,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1468801646, now seen corresponding path program 1 times [2023-04-03 01:28:28,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:28:28,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320072030] [2023-04-03 01:28:28,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:28,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:28:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-04-03 01:28:28,254 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:28:28,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320072030] [2023-04-03 01:28:28,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320072030] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:28:28,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:28:28,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-03 01:28:28,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681617257] [2023-04-03 01:28:28,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:28:28,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-03 01:28:28,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:28:28,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-03 01:28:28,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-03 01:28:28,257 INFO L87 Difference]: Start difference. First operand 3434 states and 5328 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2023-04-03 01:28:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:28:29,110 INFO L93 Difference]: Finished difference Result 10336 states and 18285 transitions. [2023-04-03 01:28:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-03 01:28:29,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 115 [2023-04-03 01:28:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:28:29,152 INFO L225 Difference]: With dead ends: 10336 [2023-04-03 01:28:29,152 INFO L226 Difference]: Without dead ends: 6918 [2023-04-03 01:28:29,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-04-03 01:28:29,185 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 271 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-03 01:28:29,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 293 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-03 01:28:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6918 states. [2023-04-03 01:28:29,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6918 to 6596. [2023-04-03 01:28:29,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6596 states, 4359 states have (on average 1.3092452397338838) internal successors, (5707), 4822 states have internal predecessors, (5707), 1295 states have call successors, (1295), 816 states have call predecessors, (1295), 941 states have return successors, (4032), 1158 states have call predecessors, (4032), 1291 states have call successors, (4032) [2023-04-03 01:28:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6596 states to 6596 states and 11034 transitions. [2023-04-03 01:28:29,762 INFO L78 Accepts]: Start accepts. Automaton has 6596 states and 11034 transitions. Word has length 115 [2023-04-03 01:28:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:28:29,762 INFO L495 AbstractCegarLoop]: Abstraction has 6596 states and 11034 transitions. [2023-04-03 01:28:29,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2023-04-03 01:28:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 6596 states and 11034 transitions. [2023-04-03 01:28:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-04-03 01:28:29,765 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:28:29,766 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:28:29,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-03 01:28:29,766 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:28:29,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:28:29,766 INFO L85 PathProgramCache]: Analyzing trace with hash -732243116, now seen corresponding path program 1 times [2023-04-03 01:28:29,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:28:29,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104355651] [2023-04-03 01:28:29,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:29,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:28:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-03 01:28:30,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:28:30,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104355651] [2023-04-03 01:28:30,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104355651] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:28:30,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:28:30,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-04-03 01:28:30,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465983424] [2023-04-03 01:28:30,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:28:30,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-03 01:28:30,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:28:30,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-03 01:28:30,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-04-03 01:28:30,288 INFO L87 Difference]: Start difference. First operand 6596 states and 11034 transitions. Second operand has 13 states, 8 states have (on average 7.0) internal successors, (56), 10 states have internal predecessors, (56), 6 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2023-04-03 01:28:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:28:32,941 INFO L93 Difference]: Finished difference Result 22201 states and 44574 transitions. [2023-04-03 01:28:32,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-04-03 01:28:32,942 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 8 states have (on average 7.0) internal successors, (56), 10 states have internal predecessors, (56), 6 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) Word has length 116 [2023-04-03 01:28:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:28:33,048 INFO L225 Difference]: With dead ends: 22201 [2023-04-03 01:28:33,049 INFO L226 Difference]: Without dead ends: 16253 [2023-04-03 01:28:33,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=915, Unknown=0, NotChecked=0, Total=1190 [2023-04-03 01:28:33,118 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1479 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 1011 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1011 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:28:33,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 168 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1011 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-03 01:28:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16253 states. [2023-04-03 01:28:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16253 to 14176. [2023-04-03 01:28:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14176 states, 9617 states have (on average 1.3088281168763647) internal successors, (12587), 10574 states have internal predecessors, (12587), 2596 states have call successors, (2596), 1653 states have call predecessors, (2596), 1962 states have return successors, (8352), 2348 states have call predecessors, (8352), 2592 states have call successors, (8352) [2023-04-03 01:28:34,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14176 states to 14176 states and 23535 transitions. [2023-04-03 01:28:34,798 INFO L78 Accepts]: Start accepts. Automaton has 14176 states and 23535 transitions. Word has length 116 [2023-04-03 01:28:34,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:28:34,800 INFO L495 AbstractCegarLoop]: Abstraction has 14176 states and 23535 transitions. [2023-04-03 01:28:34,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 8 states have (on average 7.0) internal successors, (56), 10 states have internal predecessors, (56), 6 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2023-04-03 01:28:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 14176 states and 23535 transitions. [2023-04-03 01:28:34,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-04-03 01:28:34,805 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:28:34,805 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:28:34,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-04-03 01:28:34,806 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:28:34,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:28:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1329570267, now seen corresponding path program 1 times [2023-04-03 01:28:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:28:34,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730639072] [2023-04-03 01:28:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:34,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:28:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-03 01:28:35,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:28:35,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730639072] [2023-04-03 01:28:35,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730639072] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:28:35,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:28:35,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-03 01:28:35,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048503572] [2023-04-03 01:28:35,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:28:35,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-03 01:28:35,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:28:35,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-03 01:28:35,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-04-03 01:28:35,016 INFO L87 Difference]: Start difference. First operand 14176 states and 23535 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2023-04-03 01:28:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:28:36,628 INFO L93 Difference]: Finished difference Result 21111 states and 35187 transitions. [2023-04-03 01:28:36,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-03 01:28:36,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 117 [2023-04-03 01:28:36,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:28:36,727 INFO L225 Difference]: With dead ends: 21111 [2023-04-03 01:28:36,727 INFO L226 Difference]: Without dead ends: 17723 [2023-04-03 01:28:36,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-04-03 01:28:36,759 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 149 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-03 01:28:36,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 559 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-03 01:28:36,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17723 states. [2023-04-03 01:28:38,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17723 to 17650. [2023-04-03 01:28:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17650 states, 12000 states have (on average 1.301) internal successors, (15612), 13224 states have internal predecessors, (15612), 3244 states have call successors, (3244), 2000 states have call predecessors, (3244), 2405 states have return successors, (10234), 2928 states have call predecessors, (10234), 3240 states have call successors, (10234) [2023-04-03 01:28:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17650 states to 17650 states and 29090 transitions. [2023-04-03 01:28:38,603 INFO L78 Accepts]: Start accepts. Automaton has 17650 states and 29090 transitions. Word has length 117 [2023-04-03 01:28:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:28:38,604 INFO L495 AbstractCegarLoop]: Abstraction has 17650 states and 29090 transitions. [2023-04-03 01:28:38,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2023-04-03 01:28:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 17650 states and 29090 transitions. [2023-04-03 01:28:38,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-04-03 01:28:38,608 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:28:38,608 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:28:38,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-04-03 01:28:38,608 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:28:38,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:28:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1511750510, now seen corresponding path program 1 times [2023-04-03 01:28:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:28:38,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874120687] [2023-04-03 01:28:38,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:38,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:28:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:38,669 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-03 01:28:38,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:28:38,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874120687] [2023-04-03 01:28:38,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874120687] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:28:38,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908481984] [2023-04-03 01:28:38,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:38,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:28:38,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:28:38,673 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:28:38,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-03 01:28:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:38,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 2 conjunts are in the unsatisfiable core [2023-04-03 01:28:38,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:28:38,845 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-03 01:28:38,845 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-03 01:28:38,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908481984] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:28:38,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-03 01:28:38,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-04-03 01:28:38,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518493284] [2023-04-03 01:28:38,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:28:38,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-03 01:28:38,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:28:38,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-03 01:28:38,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-04-03 01:28:38,847 INFO L87 Difference]: Start difference. First operand 17650 states and 29090 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-04-03 01:28:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:28:40,624 INFO L93 Difference]: Finished difference Result 32242 states and 57030 transitions. [2023-04-03 01:28:40,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-03 01:28:40,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 119 [2023-04-03 01:28:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:28:40,731 INFO L225 Difference]: With dead ends: 32242 [2023-04-03 01:28:40,731 INFO L226 Difference]: Without dead ends: 17896 [2023-04-03 01:28:40,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-04-03 01:28:40,844 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 52 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:28:40,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 293 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:28:40,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17896 states. [2023-04-03 01:28:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17896 to 16656. [2023-04-03 01:28:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16656 states, 11223 states have (on average 1.2628530695892364) internal successors, (14173), 12184 states have internal predecessors, (14173), 3015 states have call successors, (3015), 2124 states have call predecessors, (3015), 2417 states have return successors, (8376), 2809 states have call predecessors, (8376), 3011 states have call successors, (8376) [2023-04-03 01:28:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16656 states to 16656 states and 25564 transitions. [2023-04-03 01:28:42,383 INFO L78 Accepts]: Start accepts. Automaton has 16656 states and 25564 transitions. Word has length 119 [2023-04-03 01:28:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:28:42,383 INFO L495 AbstractCegarLoop]: Abstraction has 16656 states and 25564 transitions. [2023-04-03 01:28:42,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-04-03 01:28:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 16656 states and 25564 transitions. [2023-04-03 01:28:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-04-03 01:28:42,395 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:28:42,395 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:28:42,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-03 01:28:42,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:28:42,600 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:28:42,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:28:42,601 INFO L85 PathProgramCache]: Analyzing trace with hash -544259481, now seen corresponding path program 1 times [2023-04-03 01:28:42,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:28:42,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748337479] [2023-04-03 01:28:42,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:42,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:28:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-04-03 01:28:42,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:28:42,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748337479] [2023-04-03 01:28:42,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748337479] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:28:42,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431025570] [2023-04-03 01:28:42,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:42,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:28:42,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:28:42,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:28:42,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-03 01:28:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:42,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-03 01:28:42,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:28:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-03 01:28:42,874 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-03 01:28:42,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431025570] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:28:42,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-03 01:28:42,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2023-04-03 01:28:42,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808286569] [2023-04-03 01:28:42,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:28:42,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-03 01:28:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:28:42,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-03 01:28:42,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-03 01:28:42,875 INFO L87 Difference]: Start difference. First operand 16656 states and 25564 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-04-03 01:28:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:28:44,246 INFO L93 Difference]: Finished difference Result 28646 states and 47550 transitions. [2023-04-03 01:28:44,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-03 01:28:44,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 154 [2023-04-03 01:28:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:28:44,318 INFO L225 Difference]: With dead ends: 28646 [2023-04-03 01:28:44,318 INFO L226 Difference]: Without dead ends: 15294 [2023-04-03 01:28:44,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-03 01:28:44,411 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 88 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:28:44,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 294 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:28:44,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15294 states. [2023-04-03 01:28:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15294 to 14778. [2023-04-03 01:28:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14778 states, 9909 states have (on average 1.2425068119891007) internal successors, (12312), 10688 states have internal predecessors, (12312), 2718 states have call successors, (2718), 1961 states have call predecessors, (2718), 2150 states have return successors, (5774), 2509 states have call predecessors, (5774), 2714 states have call successors, (5774) [2023-04-03 01:28:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14778 states to 14778 states and 20804 transitions. [2023-04-03 01:28:46,042 INFO L78 Accepts]: Start accepts. Automaton has 14778 states and 20804 transitions. Word has length 154 [2023-04-03 01:28:46,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:28:46,043 INFO L495 AbstractCegarLoop]: Abstraction has 14778 states and 20804 transitions. [2023-04-03 01:28:46,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-04-03 01:28:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 14778 states and 20804 transitions. [2023-04-03 01:28:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-04-03 01:28:46,052 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:28:46,052 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:28:46,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-03 01:28:46,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-03 01:28:46,257 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:28:46,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:28:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash -306381369, now seen corresponding path program 1 times [2023-04-03 01:28:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:28:46,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667269928] [2023-04-03 01:28:46,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:28:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-04-03 01:28:46,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:28:46,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667269928] [2023-04-03 01:28:46,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667269928] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:28:46,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:28:46,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-03 01:28:46,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10205620] [2023-04-03 01:28:46,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:28:46,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-03 01:28:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:28:46,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-03 01:28:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-03 01:28:46,323 INFO L87 Difference]: Start difference. First operand 14778 states and 20804 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-04-03 01:28:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:28:47,638 INFO L93 Difference]: Finished difference Result 26117 states and 39443 transitions. [2023-04-03 01:28:47,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-03 01:28:47,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 154 [2023-04-03 01:28:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:28:47,707 INFO L225 Difference]: With dead ends: 26117 [2023-04-03 01:28:47,707 INFO L226 Difference]: Without dead ends: 15233 [2023-04-03 01:28:47,767 INFO L412 NwaCegarLoop]: 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 [2023-04-03 01:28:47,767 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 150 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:28:47,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 216 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:28:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15233 states. [2023-04-03 01:28:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15233 to 14877. [2023-04-03 01:28:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14877 states, 10011 states have (on average 1.222255518929178) internal successors, (12236), 10760 states have internal predecessors, (12236), 2683 states have call successors, (2683), 1973 states have call predecessors, (2683), 2182 states have return successors, (5654), 2522 states have call predecessors, (5654), 2679 states have call successors, (5654) [2023-04-03 01:28:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14877 states to 14877 states and 20573 transitions. [2023-04-03 01:28:49,103 INFO L78 Accepts]: Start accepts. Automaton has 14877 states and 20573 transitions. Word has length 154 [2023-04-03 01:28:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:28:49,103 INFO L495 AbstractCegarLoop]: Abstraction has 14877 states and 20573 transitions. [2023-04-03 01:28:49,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-04-03 01:28:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 14877 states and 20573 transitions. [2023-04-03 01:28:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-04-03 01:28:49,113 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:28:49,113 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:28:49,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-04-03 01:28:49,114 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:28:49,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:28:49,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1097477808, now seen corresponding path program 1 times [2023-04-03 01:28:49,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:28:49,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279945275] [2023-04-03 01:28:49,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:49,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:28:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-04-03 01:28:49,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:28:49,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279945275] [2023-04-03 01:28:49,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279945275] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:28:49,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028079556] [2023-04-03 01:28:49,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:49,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:28:49,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:28:49,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:28:49,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-03 01:28:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:49,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-03 01:28:49,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:28:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-04-03 01:28:49,559 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-03 01:28:49,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028079556] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:28:49,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-03 01:28:49,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2023-04-03 01:28:49,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730154418] [2023-04-03 01:28:49,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:28:49,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-03 01:28:49,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:28:49,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-03 01:28:49,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-04-03 01:28:49,561 INFO L87 Difference]: Start difference. First operand 14877 states and 20573 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2023-04-03 01:28:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:28:50,843 INFO L93 Difference]: Finished difference Result 24597 states and 35547 transitions. [2023-04-03 01:28:50,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-03 01:28:50,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 163 [2023-04-03 01:28:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:28:50,911 INFO L225 Difference]: With dead ends: 24597 [2023-04-03 01:28:50,911 INFO L226 Difference]: Without dead ends: 14258 [2023-04-03 01:28:50,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-04-03 01:28:50,959 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 106 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:28:50,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 883 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:28:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14258 states. [2023-04-03 01:28:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14258 to 14055. [2023-04-03 01:28:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14055 states, 9370 states have (on average 1.2024546424759872) internal successors, (11267), 10036 states have internal predecessors, (11267), 2566 states have call successors, (2566), 1945 states have call predecessors, (2566), 2118 states have return successors, (5216), 2411 states have call predecessors, (5216), 2562 states have call successors, (5216) [2023-04-03 01:28:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14055 states to 14055 states and 19049 transitions. [2023-04-03 01:28:52,173 INFO L78 Accepts]: Start accepts. Automaton has 14055 states and 19049 transitions. Word has length 163 [2023-04-03 01:28:52,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:28:52,174 INFO L495 AbstractCegarLoop]: Abstraction has 14055 states and 19049 transitions. [2023-04-03 01:28:52,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2023-04-03 01:28:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 14055 states and 19049 transitions. [2023-04-03 01:28:52,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-04-03 01:28:52,184 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:28:52,184 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:28:52,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-03 01:28:52,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:28:52,401 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:28:52,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:28:52,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1984995291, now seen corresponding path program 1 times [2023-04-03 01:28:52,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:28:52,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933602924] [2023-04-03 01:28:52,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:52,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:28:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-04-03 01:28:52,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:28:52,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933602924] [2023-04-03 01:28:52,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933602924] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:28:52,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375402620] [2023-04-03 01:28:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:52,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:28:52,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:28:52,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:28:52,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-03 01:28:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:52,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-03 01:28:52,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:28:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-04-03 01:28:52,811 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-03 01:28:52,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375402620] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:28:52,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-03 01:28:52,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2023-04-03 01:28:52,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724963517] [2023-04-03 01:28:52,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:28:52,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-03 01:28:52,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:28:52,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-03 01:28:52,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-04-03 01:28:52,815 INFO L87 Difference]: Start difference. First operand 14055 states and 19049 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2023-04-03 01:28:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:28:54,514 INFO L93 Difference]: Finished difference Result 26468 states and 37042 transitions. [2023-04-03 01:28:54,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-03 01:28:54,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 155 [2023-04-03 01:28:54,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:28:54,602 INFO L225 Difference]: With dead ends: 26468 [2023-04-03 01:28:54,602 INFO L226 Difference]: Without dead ends: 17321 [2023-04-03 01:28:54,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-04-03 01:28:54,651 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 138 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:28:54,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 322 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:28:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17321 states. [2023-04-03 01:28:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17321 to 15458. [2023-04-03 01:28:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15458 states, 10331 states have (on average 1.1997870486884135) internal successors, (12395), 11116 states have internal predecessors, (12395), 2717 states have call successors, (2717), 2166 states have call predecessors, (2717), 2409 states have return successors, (5673), 2573 states have call predecessors, (5673), 2713 states have call successors, (5673) [2023-04-03 01:28:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15458 states to 15458 states and 20785 transitions. [2023-04-03 01:28:56,248 INFO L78 Accepts]: Start accepts. Automaton has 15458 states and 20785 transitions. Word has length 155 [2023-04-03 01:28:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:28:56,249 INFO L495 AbstractCegarLoop]: Abstraction has 15458 states and 20785 transitions. [2023-04-03 01:28:56,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2023-04-03 01:28:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 15458 states and 20785 transitions. [2023-04-03 01:28:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-04-03 01:28:56,259 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:28:56,259 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-04-03 01:28:56,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-03 01:28:56,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:28:56,465 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:28:56,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:28:56,466 INFO L85 PathProgramCache]: Analyzing trace with hash 112685629, now seen corresponding path program 1 times [2023-04-03 01:28:56,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:28:56,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950575229] [2023-04-03 01:28:56,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:56,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:28:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 31 proven. 39 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-04-03 01:28:56,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:28:56,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950575229] [2023-04-03 01:28:56,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950575229] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:28:56,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834590287] [2023-04-03 01:28:56,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:56,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:28:56,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:28:56,928 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:28:56,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-03 01:28:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:57,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 11 conjunts are in the unsatisfiable core [2023-04-03 01:28:57,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:28:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-04-03 01:28:57,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-03 01:28:57,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834590287] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:28:57,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-03 01:28:57,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 21 [2023-04-03 01:28:57,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538848466] [2023-04-03 01:28:57,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:28:57,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-03 01:28:57,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:28:57,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-03 01:28:57,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2023-04-03 01:28:57,143 INFO L87 Difference]: Start difference. First operand 15458 states and 20785 transitions. Second operand has 6 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 3 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2023-04-03 01:28:58,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:28:58,404 INFO L93 Difference]: Finished difference Result 28913 states and 39415 transitions. [2023-04-03 01:28:58,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-03 01:28:58,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 3 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 227 [2023-04-03 01:28:58,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:28:58,456 INFO L225 Difference]: With dead ends: 28913 [2023-04-03 01:28:58,456 INFO L226 Difference]: Without dead ends: 13530 [2023-04-03 01:28:58,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2023-04-03 01:28:58,499 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 88 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:28:58,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 674 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:28:58,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13530 states. [2023-04-03 01:28:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13530 to 10152. [2023-04-03 01:28:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10152 states, 6925 states have (on average 1.2018772563176896) internal successors, (8323), 7441 states have internal predecessors, (8323), 1746 states have call successors, (1746), 1402 states have call predecessors, (1746), 1480 states have return successors, (2573), 1623 states have call predecessors, (2573), 1742 states have call successors, (2573) [2023-04-03 01:28:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10152 states to 10152 states and 12642 transitions. [2023-04-03 01:28:59,400 INFO L78 Accepts]: Start accepts. Automaton has 10152 states and 12642 transitions. Word has length 227 [2023-04-03 01:28:59,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:28:59,401 INFO L495 AbstractCegarLoop]: Abstraction has 10152 states and 12642 transitions. [2023-04-03 01:28:59,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 3 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2023-04-03 01:28:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 10152 states and 12642 transitions. [2023-04-03 01:28:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-04-03 01:28:59,405 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:28:59,406 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:28:59,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-03 01:28:59,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-03 01:28:59,611 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:28:59,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:28:59,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1049706379, now seen corresponding path program 1 times [2023-04-03 01:28:59,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:28:59,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168237862] [2023-04-03 01:28:59,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:59,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:28:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:59,795 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-04-03 01:28:59,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:28:59,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168237862] [2023-04-03 01:28:59,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168237862] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:28:59,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590895784] [2023-04-03 01:28:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:28:59,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:28:59,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:28:59,797 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:28:59,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-03 01:28:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:28:59,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 17 conjunts are in the unsatisfiable core [2023-04-03 01:28:59,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:29:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-04-03 01:29:00,035 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-03 01:29:00,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590895784] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:29:00,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-03 01:29:00,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 11 [2023-04-03 01:29:00,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437612814] [2023-04-03 01:29:00,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:29:00,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-03 01:29:00,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:29:00,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-03 01:29:00,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-04-03 01:29:00,037 INFO L87 Difference]: Start difference. First operand 10152 states and 12642 transitions. Second operand has 7 states, 5 states have (on average 17.2) internal successors, (86), 7 states have internal predecessors, (86), 5 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-04-03 01:29:01,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:29:01,458 INFO L93 Difference]: Finished difference Result 22793 states and 29345 transitions. [2023-04-03 01:29:01,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-03 01:29:01,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.2) internal successors, (86), 7 states have internal predecessors, (86), 5 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 165 [2023-04-03 01:29:01,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:29:01,505 INFO L225 Difference]: With dead ends: 22793 [2023-04-03 01:29:01,505 INFO L226 Difference]: Without dead ends: 12802 [2023-04-03 01:29:01,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-04-03 01:29:01,538 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 390 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-03 01:29:01,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 218 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-03 01:29:01,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2023-04-03 01:29:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 12648. [2023-04-03 01:29:02,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12648 states, 8688 states have (on average 1.1858885819521179) internal successors, (10303), 9335 states have internal predecessors, (10303), 2164 states have call successors, (2164), 1664 states have call predecessors, (2164), 1795 states have return successors, (3231), 2041 states have call predecessors, (3231), 2160 states have call successors, (3231) [2023-04-03 01:29:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12648 states to 12648 states and 15698 transitions. [2023-04-03 01:29:02,776 INFO L78 Accepts]: Start accepts. Automaton has 12648 states and 15698 transitions. Word has length 165 [2023-04-03 01:29:02,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:29:02,777 INFO L495 AbstractCegarLoop]: Abstraction has 12648 states and 15698 transitions. [2023-04-03 01:29:02,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.2) internal successors, (86), 7 states have internal predecessors, (86), 5 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-04-03 01:29:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 12648 states and 15698 transitions. [2023-04-03 01:29:02,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-04-03 01:29:02,782 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:29:02,782 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:29:02,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-03 01:29:02,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-04-03 01:29:02,997 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:29:02,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:29:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash 179597163, now seen corresponding path program 1 times [2023-04-03 01:29:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:29:02,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794637651] [2023-04-03 01:29:02,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:29:02,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:29:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-03 01:29:03,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-03 01:29:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-03 01:29:03,078 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-04-03 01:29:03,079 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-03 01:29:03,080 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-03 01:29:03,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-04-03 01:29:03,084 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:29:03,087 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-03 01:29:03,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.04 01:29:03 BoogieIcfgContainer [2023-04-03 01:29:03,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-03 01:29:03,179 INFO L158 Benchmark]: Toolchain (without parser) took 41832.59ms. Allocated memory was 254.8MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 210.8MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 409.9MB. Max. memory is 8.0GB. [2023-04-03 01:29:03,179 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 174.1MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-03 01:29:03,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.84ms. Allocated memory is still 254.8MB. Free memory was 210.8MB in the beginning and 197.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-04-03 01:29:03,179 INFO L158 Benchmark]: Boogie Preprocessor took 45.42ms. Allocated memory is still 254.8MB. Free memory was 197.2MB in the beginning and 195.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-03 01:29:03,179 INFO L158 Benchmark]: RCFGBuilder took 644.73ms. Allocated memory is still 254.8MB. Free memory was 195.1MB in the beginning and 158.0MB in the end (delta: 37.0MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2023-04-03 01:29:03,179 INFO L158 Benchmark]: TraceAbstraction took 40879.99ms. Allocated memory was 254.8MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 157.3MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 356.4MB. Max. memory is 8.0GB. [2023-04-03 01:29:03,180 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 174.1MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.84ms. Allocated memory is still 254.8MB. Free memory was 210.8MB in the beginning and 197.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.42ms. Allocated memory is still 254.8MB. Free memory was 197.2MB in the beginning and 195.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 644.73ms. Allocated memory is still 254.8MB. Free memory was 195.1MB in the beginning and 158.0MB in the end (delta: 37.0MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 40879.99ms. Allocated memory was 254.8MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 157.3MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 356.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L573] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0] [L577] CALL init_model() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0] [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 [L577] RET init_model() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L578] CALL start_simulation() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L221] COND TRUE m_i == 1 [L222] m_st = 0 [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 [L522] RET init_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L523] CALL fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) [L339] COND FALSE !(T1_E == 0) [L344] COND FALSE !(T2_E == 0) [L349] COND FALSE !(E_1 == 0) [L354] COND FALSE !(E_2 == 0) [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L403] CALL, EXPR is_master_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L153] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, is_master_triggered()=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L172] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, is_transmit1_triggered()=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L191] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, is_transmit2_triggered()=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) [L524] RET activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) [L372] COND FALSE !(T1_E == 1) [L377] COND FALSE !(T2_E == 1) [L382] COND FALSE !(E_1 == 1) [L387] COND FALSE !(E_2 == 1) [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 [L531] kernel_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, kernel_st=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L532] CALL eval() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, exists_runnable_thread()=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L301] CALL transmit1() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0] [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 [L301] RET transmit1() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L315] CALL transmit2() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1] [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 [L136] t2_pc = 1 [L137] t2_st = 2 [L315] RET transmit2() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=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 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, exists_runnable_thread()=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L287] CALL master() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L403] CALL, EXPR is_master_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L153] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_master_triggered()=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L172] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_transmit1_triggered()=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L419] CALL, EXPR is_transmit2_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L191] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_transmit2_triggered()=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) [L435] RET activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L301] CALL transmit1() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L403] CALL, EXPR is_master_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L153] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_master_triggered()=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L172] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_transmit1_triggered()=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L191] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, is_transmit2_triggered()=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 [L435] RET activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 [L301] RET transmit1() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1] [L315] CALL transmit2() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L142] CALL error() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 24 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.7s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4924 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4824 mSDsluCounter, 5979 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3768 mSDsCounter, 2371 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5172 IncrementalHoareTripleChecker+Invalid, 7543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2371 mSolverCounterUnsat, 2211 mSDtfsCounter, 5172 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1215 GetRequests, 1059 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17650occurred in iteration=8, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 11139 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 3028 NumberOfCodeBlocks, 3028 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2851 ConstructedInterpolants, 0 QuantifiedInterpolants, 4647 SizeOfPredicates, 7 NumberOfNonLiveVariables, 4850 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 1447/1546 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-04-03 01:29:03,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...