./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 06:35:15,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:35:15,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:35:15,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:35:15,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:35:15,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:35:15,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:35:15,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:35:15,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:35:15,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:35:15,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:35:15,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:35:15,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:35:15,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:35:15,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:35:15,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:35:15,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:35:15,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:35:15,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:35:15,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:35:15,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:35:15,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:35:15,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:35:15,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:35:15,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:35:15,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:35:15,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:35:15,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:35:15,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:35:15,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:35:15,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:35:15,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:35:15,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:35:15,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:35:15,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:35:15,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:35:15,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:35:15,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:35:15,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:35:15,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:35:15,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:35:15,955 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 06:35:16,000 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:35:16,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:35:16,002 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:35:16,002 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:35:16,003 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:35:16,003 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:35:16,004 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:35:16,004 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:35:16,004 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:35:16,004 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 06:35:16,005 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:35:16,006 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:35:16,006 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 06:35:16,006 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 06:35:16,006 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:35:16,007 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 06:35:16,007 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 06:35:16,007 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 06:35:16,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:35:16,009 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 06:35:16,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:35:16,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 06:35:16,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:35:16,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 06:35:16,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:35:16,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 06:35:16,018 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 06:35:16,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 06:35:16,019 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:35:16,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 06:35:16,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:35:16,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:35:16,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:35:16,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:35:16,021 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 06:35:16,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:35:16,021 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 06:35:16,022 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 06:35:16,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 06:35:16,022 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 06:35:16,022 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:35:16,022 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 [2022-11-19 06:35:16,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:35:16,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:35:16,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:35:16,366 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:35:16,367 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:35:16,369 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-19 06:35:16,445 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/data/7b5019f23/5181e98974dd4e198d6dc1f478d0837e/FLAG9098536cd [2022-11-19 06:35:17,148 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:35:17,148 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-19 06:35:17,173 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/data/7b5019f23/5181e98974dd4e198d6dc1f478d0837e/FLAG9098536cd [2022-11-19 06:35:17,415 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/data/7b5019f23/5181e98974dd4e198d6dc1f478d0837e [2022-11-19 06:35:17,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:35:17,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:35:17,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:35:17,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:35:17,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:35:17,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:35:17" (1/1) ... [2022-11-19 06:35:17,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36128a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:17, skipping insertion in model container [2022-11-19 06:35:17,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:35:17" (1/1) ... [2022-11-19 06:35:17,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:35:17,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:35:17,738 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-19 06:35:17,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:35:18,013 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:35:18,033 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-19 06:35:18,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:35:18,184 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:35:18,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:18 WrapperNode [2022-11-19 06:35:18,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:35:18,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:35:18,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:35:18,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:35:18,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:18" (1/1) ... [2022-11-19 06:35:18,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:18" (1/1) ... [2022-11-19 06:35:18,251 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-19 06:35:18,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:35:18,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:35:18,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:35:18,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:35:18,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:18" (1/1) ... [2022-11-19 06:35:18,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:18" (1/1) ... [2022-11-19 06:35:18,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:18" (1/1) ... [2022-11-19 06:35:18,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:18" (1/1) ... [2022-11-19 06:35:18,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:18" (1/1) ... [2022-11-19 06:35:18,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:18" (1/1) ... [2022-11-19 06:35:18,299 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:18" (1/1) ... [2022-11-19 06:35:18,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:18" (1/1) ... [2022-11-19 06:35:18,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:35:18,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:35:18,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:35:18,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:35:18,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:18" (1/1) ... [2022-11-19 06:35:18,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:35:18,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:35:18,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:35:18,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:35:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 06:35:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 06:35:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:35:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 06:35:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:35:18,424 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 06:35:18,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 06:35:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 06:35:18,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 06:35:18,425 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 06:35:18,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 06:35:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 06:35:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 06:35:18,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:35:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:35:18,428 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 06:35:18,681 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:35:18,696 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:35:19,210 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:35:19,481 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:35:19,482 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 06:35:19,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:35:19 BoogieIcfgContainer [2022-11-19 06:35:19,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:35:19,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:35:19,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:35:19,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:35:19,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:35:17" (1/3) ... [2022-11-19 06:35:19,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d16f4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:35:19, skipping insertion in model container [2022-11-19 06:35:19,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:18" (2/3) ... [2022-11-19 06:35:19,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d16f4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:35:19, skipping insertion in model container [2022-11-19 06:35:19,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:35:19" (3/3) ... [2022-11-19 06:35:19,500 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-19 06:35:19,510 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 06:35:19,522 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:35:19,524 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-19 06:35:19,524 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 06:35:19,620 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 06:35:19,673 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 06:35:19,689 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 247 flow [2022-11-19 06:35:19,693 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 247 flow [2022-11-19 06:35:19,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2022-11-19 06:35:19,778 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2022-11-19 06:35:19,778 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 06:35:19,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-19 06:35:19,790 INFO L119 LiptonReduction]: Number of co-enabled transitions 2206 [2022-11-19 06:35:27,697 INFO L134 LiptonReduction]: Checked pairs total: 5792 [2022-11-19 06:35:27,698 INFO L136 LiptonReduction]: Total number of compositions: 102 [2022-11-19 06:35:27,707 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 27 transitions, 69 flow [2022-11-19 06:35:27,814 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 866 states, 863 states have (on average 3.1517960602549246) internal successors, (2720), 865 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:27,839 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:35:27,848 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;@3a61c1be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:35:27,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-19 06:35:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 866 states, 863 states have (on average 3.1517960602549246) internal successors, (2720), 865 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:27,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 06:35:27,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:27,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 06:35:27,863 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:27,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:27,869 INFO L85 PathProgramCache]: Analyzing trace with hash 539910566, now seen corresponding path program 1 times [2022-11-19 06:35:27,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:27,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344549795] [2022-11-19 06:35:27,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:27,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:28,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:28,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344549795] [2022-11-19 06:35:28,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344549795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:28,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:28,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 06:35:28,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915733013] [2022-11-19 06:35:28,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:28,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:35:28,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:28,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:35:28,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:35:28,474 INFO L87 Difference]: Start difference. First operand has 866 states, 863 states have (on average 3.1517960602549246) internal successors, (2720), 865 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:28,693 INFO L93 Difference]: Finished difference Result 704 states and 2171 transitions. [2022-11-19 06:35:28,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:35:28,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-19 06:35:28,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:28,727 INFO L225 Difference]: With dead ends: 704 [2022-11-19 06:35:28,727 INFO L226 Difference]: Without dead ends: 674 [2022-11-19 06:35:28,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:35:28,732 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:28,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:35:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-11-19 06:35:28,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2022-11-19 06:35:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 673 states have (on average 3.1084695393759287) internal successors, (2092), 673 states have internal predecessors, (2092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 2092 transitions. [2022-11-19 06:35:28,873 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 2092 transitions. Word has length 5 [2022-11-19 06:35:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:28,875 INFO L495 AbstractCegarLoop]: Abstraction has 674 states and 2092 transitions. [2022-11-19 06:35:28,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 2092 transitions. [2022-11-19 06:35:28,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 06:35:28,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:28,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:28,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 06:35:28,883 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:28,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:28,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1124134553, now seen corresponding path program 1 times [2022-11-19 06:35:28,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:28,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652604924] [2022-11-19 06:35:28,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:28,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:29,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:29,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:29,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652604924] [2022-11-19 06:35:29,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652604924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:29,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:29,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 06:35:29,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792751391] [2022-11-19 06:35:29,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:29,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:35:29,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:29,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:35:29,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:35:29,266 INFO L87 Difference]: Start difference. First operand 674 states and 2092 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:29,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:29,369 INFO L93 Difference]: Finished difference Result 644 states and 1983 transitions. [2022-11-19 06:35:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:35:29,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-19 06:35:29,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:29,375 INFO L225 Difference]: With dead ends: 644 [2022-11-19 06:35:29,375 INFO L226 Difference]: Without dead ends: 644 [2022-11-19 06:35:29,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:35:29,377 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:29,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:35:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-11-19 06:35:29,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2022-11-19 06:35:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 3.08398133748056) internal successors, (1983), 643 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1983 transitions. [2022-11-19 06:35:29,440 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1983 transitions. Word has length 9 [2022-11-19 06:35:29,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:29,441 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 1983 transitions. [2022-11-19 06:35:29,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1983 transitions. [2022-11-19 06:35:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 06:35:29,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:29,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:29,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 06:35:29,444 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:29,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:29,445 INFO L85 PathProgramCache]: Analyzing trace with hash -488434172, now seen corresponding path program 1 times [2022-11-19 06:35:29,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:29,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890143828] [2022-11-19 06:35:29,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:29,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:30,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:30,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890143828] [2022-11-19 06:35:30,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890143828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:30,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:30,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 06:35:30,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793164591] [2022-11-19 06:35:30,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:30,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:35:30,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:30,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:35:30,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:35:30,005 INFO L87 Difference]: Start difference. First operand 644 states and 1983 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:30,144 INFO L93 Difference]: Finished difference Result 640 states and 1968 transitions. [2022-11-19 06:35:30,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:35:30,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 06:35:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:30,150 INFO L225 Difference]: With dead ends: 640 [2022-11-19 06:35:30,151 INFO L226 Difference]: Without dead ends: 640 [2022-11-19 06:35:30,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:35:30,156 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 1 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:30,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:35:30,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-11-19 06:35:30,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2022-11-19 06:35:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 639 states have (on average 3.07981220657277) internal successors, (1968), 639 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1968 transitions. [2022-11-19 06:35:30,193 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1968 transitions. Word has length 10 [2022-11-19 06:35:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:30,195 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 1968 transitions. [2022-11-19 06:35:30,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1968 transitions. [2022-11-19 06:35:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 06:35:30,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:30,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:30,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 06:35:30,206 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:30,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:30,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2038421909, now seen corresponding path program 1 times [2022-11-19 06:35:30,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:30,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127341658] [2022-11-19 06:35:30,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:30,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:31,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:31,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127341658] [2022-11-19 06:35:31,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127341658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:31,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:31,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:35:31,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114571065] [2022-11-19 06:35:31,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:31,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:35:31,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:31,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:35:31,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:35:31,282 INFO L87 Difference]: Start difference. First operand 640 states and 1968 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:31,612 INFO L93 Difference]: Finished difference Result 690 states and 2141 transitions. [2022-11-19 06:35:31,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:35:31,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-19 06:35:31,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:31,633 INFO L225 Difference]: With dead ends: 690 [2022-11-19 06:35:31,633 INFO L226 Difference]: Without dead ends: 690 [2022-11-19 06:35:31,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:35:31,636 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:31,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:35:31,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-11-19 06:35:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 658. [2022-11-19 06:35:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 3.0730593607305936) internal successors, (2019), 657 states have internal predecessors, (2019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 2019 transitions. [2022-11-19 06:35:31,667 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 2019 transitions. Word has length 11 [2022-11-19 06:35:31,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:31,669 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 2019 transitions. [2022-11-19 06:35:31,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:31,669 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 2019 transitions. [2022-11-19 06:35:31,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 06:35:31,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:31,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:31,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 06:35:31,672 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:31,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:31,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2038408424, now seen corresponding path program 1 times [2022-11-19 06:35:31,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:31,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681597543] [2022-11-19 06:35:31,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:31,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:32,560 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:32,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681597543] [2022-11-19 06:35:32,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681597543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:32,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:32,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:35:32,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634151501] [2022-11-19 06:35:32,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:32,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:35:32,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:32,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:35:32,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:35:32,562 INFO L87 Difference]: Start difference. First operand 658 states and 2019 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:32,748 INFO L93 Difference]: Finished difference Result 830 states and 2492 transitions. [2022-11-19 06:35:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:35:32,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-19 06:35:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:32,752 INFO L225 Difference]: With dead ends: 830 [2022-11-19 06:35:32,752 INFO L226 Difference]: Without dead ends: 452 [2022-11-19 06:35:32,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:35:32,753 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:32,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:35:32,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-11-19 06:35:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2022-11-19 06:35:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 2.8980044345898004) internal successors, (1307), 451 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1307 transitions. [2022-11-19 06:35:32,775 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1307 transitions. Word has length 11 [2022-11-19 06:35:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:32,775 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 1307 transitions. [2022-11-19 06:35:32,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:32,776 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1307 transitions. [2022-11-19 06:35:32,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 06:35:32,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:32,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:32,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 06:35:32,778 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:32,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:32,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1233918885, now seen corresponding path program 1 times [2022-11-19 06:35:32,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:32,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783392230] [2022-11-19 06:35:32,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:32,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:34,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:34,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783392230] [2022-11-19 06:35:34,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783392230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:34,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:34,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:35:34,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606853514] [2022-11-19 06:35:34,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:34,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:35:34,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:34,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:35:34,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:35:34,720 INFO L87 Difference]: Start difference. First operand 452 states and 1307 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:34,990 INFO L93 Difference]: Finished difference Result 475 states and 1378 transitions. [2022-11-19 06:35:34,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:35:34,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 06:35:34,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:34,994 INFO L225 Difference]: With dead ends: 475 [2022-11-19 06:35:34,995 INFO L226 Difference]: Without dead ends: 475 [2022-11-19 06:35:34,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:35:34,996 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:34,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 5 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:35:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-19 06:35:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 460. [2022-11-19 06:35:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 2.895424836601307) internal successors, (1329), 459 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1329 transitions. [2022-11-19 06:35:35,015 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1329 transitions. Word has length 12 [2022-11-19 06:35:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:35,015 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 1329 transitions. [2022-11-19 06:35:35,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1329 transitions. [2022-11-19 06:35:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 06:35:35,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:35,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:35,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 06:35:35,017 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:35,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1292299635, now seen corresponding path program 2 times [2022-11-19 06:35:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:35,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516256851] [2022-11-19 06:35:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:35,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:35,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:35,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516256851] [2022-11-19 06:35:35,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516256851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:35,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:35,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:35:35,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455467813] [2022-11-19 06:35:35,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:35,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:35:35,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:35,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:35:35,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:35:35,815 INFO L87 Difference]: Start difference. First operand 460 states and 1329 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:35,948 INFO L93 Difference]: Finished difference Result 424 states and 1206 transitions. [2022-11-19 06:35:35,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:35:35,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 06:35:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:35,952 INFO L225 Difference]: With dead ends: 424 [2022-11-19 06:35:35,952 INFO L226 Difference]: Without dead ends: 424 [2022-11-19 06:35:35,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:35:35,953 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:35,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:35:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-11-19 06:35:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 416. [2022-11-19 06:35:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.853012048192771) internal successors, (1184), 415 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1184 transitions. [2022-11-19 06:35:35,969 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1184 transitions. Word has length 12 [2022-11-19 06:35:35,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:35,970 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 1184 transitions. [2022-11-19 06:35:35,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1184 transitions. [2022-11-19 06:35:35,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 06:35:35,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:35,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:35,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 06:35:35,972 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:35,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1069940973, now seen corresponding path program 1 times [2022-11-19 06:35:35,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:35,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005145938] [2022-11-19 06:35:35,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:35,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:36,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:36,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005145938] [2022-11-19 06:35:36,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005145938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:36,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:36,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:35:36,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667654358] [2022-11-19 06:35:36,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:36,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:35:36,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:36,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:35:36,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:35:36,731 INFO L87 Difference]: Start difference. First operand 416 states and 1184 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:36,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:36,900 INFO L93 Difference]: Finished difference Result 430 states and 1228 transitions. [2022-11-19 06:35:36,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:35:36,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 06:35:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:36,904 INFO L225 Difference]: With dead ends: 430 [2022-11-19 06:35:36,904 INFO L226 Difference]: Without dead ends: 430 [2022-11-19 06:35:36,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:35:36,905 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:36,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:35:36,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-11-19 06:35:36,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 420. [2022-11-19 06:35:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 2.8496420047732696) internal successors, (1194), 419 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1194 transitions. [2022-11-19 06:35:36,922 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1194 transitions. Word has length 15 [2022-11-19 06:35:36,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:36,923 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 1194 transitions. [2022-11-19 06:35:36,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1194 transitions. [2022-11-19 06:35:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 06:35:36,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:36,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:36,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 06:35:36,925 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:36,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:36,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1113964383, now seen corresponding path program 2 times [2022-11-19 06:35:36,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:36,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020080087] [2022-11-19 06:35:36,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:36,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:37,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:37,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020080087] [2022-11-19 06:35:37,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020080087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:37,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:37,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:35:37,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130896578] [2022-11-19 06:35:37,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:37,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:35:37,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:37,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:35:37,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:35:37,884 INFO L87 Difference]: Start difference. First operand 420 states and 1194 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:38,109 INFO L93 Difference]: Finished difference Result 486 states and 1393 transitions. [2022-11-19 06:35:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:35:38,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 06:35:38,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:38,113 INFO L225 Difference]: With dead ends: 486 [2022-11-19 06:35:38,113 INFO L226 Difference]: Without dead ends: 486 [2022-11-19 06:35:38,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:35:38,114 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 42 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:38,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 6 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:35:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-11-19 06:35:38,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 468. [2022-11-19 06:35:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 2.867237687366167) internal successors, (1339), 467 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1339 transitions. [2022-11-19 06:35:38,132 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1339 transitions. Word has length 15 [2022-11-19 06:35:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:38,132 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 1339 transitions. [2022-11-19 06:35:38,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1339 transitions. [2022-11-19 06:35:38,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 06:35:38,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:38,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:38,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 06:35:38,134 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:38,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:38,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1787677843, now seen corresponding path program 3 times [2022-11-19 06:35:38,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:38,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688881126] [2022-11-19 06:35:38,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:38,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:39,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:39,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688881126] [2022-11-19 06:35:39,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688881126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:39,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:39,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:35:39,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675367367] [2022-11-19 06:35:39,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:39,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:35:39,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:39,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:35:39,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:35:39,443 INFO L87 Difference]: Start difference. First operand 468 states and 1339 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:39,795 INFO L93 Difference]: Finished difference Result 579 states and 1677 transitions. [2022-11-19 06:35:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:35:39,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 06:35:39,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:39,800 INFO L225 Difference]: With dead ends: 579 [2022-11-19 06:35:39,800 INFO L226 Difference]: Without dead ends: 579 [2022-11-19 06:35:39,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:35:39,801 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:39,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 5 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:35:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-11-19 06:35:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 484. [2022-11-19 06:35:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 2.857142857142857) internal successors, (1380), 483 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1380 transitions. [2022-11-19 06:35:39,822 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1380 transitions. Word has length 15 [2022-11-19 06:35:39,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:39,823 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 1380 transitions. [2022-11-19 06:35:39,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1380 transitions. [2022-11-19 06:35:39,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 06:35:39,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:39,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:39,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 06:35:39,825 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:39,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:39,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1191609003, now seen corresponding path program 1 times [2022-11-19 06:35:39,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:39,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280835532] [2022-11-19 06:35:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:39,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:40,113 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:40,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280835532] [2022-11-19 06:35:40,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280835532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:40,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:40,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:35:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706941807] [2022-11-19 06:35:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:40,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:35:40,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:40,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:35:40,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:35:40,116 INFO L87 Difference]: Start difference. First operand 484 states and 1380 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:40,297 INFO L93 Difference]: Finished difference Result 476 states and 1218 transitions. [2022-11-19 06:35:40,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:35:40,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 06:35:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:40,300 INFO L225 Difference]: With dead ends: 476 [2022-11-19 06:35:40,300 INFO L226 Difference]: Without dead ends: 355 [2022-11-19 06:35:40,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:35:40,301 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 37 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:40,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 5 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:35:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-11-19 06:35:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 354. [2022-11-19 06:35:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 2.501416430594901) internal successors, (883), 353 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 883 transitions. [2022-11-19 06:35:40,315 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 883 transitions. Word has length 16 [2022-11-19 06:35:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:40,315 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 883 transitions. [2022-11-19 06:35:40,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 883 transitions. [2022-11-19 06:35:40,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 06:35:40,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:40,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:40,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 06:35:40,317 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:40,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:40,318 INFO L85 PathProgramCache]: Analyzing trace with hash 517836190, now seen corresponding path program 1 times [2022-11-19 06:35:40,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:40,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704281321] [2022-11-19 06:35:40,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:40,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:40,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704281321] [2022-11-19 06:35:40,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704281321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:40,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:40,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:35:40,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091726802] [2022-11-19 06:35:40,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:40,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:35:40,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:40,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:35:40,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:35:40,592 INFO L87 Difference]: Start difference. First operand 354 states and 883 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:40,797 INFO L93 Difference]: Finished difference Result 302 states and 703 transitions. [2022-11-19 06:35:40,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:35:40,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 06:35:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:40,800 INFO L225 Difference]: With dead ends: 302 [2022-11-19 06:35:40,800 INFO L226 Difference]: Without dead ends: 240 [2022-11-19 06:35:40,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:35:40,801 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 58 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:40,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 5 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:35:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-11-19 06:35:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 214. [2022-11-19 06:35:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.272300469483568) internal successors, (484), 213 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 484 transitions. [2022-11-19 06:35:40,810 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 484 transitions. Word has length 17 [2022-11-19 06:35:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:40,811 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 484 transitions. [2022-11-19 06:35:40,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 484 transitions. [2022-11-19 06:35:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 06:35:40,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:40,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:40,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 06:35:40,812 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:40,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:40,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1346224811, now seen corresponding path program 1 times [2022-11-19 06:35:40,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:40,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912837319] [2022-11-19 06:35:40,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:40,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:41,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:41,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912837319] [2022-11-19 06:35:41,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912837319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:41,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:41,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:35:41,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716682884] [2022-11-19 06:35:41,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:41,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:35:41,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:41,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:35:41,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:35:41,139 INFO L87 Difference]: Start difference. First operand 214 states and 484 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:41,341 INFO L93 Difference]: Finished difference Result 196 states and 446 transitions. [2022-11-19 06:35:41,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 06:35:41,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-19 06:35:41,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:41,343 INFO L225 Difference]: With dead ends: 196 [2022-11-19 06:35:41,343 INFO L226 Difference]: Without dead ends: 183 [2022-11-19 06:35:41,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:35:41,344 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 71 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:41,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:35:41,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-19 06:35:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2022-11-19 06:35:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 2.3258426966292136) internal successors, (414), 178 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 414 transitions. [2022-11-19 06:35:41,350 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 414 transitions. Word has length 19 [2022-11-19 06:35:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:41,351 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 414 transitions. [2022-11-19 06:35:41,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 414 transitions. [2022-11-19 06:35:41,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:35:41,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:41,352 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] [2022-11-19 06:35:41,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 06:35:41,353 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:41,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:41,354 INFO L85 PathProgramCache]: Analyzing trace with hash -789087723, now seen corresponding path program 1 times [2022-11-19 06:35:41,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:41,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489179667] [2022-11-19 06:35:41,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:41,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:42,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:42,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489179667] [2022-11-19 06:35:42,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489179667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:42,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:42,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:35:42,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910410748] [2022-11-19 06:35:42,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:42,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:35:42,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:42,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:35:42,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:35:42,828 INFO L87 Difference]: Start difference. First operand 179 states and 414 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:43,057 INFO L93 Difference]: Finished difference Result 232 states and 525 transitions. [2022-11-19 06:35:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 06:35:43,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 06:35:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:43,059 INFO L225 Difference]: With dead ends: 232 [2022-11-19 06:35:43,059 INFO L226 Difference]: Without dead ends: 202 [2022-11-19 06:35:43,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-19 06:35:43,060 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 50 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:43,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 4 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:35:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-19 06:35:43,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 163. [2022-11-19 06:35:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 2.259259259259259) internal successors, (366), 162 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 366 transitions. [2022-11-19 06:35:43,066 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 366 transitions. Word has length 22 [2022-11-19 06:35:43,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:43,067 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 366 transitions. [2022-11-19 06:35:43,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 366 transitions. [2022-11-19 06:35:43,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:35:43,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:43,068 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] [2022-11-19 06:35:43,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 06:35:43,068 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:43,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:43,069 INFO L85 PathProgramCache]: Analyzing trace with hash 672208149, now seen corresponding path program 2 times [2022-11-19 06:35:43,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:43,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91736853] [2022-11-19 06:35:43,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:43,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:44,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:44,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91736853] [2022-11-19 06:35:44,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91736853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:44,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:44,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 06:35:44,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015077695] [2022-11-19 06:35:44,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:44,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 06:35:44,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:44,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 06:35:44,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-19 06:35:44,953 INFO L87 Difference]: Start difference. First operand 163 states and 366 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:45,326 INFO L93 Difference]: Finished difference Result 257 states and 578 transitions. [2022-11-19 06:35:45,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 06:35:45,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 06:35:45,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:45,329 INFO L225 Difference]: With dead ends: 257 [2022-11-19 06:35:45,329 INFO L226 Difference]: Without dead ends: 174 [2022-11-19 06:35:45,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-19 06:35:45,330 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 24 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:45,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:35:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-19 06:35:45,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-11-19 06:35:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 2.30635838150289) internal successors, (399), 173 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 399 transitions. [2022-11-19 06:35:45,336 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 399 transitions. Word has length 22 [2022-11-19 06:35:45,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:45,337 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 399 transitions. [2022-11-19 06:35:45,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 399 transitions. [2022-11-19 06:35:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:35:45,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:45,338 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] [2022-11-19 06:35:45,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 06:35:45,341 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:45,342 INFO L85 PathProgramCache]: Analyzing trace with hash 975027669, now seen corresponding path program 3 times [2022-11-19 06:35:45,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:45,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709653818] [2022-11-19 06:35:45,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:45,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:46,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:46,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709653818] [2022-11-19 06:35:46,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709653818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:46,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:46,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:35:46,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719809782] [2022-11-19 06:35:46,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:46,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:35:46,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:46,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:35:46,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:35:46,780 INFO L87 Difference]: Start difference. First operand 174 states and 399 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:47,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:47,150 INFO L93 Difference]: Finished difference Result 254 states and 564 transitions. [2022-11-19 06:35:47,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 06:35:47,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 06:35:47,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:47,152 INFO L225 Difference]: With dead ends: 254 [2022-11-19 06:35:47,152 INFO L226 Difference]: Without dead ends: 190 [2022-11-19 06:35:47,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:35:47,153 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:47,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 6 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:35:47,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-19 06:35:47,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-11-19 06:35:47,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 2.2698412698412698) internal successors, (429), 189 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:47,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 429 transitions. [2022-11-19 06:35:47,161 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 429 transitions. Word has length 22 [2022-11-19 06:35:47,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:47,162 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 429 transitions. [2022-11-19 06:35:47,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 429 transitions. [2022-11-19 06:35:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:35:47,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:47,164 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] [2022-11-19 06:35:47,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 06:35:47,164 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:47,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:47,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1488814187, now seen corresponding path program 4 times [2022-11-19 06:35:47,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:47,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805058616] [2022-11-19 06:35:47,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:47,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:50,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:50,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805058616] [2022-11-19 06:35:50,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805058616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:50,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:50,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-19 06:35:50,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121101515] [2022-11-19 06:35:50,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:50,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 06:35:50,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:50,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 06:35:50,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-19 06:35:50,329 INFO L87 Difference]: Start difference. First operand 190 states and 429 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:51,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:51,018 INFO L93 Difference]: Finished difference Result 252 states and 556 transitions. [2022-11-19 06:35:51,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 06:35:51,019 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 06:35:51,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:51,020 INFO L225 Difference]: With dead ends: 252 [2022-11-19 06:35:51,020 INFO L226 Difference]: Without dead ends: 197 [2022-11-19 06:35:51,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-11-19 06:35:51,021 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 80 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:51,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 12 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 06:35:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-19 06:35:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 185. [2022-11-19 06:35:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 2.25) internal successors, (414), 184 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 414 transitions. [2022-11-19 06:35:51,030 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 414 transitions. Word has length 22 [2022-11-19 06:35:51,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:51,030 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 414 transitions. [2022-11-19 06:35:51,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 414 transitions. [2022-11-19 06:35:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:35:51,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:51,033 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] [2022-11-19 06:35:51,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 06:35:51,033 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:51,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2066630107, now seen corresponding path program 5 times [2022-11-19 06:35:51,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:51,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729175240] [2022-11-19 06:35:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:51,764 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:51,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729175240] [2022-11-19 06:35:51,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729175240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:51,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:51,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:35:51,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282855984] [2022-11-19 06:35:51,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:51,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:35:51,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:51,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:35:51,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:35:51,766 INFO L87 Difference]: Start difference. First operand 185 states and 414 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:52,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:52,064 INFO L93 Difference]: Finished difference Result 264 states and 576 transitions. [2022-11-19 06:35:52,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 06:35:52,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 06:35:52,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:52,066 INFO L225 Difference]: With dead ends: 264 [2022-11-19 06:35:52,067 INFO L226 Difference]: Without dead ends: 213 [2022-11-19 06:35:52,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-19 06:35:52,068 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 48 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:52,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:35:52,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-19 06:35:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 177. [2022-11-19 06:35:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 2.1761363636363638) internal successors, (383), 176 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 383 transitions. [2022-11-19 06:35:52,075 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 383 transitions. Word has length 22 [2022-11-19 06:35:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:52,075 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 383 transitions. [2022-11-19 06:35:52,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 383 transitions. [2022-11-19 06:35:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:35:52,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:52,076 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] [2022-11-19 06:35:52,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-19 06:35:52,077 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash 84418467, now seen corresponding path program 6 times [2022-11-19 06:35:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:52,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803844675] [2022-11-19 06:35:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:53,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:53,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:53,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803844675] [2022-11-19 06:35:53,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803844675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:53,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:53,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 06:35:53,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302164160] [2022-11-19 06:35:53,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:53,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 06:35:53,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:53,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 06:35:53,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-19 06:35:53,791 INFO L87 Difference]: Start difference. First operand 177 states and 383 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:54,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:54,279 INFO L93 Difference]: Finished difference Result 214 states and 451 transitions. [2022-11-19 06:35:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 06:35:54,280 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 06:35:54,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:54,281 INFO L225 Difference]: With dead ends: 214 [2022-11-19 06:35:54,281 INFO L226 Difference]: Without dead ends: 167 [2022-11-19 06:35:54,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-19 06:35:54,282 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 47 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:54,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 12 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:35:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-19 06:35:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2022-11-19 06:35:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.1910828025477707) internal successors, (344), 157 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 344 transitions. [2022-11-19 06:35:54,288 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 344 transitions. Word has length 22 [2022-11-19 06:35:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:54,288 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 344 transitions. [2022-11-19 06:35:54,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 344 transitions. [2022-11-19 06:35:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:35:54,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:54,289 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] [2022-11-19 06:35:54,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-19 06:35:54,290 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:54,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:54,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1406100853, now seen corresponding path program 7 times [2022-11-19 06:35:54,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:54,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994933531] [2022-11-19 06:35:54,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:54,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:56,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:56,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994933531] [2022-11-19 06:35:56,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994933531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:56,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:56,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 06:35:56,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660240080] [2022-11-19 06:35:56,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:56,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 06:35:56,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:56,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 06:35:56,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-19 06:35:56,476 INFO L87 Difference]: Start difference. First operand 158 states and 344 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:56,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:56,852 INFO L93 Difference]: Finished difference Result 192 states and 404 transitions. [2022-11-19 06:35:56,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 06:35:56,853 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 06:35:56,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:56,854 INFO L225 Difference]: With dead ends: 192 [2022-11-19 06:35:56,854 INFO L226 Difference]: Without dead ends: 150 [2022-11-19 06:35:56,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-19 06:35:56,855 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:56,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:35:56,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-19 06:35:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-19 06:35:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.134228187919463) internal successors, (318), 149 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 318 transitions. [2022-11-19 06:35:56,860 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 318 transitions. Word has length 22 [2022-11-19 06:35:56,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:56,860 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 318 transitions. [2022-11-19 06:35:56,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:56,860 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 318 transitions. [2022-11-19 06:35:56,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:35:56,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:56,861 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] [2022-11-19 06:35:56,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-19 06:35:56,861 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:56,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:56,861 INFO L85 PathProgramCache]: Analyzing trace with hash -651652851, now seen corresponding path program 8 times [2022-11-19 06:35:56,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:56,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622307199] [2022-11-19 06:35:56,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:56,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:35:58,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:58,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622307199] [2022-11-19 06:35:58,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622307199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:58,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:58,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 06:35:58,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538281642] [2022-11-19 06:35:58,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:58,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 06:35:58,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:58,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 06:35:58,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-19 06:35:58,366 INFO L87 Difference]: Start difference. First operand 150 states and 318 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:59,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:59,020 INFO L93 Difference]: Finished difference Result 209 states and 440 transitions. [2022-11-19 06:35:59,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 06:35:59,021 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 06:35:59,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:59,022 INFO L225 Difference]: With dead ends: 209 [2022-11-19 06:35:59,022 INFO L226 Difference]: Without dead ends: 157 [2022-11-19 06:35:59,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-11-19 06:35:59,023 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 78 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:59,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 10 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 06:35:59,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-19 06:35:59,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-11-19 06:35:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.1346153846153846) internal successors, (333), 156 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 333 transitions. [2022-11-19 06:35:59,028 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 333 transitions. Word has length 22 [2022-11-19 06:35:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:59,029 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 333 transitions. [2022-11-19 06:35:59,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:35:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 333 transitions. [2022-11-19 06:35:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:35:59,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:59,030 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] [2022-11-19 06:35:59,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-19 06:35:59,030 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:35:59,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash 46291797, now seen corresponding path program 9 times [2022-11-19 06:35:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:59,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849256792] [2022-11-19 06:35:59,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:36:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:36:00,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:36:00,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849256792] [2022-11-19 06:36:00,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849256792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:36:00,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:36:00,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:36:00,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782989485] [2022-11-19 06:36:00,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:36:00,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:36:00,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:36:00,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:36:00,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:36:00,464 INFO L87 Difference]: Start difference. First operand 157 states and 333 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:36:01,215 INFO L93 Difference]: Finished difference Result 216 states and 454 transitions. [2022-11-19 06:36:01,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 06:36:01,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 06:36:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:36:01,217 INFO L225 Difference]: With dead ends: 216 [2022-11-19 06:36:01,217 INFO L226 Difference]: Without dead ends: 188 [2022-11-19 06:36:01,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-11-19 06:36:01,218 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 70 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:36:01,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 5 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:36:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-19 06:36:01,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 149. [2022-11-19 06:36:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 2.141891891891892) internal successors, (317), 148 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 317 transitions. [2022-11-19 06:36:01,224 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 317 transitions. Word has length 22 [2022-11-19 06:36:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:36:01,225 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 317 transitions. [2022-11-19 06:36:01,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 317 transitions. [2022-11-19 06:36:01,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:36:01,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:36:01,226 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] [2022-11-19 06:36:01,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-19 06:36:01,226 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:36:01,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:36:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1877417237, now seen corresponding path program 10 times [2022-11-19 06:36:01,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:36:01,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333600496] [2022-11-19 06:36:01,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:36:01,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:36:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:36:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:36:03,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:36:03,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333600496] [2022-11-19 06:36:03,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333600496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:36:03,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:36:03,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 06:36:03,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073859670] [2022-11-19 06:36:03,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:36:03,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 06:36:03,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:36:03,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 06:36:03,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-19 06:36:03,241 INFO L87 Difference]: Start difference. First operand 149 states and 317 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:36:04,114 INFO L93 Difference]: Finished difference Result 205 states and 426 transitions. [2022-11-19 06:36:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 06:36:04,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 06:36:04,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:36:04,116 INFO L225 Difference]: With dead ends: 205 [2022-11-19 06:36:04,116 INFO L226 Difference]: Without dead ends: 145 [2022-11-19 06:36:04,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-19 06:36:04,117 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 97 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:36:04,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 9 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:36:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-19 06:36:04,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 130. [2022-11-19 06:36:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.131782945736434) internal successors, (275), 129 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 275 transitions. [2022-11-19 06:36:04,122 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 275 transitions. Word has length 22 [2022-11-19 06:36:04,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:36:04,122 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 275 transitions. [2022-11-19 06:36:04,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:04,122 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 275 transitions. [2022-11-19 06:36:04,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:36:04,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:36:04,124 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] [2022-11-19 06:36:04,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-19 06:36:04,125 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:36:04,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:36:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1580686629, now seen corresponding path program 11 times [2022-11-19 06:36:04,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:36:04,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114398262] [2022-11-19 06:36:04,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:36:04,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:36:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:36:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:36:05,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:36:05,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114398262] [2022-11-19 06:36:05,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114398262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:36:05,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:36:05,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 06:36:05,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833220511] [2022-11-19 06:36:05,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:36:05,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 06:36:05,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:36:05,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 06:36:05,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-19 06:36:05,407 INFO L87 Difference]: Start difference. First operand 130 states and 275 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:36:06,055 INFO L93 Difference]: Finished difference Result 170 states and 348 transitions. [2022-11-19 06:36:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 06:36:06,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 06:36:06,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:36:06,058 INFO L225 Difference]: With dead ends: 170 [2022-11-19 06:36:06,058 INFO L226 Difference]: Without dead ends: 114 [2022-11-19 06:36:06,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-11-19 06:36:06,059 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 77 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:36:06,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 9 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 06:36:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-19 06:36:06,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-19 06:36:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.061946902654867) internal successors, (233), 113 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 233 transitions. [2022-11-19 06:36:06,067 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 233 transitions. Word has length 22 [2022-11-19 06:36:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:36:06,069 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 233 transitions. [2022-11-19 06:36:06,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 233 transitions. [2022-11-19 06:36:06,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:36:06,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:36:06,070 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] [2022-11-19 06:36:06,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-19 06:36:06,071 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:36:06,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:36:06,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1510168741, now seen corresponding path program 12 times [2022-11-19 06:36:06,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:36:06,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702559452] [2022-11-19 06:36:06,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:36:06,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:36:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:36:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:36:07,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:36:07,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702559452] [2022-11-19 06:36:07,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702559452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:36:07,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:36:07,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-19 06:36:07,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735531028] [2022-11-19 06:36:07,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:36:07,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 06:36:07,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:36:07,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 06:36:07,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-19 06:36:07,742 INFO L87 Difference]: Start difference. First operand 114 states and 233 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:36:08,573 INFO L93 Difference]: Finished difference Result 167 states and 344 transitions. [2022-11-19 06:36:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 06:36:08,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 06:36:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:36:08,575 INFO L225 Difference]: With dead ends: 167 [2022-11-19 06:36:08,575 INFO L226 Difference]: Without dead ends: 77 [2022-11-19 06:36:08,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-11-19 06:36:08,576 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 93 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 06:36:08,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 10 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 06:36:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-19 06:36:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-11-19 06:36:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.9714285714285715) internal successors, (138), 70 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 138 transitions. [2022-11-19 06:36:08,581 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 138 transitions. Word has length 22 [2022-11-19 06:36:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:36:08,581 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 138 transitions. [2022-11-19 06:36:08,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 138 transitions. [2022-11-19 06:36:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:36:08,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:36:08,582 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] [2022-11-19 06:36:08,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-19 06:36:08,583 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:36:08,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:36:08,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1546760347, now seen corresponding path program 13 times [2022-11-19 06:36:08,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:36:08,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001476623] [2022-11-19 06:36:08,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:36:08,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:36:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:36:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:36:10,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:36:10,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001476623] [2022-11-19 06:36:10,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001476623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:36:10,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:36:10,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 06:36:10,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360160511] [2022-11-19 06:36:10,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:36:10,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 06:36:10,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:36:10,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 06:36:10,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:36:10,191 INFO L87 Difference]: Start difference. First operand 71 states and 138 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:36:10,475 INFO L93 Difference]: Finished difference Result 139 states and 270 transitions. [2022-11-19 06:36:10,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 06:36:10,476 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 06:36:10,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:36:10,477 INFO L225 Difference]: With dead ends: 139 [2022-11-19 06:36:10,477 INFO L226 Difference]: Without dead ends: 91 [2022-11-19 06:36:10,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-19 06:36:10,479 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 43 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:36:10,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:36:10,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-19 06:36:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2022-11-19 06:36:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 58 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2022-11-19 06:36:10,483 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 22 [2022-11-19 06:36:10,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:36:10,483 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 102 transitions. [2022-11-19 06:36:10,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 102 transitions. [2022-11-19 06:36:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:36:10,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:36:10,485 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] [2022-11-19 06:36:10,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-19 06:36:10,485 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:36:10,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:36:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1341650687, now seen corresponding path program 14 times [2022-11-19 06:36:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:36:10,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942066965] [2022-11-19 06:36:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:36:10,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:36:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:36:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:36:13,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:36:13,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942066965] [2022-11-19 06:36:13,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942066965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:36:13,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:36:13,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-19 06:36:13,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93165247] [2022-11-19 06:36:13,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:36:13,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 06:36:13,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:36:13,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 06:36:13,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-19 06:36:13,228 INFO L87 Difference]: Start difference. First operand 59 states and 102 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:36:14,026 INFO L93 Difference]: Finished difference Result 103 states and 179 transitions. [2022-11-19 06:36:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 06:36:14,027 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 06:36:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:36:14,028 INFO L225 Difference]: With dead ends: 103 [2022-11-19 06:36:14,029 INFO L226 Difference]: Without dead ends: 67 [2022-11-19 06:36:14,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-11-19 06:36:14,029 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 61 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 06:36:14,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 7 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 06:36:14,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-19 06:36:14,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2022-11-19 06:36:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 52 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:14,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 90 transitions. [2022-11-19 06:36:14,033 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 90 transitions. Word has length 22 [2022-11-19 06:36:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:36:14,033 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 90 transitions. [2022-11-19 06:36:14,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:36:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 90 transitions. [2022-11-19 06:36:14,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 06:36:14,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:36:14,035 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] [2022-11-19 06:36:14,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-19 06:36:14,035 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-19 06:36:14,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:36:14,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1615283801, now seen corresponding path program 15 times [2022-11-19 06:36:14,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:36:14,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038841740] [2022-11-19 06:36:14,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:36:14,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:36:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 06:36:14,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 06:36:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 06:36:14,212 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 06:36:14,212 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 06:36:14,214 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-19 06:36:14,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-19 06:36:14,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-19 06:36:14,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-19 06:36:14,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-19 06:36:14,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-19 06:36:14,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-19 06:36:14,221 INFO L444 BasicCegarLoop]: Path program histogram: [15, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:36:14,228 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 06:36:14,229 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 06:36:14,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:36:14 BasicIcfg [2022-11-19 06:36:14,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 06:36:14,310 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 06:36:14,310 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 06:36:14,310 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 06:36:14,311 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:35:19" (3/4) ... [2022-11-19 06:36:14,313 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-19 06:36:14,410 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 06:36:14,411 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 06:36:14,411 INFO L158 Benchmark]: Toolchain (without parser) took 56991.98ms. Allocated memory was 136.3MB in the beginning and 629.1MB in the end (delta: 492.8MB). Free memory was 101.7MB in the beginning and 280.4MB in the end (delta: -178.7MB). Peak memory consumption was 314.7MB. Max. memory is 16.1GB. [2022-11-19 06:36:14,412 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 92.3MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:36:14,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 763.44ms. Allocated memory is still 136.3MB. Free memory was 101.7MB in the beginning and 96.5MB in the end (delta: 5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 06:36:14,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.00ms. Allocated memory is still 136.3MB. Free memory was 96.5MB in the beginning and 93.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:36:14,413 INFO L158 Benchmark]: Boogie Preprocessor took 53.99ms. Allocated memory is still 136.3MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:36:14,413 INFO L158 Benchmark]: RCFGBuilder took 1178.96ms. Allocated memory is still 136.3MB. Free memory was 91.5MB in the beginning and 96.7MB in the end (delta: -5.2MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2022-11-19 06:36:14,414 INFO L158 Benchmark]: TraceAbstraction took 54819.33ms. Allocated memory was 136.3MB in the beginning and 629.1MB in the end (delta: 492.8MB). Free memory was 96.0MB in the beginning and 293.1MB in the end (delta: -197.1MB). Peak memory consumption was 296.2MB. Max. memory is 16.1GB. [2022-11-19 06:36:14,414 INFO L158 Benchmark]: Witness Printer took 101.15ms. Allocated memory is still 629.1MB. Free memory was 293.1MB in the beginning and 280.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 06:36:14,416 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.34ms. Allocated memory is still 92.3MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 763.44ms. Allocated memory is still 136.3MB. Free memory was 101.7MB in the beginning and 96.5MB in the end (delta: 5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.00ms. Allocated memory is still 136.3MB. Free memory was 96.5MB in the beginning and 93.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.99ms. Allocated memory is still 136.3MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1178.96ms. Allocated memory is still 136.3MB. Free memory was 91.5MB in the beginning and 96.7MB in the end (delta: -5.2MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. * TraceAbstraction took 54819.33ms. Allocated memory was 136.3MB in the beginning and 629.1MB in the end (delta: 492.8MB). Free memory was 96.0MB in the beginning and 293.1MB in the end (delta: -197.1MB). Peak memory consumption was 296.2MB. Max. memory is 16.1GB. * Witness Printer took 101.15ms. Allocated memory is still 629.1MB. Free memory was 293.1MB in the beginning and 280.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.0s, 124 PlacesBefore, 37 PlacesAfterwards, 116 TransitionsBefore, 27 TransitionsAfterwards, 2206 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 102 TotalNumberOfCompositions, 5792 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2381, independent: 2207, independent conditional: 0, independent unconditional: 2207, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1414, independent: 1343, independent conditional: 0, independent unconditional: 1343, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1414, independent: 1337, independent conditional: 0, independent unconditional: 1337, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1077, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1064, dependent conditional: 0, dependent unconditional: 1064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2381, independent: 864, independent conditional: 0, independent unconditional: 864, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 1414, unknown conditional: 0, unknown unconditional: 1414] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L716] 0 int __unbuffered_p2_EBX = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L735] 0 int y$w_buff0; [L737] 0 int y$w_buff1; [L712] 0 int __unbuffered_p0_EAX = 0; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$read_delayed; [L714] 0 int __unbuffered_p2_EAX = 0; [L710] 0 int __unbuffered_cnt = 0; [L723] 0 _Bool y$flush_delayed; [L738] 0 _Bool y$w_buff1_used; [L718] 0 _Bool main$tmp_guard1; [L717] 0 _Bool main$tmp_guard0; [L734] 0 int *y$read_delayed_var; [L736] 0 _Bool y$w_buff0_used; [L720] 0 int x = 0; [L729] 0 _Bool y$r_buff1_thd0; [L722] 0 int y = 0; [L731] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd3; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2321, ((void *)0), P0, ((void *)0))=-1, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2322, ((void *)0), P1, ((void *)0))=0, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2323, ((void *)0), P2, ((void *)0))=1, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L744] 1 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=4, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 54.5s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1219 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1219 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 458 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3547 IncrementalHoareTripleChecker+Invalid, 4005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 458 mSolverCounterUnsat, 37 mSDtfsCounter, 3547 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=866occurred in iteration=0, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 411 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 33.3s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 448 ConstructedInterpolants, 0 QuantifiedInterpolants, 7522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 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! [2022-11-19 06:36:14,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2d9d1f7-b01e-4379-86bd-c07647f5c61c/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE