./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/30_Function_Pointer3_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-ext/30_Function_Pointer3_vs.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI --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 c8b500e58ad9de43c2267c6cdc33609b02abfe24fc1cf283e17f14a4a70ea61c --- 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-5e519f3 [2022-11-03 02:32:43,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:32:43,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:32:44,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:32:44,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:32:44,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:32:44,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:32:44,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:32:44,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:32:44,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:32:44,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:32:44,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:32:44,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:32:44,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:32:44,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:32:44,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:32:44,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:32:44,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:32:44,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:32:44,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:32:44,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:32:44,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:32:44,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:32:44,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:32:44,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:32:44,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:32:44,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:32:44,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:32:44,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:32:44,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:32:44,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:32:44,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:32:44,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:32:44,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:32:44,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:32:44,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:32:44,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:32:44,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:32:44,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:32:44,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:32:44,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:32:44,063 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:32:44,086 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:32:44,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:32:44,087 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:32:44,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:32:44,089 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:32:44,089 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:32:44,089 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:32:44,090 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:32:44,090 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:32:44,090 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:32:44,090 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:32:44,091 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:32:44,091 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:32:44,091 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:32:44,092 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:32:44,092 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:32:44,092 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:32:44,093 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:32:44,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:32:44,094 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:32:44,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:32:44,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:32:44,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:32:44,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:32:44,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:32:44,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:32:44,096 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:32:44,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:32:44,096 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:32:44,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:32:44,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:32:44,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:32:44,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:32:44,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:32:44,098 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:32:44,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:32:44,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:32:44,099 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:32:44,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:32:44,099 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:32:44,100 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:32:44,100 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_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI/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_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI 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 -> c8b500e58ad9de43c2267c6cdc33609b02abfe24fc1cf283e17f14a4a70ea61c [2022-11-03 02:32:44,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:32:44,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:32:44,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:32:44,471 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:32:44,472 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:32:44,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-ext/30_Function_Pointer3_vs.i [2022-11-03 02:32:44,563 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI/data/2c14c226d/b2394cc2b5214bfe98113af368e3faac/FLAG8e33bd908 [2022-11-03 02:32:45,179 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:32:45,180 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef7307-db20-4144-ad3d-63ff48ad315a/sv-benchmarks/c/pthread-ext/30_Function_Pointer3_vs.i [2022-11-03 02:32:45,207 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI/data/2c14c226d/b2394cc2b5214bfe98113af368e3faac/FLAG8e33bd908 [2022-11-03 02:32:45,468 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI/data/2c14c226d/b2394cc2b5214bfe98113af368e3faac [2022-11-03 02:32:45,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:32:45,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:32:45,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:32:45,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:32:45,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:32:45,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:32:45" (1/1) ... [2022-11-03 02:32:45,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b393a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:45, skipping insertion in model container [2022-11-03 02:32:45,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:32:45" (1/1) ... [2022-11-03 02:32:45,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:32:45,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:32:45,912 WARN L230 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_64ef7307-db20-4144-ad3d-63ff48ad315a/sv-benchmarks/c/pthread-ext/30_Function_Pointer3_vs.i[30577,30590] [2022-11-03 02:32:45,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:32:45,938 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:32:46,019 WARN L230 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_64ef7307-db20-4144-ad3d-63ff48ad315a/sv-benchmarks/c/pthread-ext/30_Function_Pointer3_vs.i[30577,30590] [2022-11-03 02:32:46,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:32:46,065 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:32:46,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:46 WrapperNode [2022-11-03 02:32:46,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:32:46,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:32:46,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:32:46,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:32:46,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:46" (1/1) ... [2022-11-03 02:32:46,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:46" (1/1) ... [2022-11-03 02:32:46,147 INFO L138 Inliner]: procedures = 174, calls = 19, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 80 [2022-11-03 02:32:46,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:32:46,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:32:46,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:32:46,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:32:46,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:46" (1/1) ... [2022-11-03 02:32:46,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:46" (1/1) ... [2022-11-03 02:32:46,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:46" (1/1) ... [2022-11-03 02:32:46,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:46" (1/1) ... [2022-11-03 02:32:46,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:46" (1/1) ... [2022-11-03 02:32:46,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:46" (1/1) ... [2022-11-03 02:32:46,199 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:46" (1/1) ... [2022-11-03 02:32:46,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:46" (1/1) ... [2022-11-03 02:32:46,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:32:46,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:32:46,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:32:46,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:32:46,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:46" (1/1) ... [2022-11-03 02:32:46,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:32:46,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:32:46,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:32:46,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ef7307-db20-4144-ad3d-63ff48ad315a/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:32:46,283 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-11-03 02:32:46,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-11-03 02:32:46,283 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-03 02:32:46,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-03 02:32:46,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:32:46,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:32:46,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:32:46,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:32:46,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:32:46,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:32:46,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:32:46,286 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 02:32:46,516 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:32:46,518 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:32:46,802 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:32:46,857 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:32:46,860 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-03 02:32:46,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:32:46 BoogieIcfgContainer [2022-11-03 02:32:46,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:32:46,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:32:46,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:32:46,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:32:46,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:32:45" (1/3) ... [2022-11-03 02:32:46,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b54244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:32:46, skipping insertion in model container [2022-11-03 02:32:46,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:32:46" (2/3) ... [2022-11-03 02:32:46,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b54244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:32:46, skipping insertion in model container [2022-11-03 02:32:46,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:32:46" (3/3) ... [2022-11-03 02:32:46,877 INFO L112 eAbstractionObserver]: Analyzing ICFG 30_Function_Pointer3_vs.i [2022-11-03 02:32:46,888 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:32:46,900 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:32:46,900 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:32:46,900 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:32:46,992 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:32:47,052 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:32:47,083 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 100 transitions, 210 flow [2022-11-03 02:32:47,094 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 100 transitions, 210 flow [2022-11-03 02:32:47,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 100 transitions, 210 flow [2022-11-03 02:32:47,183 INFO L130 PetriNetUnfolder]: 7/110 cut-off events. [2022-11-03 02:32:47,183 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 02:32:47,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 110 events. 7/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 127 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 94. Up to 4 conditions per place. [2022-11-03 02:32:47,194 INFO L118 LiptonReduction]: Number of co-enabled transitions 2974 [2022-11-03 02:32:52,489 INFO L133 LiptonReduction]: Checked pairs total: 2325 [2022-11-03 02:32:52,489 INFO L135 LiptonReduction]: Total number of compositions: 101 [2022-11-03 02:32:52,498 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 19 places, 14 transitions, 38 flow [2022-11-03 02:32:52,515 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 55 states, 51 states have (on average 2.3333333333333335) internal successors, (119), 54 states have internal predecessors, (119), 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-03 02:32:52,535 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:32:52,542 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;@390af72b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:32:52,542 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-03 02:32:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 51 states have (on average 2.3333333333333335) internal successors, (119), 54 states have internal predecessors, (119), 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-03 02:32:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 02:32:52,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:52,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 02:32:52,552 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:32:52,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:52,559 INFO L85 PathProgramCache]: Analyzing trace with hash 14525715, now seen corresponding path program 1 times [2022-11-03 02:32:52,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:32:52,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396208453] [2022-11-03 02:32:52,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:52,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:32:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:52,890 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-03 02:32:52,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:32:52,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396208453] [2022-11-03 02:32:52,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396208453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:32:52,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:32:52,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:32:52,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666514443] [2022-11-03 02:32:52,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:32:52,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:32:52,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:32:52,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:32:52,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:32:52,938 INFO L87 Difference]: Start difference. First operand has 55 states, 51 states have (on average 2.3333333333333335) internal successors, (119), 54 states have internal predecessors, (119), 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.0) internal successors, (4), 2 states have internal predecessors, (4), 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-03 02:32:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:32:52,991 INFO L93 Difference]: Finished difference Result 28 states and 57 transitions. [2022-11-03 02:32:52,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:32:52,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-11-03 02:32:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:32:53,004 INFO L225 Difference]: With dead ends: 28 [2022-11-03 02:32:53,004 INFO L226 Difference]: Without dead ends: 28 [2022-11-03 02:32:53,005 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-03 02:32:53,010 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:32:53,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:32:53,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-03 02:32:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-03 02:32:53,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 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-03 02:32:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 57 transitions. [2022-11-03 02:32:53,050 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 57 transitions. Word has length 4 [2022-11-03 02:32:53,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:32:53,051 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 57 transitions. [2022-11-03 02:32:53,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-03 02:32:53,051 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 57 transitions. [2022-11-03 02:32:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:32:53,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:53,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:32:53,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:32:53,053 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:32:53,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:53,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1994574399, now seen corresponding path program 1 times [2022-11-03 02:32:53,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:32:53,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474222826] [2022-11-03 02:32:53,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:53,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:32:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:53,445 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-03 02:32:53,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:32:53,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474222826] [2022-11-03 02:32:53,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474222826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:32:53,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:32:53,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:32:53,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288353131] [2022-11-03 02:32:53,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:32:53,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:32:53,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:32:53,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:32:53,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:32:53,449 INFO L87 Difference]: Start difference. First operand 28 states and 57 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-03 02:32:53,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:32:53,468 INFO L93 Difference]: Finished difference Result 24 states and 50 transitions. [2022-11-03 02:32:53,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:32:53,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-11-03 02:32:53,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:32:53,470 INFO L225 Difference]: With dead ends: 24 [2022-11-03 02:32:53,470 INFO L226 Difference]: Without dead ends: 24 [2022-11-03 02:32:53,470 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-03 02:32:53,472 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:32:53,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:32:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-03 02:32:53,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-03 02:32:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 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-03 02:32:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2022-11-03 02:32:53,483 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 8 [2022-11-03 02:32:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:32:53,484 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 50 transitions. [2022-11-03 02:32:53,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-03 02:32:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 50 transitions. [2022-11-03 02:32:53,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:32:53,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:53,487 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-03 02:32:53,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:32:53,488 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:32:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:53,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1921800917, now seen corresponding path program 1 times [2022-11-03 02:32:53,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:32:53,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697952073] [2022-11-03 02:32:53,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:53,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:32:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:32:53,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:32:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:32:53,567 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:32:53,568 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:32:53,569 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-11-03 02:32:53,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-11-03 02:32:53,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-11-03 02:32:53,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-11-03 02:32:53,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:32:53,576 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-03 02:32:53,581 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 02:32:53,582 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-03 02:32:53,624 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:32:53,634 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:32:53,636 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 165 transitions, 354 flow [2022-11-03 02:32:53,637 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 165 transitions, 354 flow [2022-11-03 02:32:53,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 165 transitions, 354 flow [2022-11-03 02:32:53,732 INFO L130 PetriNetUnfolder]: 10/176 cut-off events. [2022-11-03 02:32:53,732 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-03 02:32:53,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 176 events. 10/176 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 353 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 185. Up to 6 conditions per place. [2022-11-03 02:32:53,750 INFO L118 LiptonReduction]: Number of co-enabled transitions 11108 [2022-11-03 02:32:59,654 INFO L133 LiptonReduction]: Checked pairs total: 9600 [2022-11-03 02:32:59,655 INFO L135 LiptonReduction]: Total number of compositions: 164 [2022-11-03 02:32:59,656 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 29 transitions, 82 flow [2022-11-03 02:32:59,720 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 557 states, 552 states have (on average 3.431159420289855) internal successors, (1894), 556 states have internal predecessors, (1894), 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-03 02:32:59,721 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:32:59,726 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;@390af72b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:32:59,726 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-03 02:32:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 557 states, 552 states have (on average 3.431159420289855) internal successors, (1894), 556 states have internal predecessors, (1894), 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-03 02:32:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 02:32:59,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:59,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 02:32:59,730 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:32:59,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:59,732 INFO L85 PathProgramCache]: Analyzing trace with hash 26531146, now seen corresponding path program 1 times [2022-11-03 02:32:59,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:32:59,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198592066] [2022-11-03 02:32:59,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:59,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:32:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:59,792 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-03 02:32:59,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:32:59,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198592066] [2022-11-03 02:32:59,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198592066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:32:59,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:32:59,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:32:59,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775821211] [2022-11-03 02:32:59,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:32:59,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:32:59,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:32:59,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:32:59,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:32:59,797 INFO L87 Difference]: Start difference. First operand has 557 states, 552 states have (on average 3.431159420289855) internal successors, (1894), 556 states have internal predecessors, (1894), 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.0) internal successors, (4), 2 states have internal predecessors, (4), 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-03 02:32:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:32:59,869 INFO L93 Difference]: Finished difference Result 320 states and 1067 transitions. [2022-11-03 02:32:59,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:32:59,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-11-03 02:32:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:32:59,896 INFO L225 Difference]: With dead ends: 320 [2022-11-03 02:32:59,896 INFO L226 Difference]: Without dead ends: 320 [2022-11-03 02:32:59,897 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-03 02:32:59,902 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:32:59,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 10 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:32:59,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-11-03 02:32:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2022-11-03 02:32:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 3.3448275862068964) internal successors, (1067), 319 states have internal predecessors, (1067), 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-03 02:32:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 1067 transitions. [2022-11-03 02:32:59,946 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 1067 transitions. Word has length 4 [2022-11-03 02:32:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:32:59,946 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 1067 transitions. [2022-11-03 02:32:59,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-03 02:32:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 1067 transitions. [2022-11-03 02:32:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:32:59,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:59,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:32:59,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:32:59,948 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:32:59,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:59,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1244485361, now seen corresponding path program 1 times [2022-11-03 02:32:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:32:59,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111817938] [2022-11-03 02:32:59,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:59,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:32:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:00,309 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-03 02:33:00,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:00,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111817938] [2022-11-03 02:33:00,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111817938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:00,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:00,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:00,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34092864] [2022-11-03 02:33:00,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:00,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:00,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:00,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:00,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:00,313 INFO L87 Difference]: Start difference. First operand 320 states and 1067 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 02:33:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:00,434 INFO L93 Difference]: Finished difference Result 342 states and 1086 transitions. [2022-11-03 02:33:00,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:00,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 02:33:00,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:00,439 INFO L225 Difference]: With dead ends: 342 [2022-11-03 02:33:00,439 INFO L226 Difference]: Without dead ends: 342 [2022-11-03 02:33:00,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:00,441 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:00,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 24 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:00,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-11-03 02:33:00,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 322. [2022-11-03 02:33:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 3.2710280373831777) internal successors, (1050), 321 states have internal predecessors, (1050), 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-03 02:33:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 1050 transitions. [2022-11-03 02:33:00,467 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 1050 transitions. Word has length 10 [2022-11-03 02:33:00,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:00,467 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 1050 transitions. [2022-11-03 02:33:00,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 02:33:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 1050 transitions. [2022-11-03 02:33:00,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:33:00,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:00,469 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:00,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:33:00,470 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:33:00,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:00,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1879317410, now seen corresponding path program 1 times [2022-11-03 02:33:00,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:00,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537337832] [2022-11-03 02:33:00,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:00,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:33:00,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:00,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537337832] [2022-11-03 02:33:00,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537337832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:00,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:00,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:00,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285138872] [2022-11-03 02:33:00,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:00,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:00,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:00,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:00,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:00,621 INFO L87 Difference]: Start difference. First operand 322 states and 1050 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:33:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:00,703 INFO L93 Difference]: Finished difference Result 402 states and 1294 transitions. [2022-11-03 02:33:00,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:00,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 14 [2022-11-03 02:33:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:00,715 INFO L225 Difference]: With dead ends: 402 [2022-11-03 02:33:00,716 INFO L226 Difference]: Without dead ends: 402 [2022-11-03 02:33:00,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:00,717 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:00,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 24 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-11-03 02:33:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 362. [2022-11-03 02:33:00,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 3.2742382271468142) internal successors, (1182), 361 states have internal predecessors, (1182), 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-03 02:33:00,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 1182 transitions. [2022-11-03 02:33:00,762 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 1182 transitions. Word has length 14 [2022-11-03 02:33:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:00,764 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 1182 transitions. [2022-11-03 02:33:00,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:33:00,764 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 1182 transitions. [2022-11-03 02:33:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:33:00,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:00,773 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:00,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:33:00,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:33:00,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:00,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1879316480, now seen corresponding path program 1 times [2022-11-03 02:33:00,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:00,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431761553] [2022-11-03 02:33:00,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:00,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:33:00,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:00,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431761553] [2022-11-03 02:33:00,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431761553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:00,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:00,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:00,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45193892] [2022-11-03 02:33:00,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:00,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:00,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:00,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:00,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:00,894 INFO L87 Difference]: Start difference. First operand 362 states and 1182 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:33:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:00,963 INFO L93 Difference]: Finished difference Result 362 states and 1172 transitions. [2022-11-03 02:33:00,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:00,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 14 [2022-11-03 02:33:00,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:00,966 INFO L225 Difference]: With dead ends: 362 [2022-11-03 02:33:00,967 INFO L226 Difference]: Without dead ends: 362 [2022-11-03 02:33:00,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:00,970 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:00,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 24 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:00,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-11-03 02:33:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 242. [2022-11-03 02:33:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 242 states have (on average 3.371900826446281) internal successors, (816), 241 states have internal predecessors, (816), 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-03 02:33:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 816 transitions. [2022-11-03 02:33:00,983 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 816 transitions. Word has length 14 [2022-11-03 02:33:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:00,983 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 816 transitions. [2022-11-03 02:33:00,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:33:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 816 transitions. [2022-11-03 02:33:00,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:33:00,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:00,985 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:00,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:33:00,985 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:33:00,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:00,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1630910417, now seen corresponding path program 1 times [2022-11-03 02:33:00,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:00,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903983925] [2022-11-03 02:33:00,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:00,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:33:01,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:33:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:33:01,025 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:33:01,025 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:33:01,025 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-11-03 02:33:01,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-03 02:33:01,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-03 02:33:01,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-11-03 02:33:01,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-03 02:33:01,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:33:01,035 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-03 02:33:01,035 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 02:33:01,035 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-03 02:33:01,092 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:33:01,098 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:33:01,099 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 230 transitions, 502 flow [2022-11-03 02:33:01,100 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 230 transitions, 502 flow [2022-11-03 02:33:01,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 230 transitions, 502 flow [2022-11-03 02:33:01,181 INFO L130 PetriNetUnfolder]: 13/242 cut-off events. [2022-11-03 02:33:01,181 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-03 02:33:01,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 242 events. 13/242 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 658 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 256. Up to 8 conditions per place. [2022-11-03 02:33:01,199 INFO L118 LiptonReduction]: Number of co-enabled transitions 24754 [2022-11-03 02:33:08,805 INFO L133 LiptonReduction]: Checked pairs total: 22792 [2022-11-03 02:33:08,806 INFO L135 LiptonReduction]: Total number of compositions: 231 [2022-11-03 02:33:08,808 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 40 transitions, 122 flow [2022-11-03 02:33:08,953 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2777 states, 2771 states have (on average 4.402381811620353) internal successors, (12199), 2776 states have internal predecessors, (12199), 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-03 02:33:08,955 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:33:08,955 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;@390af72b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:33:08,955 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-03 02:33:08,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 2777 states, 2771 states have (on average 4.402381811620353) internal successors, (12199), 2776 states have internal predecessors, (12199), 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-03 02:33:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 02:33:08,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:08,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 02:33:08,968 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:33:08,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:08,969 INFO L85 PathProgramCache]: Analyzing trace with hash 42447434, now seen corresponding path program 1 times [2022-11-03 02:33:08,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:08,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773481443] [2022-11-03 02:33:08,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:08,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:08,991 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-03 02:33:08,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:08,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773481443] [2022-11-03 02:33:08,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773481443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:08,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:08,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:33:08,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165045589] [2022-11-03 02:33:08,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:08,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:33:08,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:08,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:33:08,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:33:09,005 INFO L87 Difference]: Start difference. First operand has 2777 states, 2771 states have (on average 4.402381811620353) internal successors, (12199), 2776 states have internal predecessors, (12199), 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.0) internal successors, (4), 2 states have internal predecessors, (4), 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-03 02:33:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:09,089 INFO L93 Difference]: Finished difference Result 1676 states and 7255 transitions. [2022-11-03 02:33:09,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:33:09,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-11-03 02:33:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:09,105 INFO L225 Difference]: With dead ends: 1676 [2022-11-03 02:33:09,105 INFO L226 Difference]: Without dead ends: 1676 [2022-11-03 02:33:09,105 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-03 02:33:09,108 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:09,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 10 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:33:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2022-11-03 02:33:09,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1676. [2022-11-03 02:33:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1675 states have (on average 4.33134328358209) internal successors, (7255), 1675 states have internal predecessors, (7255), 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-03 02:33:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 7255 transitions. [2022-11-03 02:33:09,192 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 7255 transitions. Word has length 4 [2022-11-03 02:33:09,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:09,193 INFO L495 AbstractCegarLoop]: Abstraction has 1676 states and 7255 transitions. [2022-11-03 02:33:09,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-03 02:33:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 7255 transitions. [2022-11-03 02:33:09,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:33:09,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:09,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:09,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:33:09,195 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:33:09,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:09,195 INFO L85 PathProgramCache]: Analyzing trace with hash -745210387, now seen corresponding path program 1 times [2022-11-03 02:33:09,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:09,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326189950] [2022-11-03 02:33:09,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:09,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:09,534 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-03 02:33:09,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:09,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326189950] [2022-11-03 02:33:09,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326189950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:09,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:09,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:09,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258908533] [2022-11-03 02:33:09,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:09,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:09,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:09,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:09,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:09,536 INFO L87 Difference]: Start difference. First operand 1676 states and 7255 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 02:33:09,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:09,692 INFO L93 Difference]: Finished difference Result 2082 states and 8548 transitions. [2022-11-03 02:33:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:09,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 02:33:09,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:09,709 INFO L225 Difference]: With dead ends: 2082 [2022-11-03 02:33:09,709 INFO L226 Difference]: Without dead ends: 2082 [2022-11-03 02:33:09,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:09,710 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:09,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 24 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:09,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2022-11-03 02:33:09,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1906. [2022-11-03 02:33:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1905 states have (on average 4.224671916010498) internal successors, (8048), 1905 states have internal predecessors, (8048), 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-03 02:33:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 8048 transitions. [2022-11-03 02:33:09,822 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 8048 transitions. Word has length 10 [2022-11-03 02:33:09,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:09,823 INFO L495 AbstractCegarLoop]: Abstraction has 1906 states and 8048 transitions. [2022-11-03 02:33:09,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 02:33:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 8048 transitions. [2022-11-03 02:33:09,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:33:09,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:09,824 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:09,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:33:09,824 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:33:09,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:09,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1207447404, now seen corresponding path program 1 times [2022-11-03 02:33:09,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:09,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158973179] [2022-11-03 02:33:09,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:09,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:33:09,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:09,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158973179] [2022-11-03 02:33:09,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158973179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:09,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:09,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:09,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130746634] [2022-11-03 02:33:09,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:09,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:09,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:09,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:09,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:09,952 INFO L87 Difference]: Start difference. First operand 1906 states and 8048 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:33:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:10,103 INFO L93 Difference]: Finished difference Result 2450 states and 10080 transitions. [2022-11-03 02:33:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:10,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 14 [2022-11-03 02:33:10,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:10,123 INFO L225 Difference]: With dead ends: 2450 [2022-11-03 02:33:10,123 INFO L226 Difference]: Without dead ends: 2450 [2022-11-03 02:33:10,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:10,124 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 49 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:10,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 24 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:10,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2022-11-03 02:33:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2138. [2022-11-03 02:33:10,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 2137 states have (on average 4.220870379036032) internal successors, (9020), 2137 states have internal predecessors, (9020), 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-03 02:33:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 9020 transitions. [2022-11-03 02:33:10,269 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 9020 transitions. Word has length 14 [2022-11-03 02:33:10,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:10,269 INFO L495 AbstractCegarLoop]: Abstraction has 2138 states and 9020 transitions. [2022-11-03 02:33:10,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:33:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 9020 transitions. [2022-11-03 02:33:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:33:10,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:10,271 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:10,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:33:10,271 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:33:10,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:10,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1207446474, now seen corresponding path program 1 times [2022-11-03 02:33:10,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:10,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068066557] [2022-11-03 02:33:10,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:10,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:33:10,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:10,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068066557] [2022-11-03 02:33:10,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068066557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:10,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:10,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:10,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026631479] [2022-11-03 02:33:10,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:10,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:10,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:10,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:10,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:10,364 INFO L87 Difference]: Start difference. First operand 2138 states and 9020 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:33:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:10,491 INFO L93 Difference]: Finished difference Result 2226 states and 9162 transitions. [2022-11-03 02:33:10,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:10,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 14 [2022-11-03 02:33:10,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:10,510 INFO L225 Difference]: With dead ends: 2226 [2022-11-03 02:33:10,510 INFO L226 Difference]: Without dead ends: 2226 [2022-11-03 02:33:10,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:10,511 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 49 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:10,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 24 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2022-11-03 02:33:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 1682. [2022-11-03 02:33:10,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 4.241522903033909) internal successors, (7130), 1681 states have internal predecessors, (7130), 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-03 02:33:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 7130 transitions. [2022-11-03 02:33:10,630 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 7130 transitions. Word has length 14 [2022-11-03 02:33:10,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:10,631 INFO L495 AbstractCegarLoop]: Abstraction has 1682 states and 7130 transitions. [2022-11-03 02:33:10,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:33:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 7130 transitions. [2022-11-03 02:33:10,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:33:10,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:10,633 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:10,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:33:10,633 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:33:10,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:10,634 INFO L85 PathProgramCache]: Analyzing trace with hash 420973312, now seen corresponding path program 1 times [2022-11-03 02:33:10,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:10,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042498701] [2022-11-03 02:33:10,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:10,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:33:10,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:10,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042498701] [2022-11-03 02:33:10,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042498701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:10,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:10,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300925832] [2022-11-03 02:33:10,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:10,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:10,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:10,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:10,736 INFO L87 Difference]: Start difference. First operand 1682 states and 7130 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-03 02:33:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:10,865 INFO L93 Difference]: Finished difference Result 2362 states and 9814 transitions. [2022-11-03 02:33:10,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:10,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2022-11-03 02:33:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:10,885 INFO L225 Difference]: With dead ends: 2362 [2022-11-03 02:33:10,886 INFO L226 Difference]: Without dead ends: 2362 [2022-11-03 02:33:10,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:10,887 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 49 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:10,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 24 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-11-03 02:33:10,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1802. [2022-11-03 02:33:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1801 states have (on average 4.267629094947251) internal successors, (7686), 1801 states have internal predecessors, (7686), 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-03 02:33:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 7686 transitions. [2022-11-03 02:33:11,013 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 7686 transitions. Word has length 18 [2022-11-03 02:33:11,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:11,013 INFO L495 AbstractCegarLoop]: Abstraction has 1802 states and 7686 transitions. [2022-11-03 02:33:11,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-03 02:33:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 7686 transitions. [2022-11-03 02:33:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:33:11,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:11,016 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:11,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:33:11,016 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:33:11,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:11,017 INFO L85 PathProgramCache]: Analyzing trace with hash 420974149, now seen corresponding path program 1 times [2022-11-03 02:33:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:11,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145886403] [2022-11-03 02:33:11,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:33:11,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:11,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145886403] [2022-11-03 02:33:11,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145886403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:11,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:11,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:11,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597025713] [2022-11-03 02:33:11,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:11,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:11,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:11,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:11,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:11,151 INFO L87 Difference]: Start difference. First operand 1802 states and 7686 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-03 02:33:11,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:11,305 INFO L93 Difference]: Finished difference Result 1882 states and 7940 transitions. [2022-11-03 02:33:11,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:11,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2022-11-03 02:33:11,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:11,317 INFO L225 Difference]: With dead ends: 1882 [2022-11-03 02:33:11,317 INFO L226 Difference]: Without dead ends: 1882 [2022-11-03 02:33:11,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:11,318 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 49 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:11,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 24 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-11-03 02:33:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1202. [2022-11-03 02:33:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 1202 states have (on average 4.372712146422629) internal successors, (5256), 1201 states have internal predecessors, (5256), 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-03 02:33:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 5256 transitions. [2022-11-03 02:33:11,369 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 5256 transitions. Word has length 18 [2022-11-03 02:33:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:11,370 INFO L495 AbstractCegarLoop]: Abstraction has 1202 states and 5256 transitions. [2022-11-03 02:33:11,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-03 02:33:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 5256 transitions. [2022-11-03 02:33:11,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:33:11,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:11,372 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:11,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 02:33:11,372 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:33:11,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:11,373 INFO L85 PathProgramCache]: Analyzing trace with hash -71079757, now seen corresponding path program 1 times [2022-11-03 02:33:11,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:11,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812076677] [2022-11-03 02:33:11,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:11,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:33:11,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:33:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:33:11,394 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:33:11,394 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:33:11,395 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-11-03 02:33:11,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-03 02:33:11,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-03 02:33:11,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-11-03 02:33:11,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-11-03 02:33:11,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-03 02:33:11,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 02:33:11,396 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:11,397 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 02:33:11,397 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-03 02:33:11,440 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:33:11,443 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:33:11,443 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 292 places, 295 transitions, 654 flow [2022-11-03 02:33:11,444 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 292 places, 295 transitions, 654 flow [2022-11-03 02:33:11,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 292 places, 295 transitions, 654 flow [2022-11-03 02:33:11,534 INFO L130 PetriNetUnfolder]: 16/308 cut-off events. [2022-11-03 02:33:11,535 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-03 02:33:11,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 308 events. 16/308 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 988 event pairs, 0 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 328. Up to 10 conditions per place. [2022-11-03 02:33:11,561 INFO L118 LiptonReduction]: Number of co-enabled transitions 43912 [2022-11-03 02:33:21,087 INFO L133 LiptonReduction]: Checked pairs total: 38952 [2022-11-03 02:33:21,087 INFO L135 LiptonReduction]: Total number of compositions: 301 [2022-11-03 02:33:21,088 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 51 transitions, 166 flow [2022-11-03 02:33:21,865 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14466 states, 14459 states have (on average 5.410125181547825) internal successors, (78225), 14465 states have internal predecessors, (78225), 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-03 02:33:21,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:33:21,867 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;@390af72b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:33:21,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-03 02:33:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 14466 states, 14459 states have (on average 5.410125181547825) internal successors, (78225), 14465 states have internal predecessors, (78225), 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-03 02:33:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 02:33:21,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:21,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 02:33:21,902 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:33:21,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:21,903 INFO L85 PathProgramCache]: Analyzing trace with hash 62934073, now seen corresponding path program 1 times [2022-11-03 02:33:21,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:21,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182585989] [2022-11-03 02:33:21,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:21,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:21,930 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-03 02:33:21,931 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:21,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182585989] [2022-11-03 02:33:21,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182585989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:21,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:21,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:33:21,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812361294] [2022-11-03 02:33:21,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:21,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:33:21,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:21,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:33:21,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:33:21,970 INFO L87 Difference]: Start difference. First operand has 14466 states, 14459 states have (on average 5.410125181547825) internal successors, (78225), 14465 states have internal predecessors, (78225), 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.0) internal successors, (4), 2 states have internal predecessors, (4), 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-03 02:33:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:22,143 INFO L93 Difference]: Finished difference Result 8944 states and 47831 transitions. [2022-11-03 02:33:22,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:33:22,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-11-03 02:33:22,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:22,221 INFO L225 Difference]: With dead ends: 8944 [2022-11-03 02:33:22,221 INFO L226 Difference]: Without dead ends: 8944 [2022-11-03 02:33:22,222 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-03 02:33:22,223 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 18 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:22,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 10 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8944 states. [2022-11-03 02:33:22,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8944 to 8944. [2022-11-03 02:33:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8944 states, 8943 states have (on average 5.348428938834843) internal successors, (47831), 8943 states have internal predecessors, (47831), 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-03 02:33:22,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8944 states to 8944 states and 47831 transitions. [2022-11-03 02:33:22,935 INFO L78 Accepts]: Start accepts. Automaton has 8944 states and 47831 transitions. Word has length 4 [2022-11-03 02:33:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:22,936 INFO L495 AbstractCegarLoop]: Abstraction has 8944 states and 47831 transitions. [2022-11-03 02:33:22,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-03 02:33:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 8944 states and 47831 transitions. [2022-11-03 02:33:22,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:33:22,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:22,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:22,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 02:33:22,940 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:33:22,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:22,941 INFO L85 PathProgramCache]: Analyzing trace with hash -686558279, now seen corresponding path program 1 times [2022-11-03 02:33:22,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:22,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441039447] [2022-11-03 02:33:22,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:22,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:23,017 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-03 02:33:23,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:23,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441039447] [2022-11-03 02:33:23,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441039447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:23,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:23,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:23,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955311571] [2022-11-03 02:33:23,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:23,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:23,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:23,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:23,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:23,020 INFO L87 Difference]: Start difference. First operand 8944 states and 47831 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 02:33:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:23,514 INFO L93 Difference]: Finished difference Result 15296 states and 77295 transitions. [2022-11-03 02:33:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:23,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 02:33:23,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:23,730 INFO L225 Difference]: With dead ends: 15296 [2022-11-03 02:33:23,730 INFO L226 Difference]: Without dead ends: 15296 [2022-11-03 02:33:23,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:23,732 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:23,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 24 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:23,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15296 states. [2022-11-03 02:33:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15296 to 11440. [2022-11-03 02:33:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11440 states, 11439 states have (on average 5.2496721741410965) internal successors, (60051), 11439 states have internal predecessors, (60051), 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-03 02:33:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 60051 transitions. [2022-11-03 02:33:24,654 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 60051 transitions. Word has length 10 [2022-11-03 02:33:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:24,655 INFO L495 AbstractCegarLoop]: Abstraction has 11440 states and 60051 transitions. [2022-11-03 02:33:24,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 02:33:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 60051 transitions. [2022-11-03 02:33:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:33:24,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:24,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:24,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 02:33:24,656 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:33:24,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:24,658 INFO L85 PathProgramCache]: Analyzing trace with hash -686557287, now seen corresponding path program 1 times [2022-11-03 02:33:24,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:24,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123631757] [2022-11-03 02:33:24,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:24,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:25,053 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-03 02:33:25,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:25,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123631757] [2022-11-03 02:33:25,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123631757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:25,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:25,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:25,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778337258] [2022-11-03 02:33:25,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:25,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:25,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:25,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:25,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:25,056 INFO L87 Difference]: Start difference. First operand 11440 states and 60051 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 02:33:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:25,420 INFO L93 Difference]: Finished difference Result 16940 states and 84841 transitions. [2022-11-03 02:33:25,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:25,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 02:33:25,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:25,564 INFO L225 Difference]: With dead ends: 16940 [2022-11-03 02:33:25,565 INFO L226 Difference]: Without dead ends: 16940 [2022-11-03 02:33:25,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:25,567 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:25,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 24 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16940 states. [2022-11-03 02:33:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16940 to 10588. [2022-11-03 02:33:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10588 states, 10587 states have (on average 5.230660243695098) internal successors, (55377), 10587 states have internal predecessors, (55377), 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-03 02:33:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10588 states to 10588 states and 55377 transitions. [2022-11-03 02:33:26,426 INFO L78 Accepts]: Start accepts. Automaton has 10588 states and 55377 transitions. Word has length 10 [2022-11-03 02:33:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:26,427 INFO L495 AbstractCegarLoop]: Abstraction has 10588 states and 55377 transitions. [2022-11-03 02:33:26,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 02:33:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 10588 states and 55377 transitions. [2022-11-03 02:33:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:33:26,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:26,428 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:26,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 02:33:26,429 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:33:26,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:26,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1141396508, now seen corresponding path program 1 times [2022-11-03 02:33:26,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:26,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368697276] [2022-11-03 02:33:26,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:26,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:33:26,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:26,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368697276] [2022-11-03 02:33:26,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368697276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:26,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:26,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:26,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757416422] [2022-11-03 02:33:26,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:26,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:26,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:26,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:26,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:26,556 INFO L87 Difference]: Start difference. First operand 10588 states and 55377 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:33:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:27,210 INFO L93 Difference]: Finished difference Result 17180 states and 85873 transitions. [2022-11-03 02:33:27,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:27,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 14 [2022-11-03 02:33:27,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:27,397 INFO L225 Difference]: With dead ends: 17180 [2022-11-03 02:33:27,397 INFO L226 Difference]: Without dead ends: 17180 [2022-11-03 02:33:27,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:27,398 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 67 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:27,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 24 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17180 states. [2022-11-03 02:33:27,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17180 to 12076. [2022-11-03 02:33:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12076 states, 12075 states have (on average 5.232380952380953) internal successors, (63181), 12075 states have internal predecessors, (63181), 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-03 02:33:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12076 states to 12076 states and 63181 transitions. [2022-11-03 02:33:28,309 INFO L78 Accepts]: Start accepts. Automaton has 12076 states and 63181 transitions. Word has length 14 [2022-11-03 02:33:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:28,309 INFO L495 AbstractCegarLoop]: Abstraction has 12076 states and 63181 transitions. [2022-11-03 02:33:28,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:33:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 12076 states and 63181 transitions. [2022-11-03 02:33:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:33:28,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:28,311 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:28,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 02:33:28,313 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:33:28,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:28,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1141397438, now seen corresponding path program 1 times [2022-11-03 02:33:28,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:28,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907129638] [2022-11-03 02:33:28,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:28,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:33:28,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:28,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907129638] [2022-11-03 02:33:28,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907129638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:28,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:28,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:28,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89119413] [2022-11-03 02:33:28,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:28,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:28,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:28,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:28,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:28,405 INFO L87 Difference]: Start difference. First operand 12076 states and 63181 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:33:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:28,814 INFO L93 Difference]: Finished difference Result 14948 states and 75407 transitions. [2022-11-03 02:33:28,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:28,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 14 [2022-11-03 02:33:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:28,918 INFO L225 Difference]: With dead ends: 14948 [2022-11-03 02:33:28,930 INFO L226 Difference]: Without dead ends: 14948 [2022-11-03 02:33:28,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:28,931 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:28,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 24 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14948 states. [2022-11-03 02:33:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14948 to 10696. [2022-11-03 02:33:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10696 states, 10695 states have (on average 5.2315100514259) internal successors, (55951), 10695 states have internal predecessors, (55951), 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-03 02:33:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10696 states to 10696 states and 55951 transitions. [2022-11-03 02:33:29,488 INFO L78 Accepts]: Start accepts. Automaton has 10696 states and 55951 transitions. Word has length 14 [2022-11-03 02:33:29,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:29,488 INFO L495 AbstractCegarLoop]: Abstraction has 10696 states and 55951 transitions. [2022-11-03 02:33:29,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:33:29,488 INFO L276 IsEmpty]: Start isEmpty. Operand 10696 states and 55951 transitions. [2022-11-03 02:33:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:33:29,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:29,490 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:29,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 02:33:29,491 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:33:29,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:29,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1985589639, now seen corresponding path program 1 times [2022-11-03 02:33:29,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:29,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565480243] [2022-11-03 02:33:29,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:29,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:33:29,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:29,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565480243] [2022-11-03 02:33:29,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565480243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:29,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:29,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:29,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196756783] [2022-11-03 02:33:29,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:29,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:29,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:29,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:29,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:29,580 INFO L87 Difference]: Start difference. First operand 10696 states and 55951 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-03 02:33:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:30,067 INFO L93 Difference]: Finished difference Result 13596 states and 69751 transitions. [2022-11-03 02:33:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:30,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2022-11-03 02:33:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:30,186 INFO L225 Difference]: With dead ends: 13596 [2022-11-03 02:33:30,186 INFO L226 Difference]: Without dead ends: 13596 [2022-11-03 02:33:30,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:30,187 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 62 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:30,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 24 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13596 states. [2022-11-03 02:33:30,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13596 to 11560. [2022-11-03 02:33:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11560 states, 11559 states have (on average 5.260922225105978) internal successors, (60811), 11559 states have internal predecessors, (60811), 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-03 02:33:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11560 states to 11560 states and 60811 transitions. [2022-11-03 02:33:30,741 INFO L78 Accepts]: Start accepts. Automaton has 11560 states and 60811 transitions. Word has length 18 [2022-11-03 02:33:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:30,741 INFO L495 AbstractCegarLoop]: Abstraction has 11560 states and 60811 transitions. [2022-11-03 02:33:30,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-03 02:33:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 11560 states and 60811 transitions. [2022-11-03 02:33:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:33:30,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:30,744 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:30,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 02:33:30,745 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:33:30,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:30,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1985589453, now seen corresponding path program 1 times [2022-11-03 02:33:30,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:30,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147859770] [2022-11-03 02:33:30,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:30,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:33:30,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:30,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147859770] [2022-11-03 02:33:30,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147859770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:30,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:30,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:30,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050237654] [2022-11-03 02:33:30,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:30,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:30,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:30,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:30,851 INFO L87 Difference]: Start difference. First operand 11560 states and 60811 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-03 02:33:31,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:31,410 INFO L93 Difference]: Finished difference Result 15396 states and 78201 transitions. [2022-11-03 02:33:31,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:31,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2022-11-03 02:33:31,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:31,486 INFO L225 Difference]: With dead ends: 15396 [2022-11-03 02:33:31,486 INFO L226 Difference]: Without dead ends: 15396 [2022-11-03 02:33:31,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:31,487 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 65 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:31,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 24 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:33:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15396 states. [2022-11-03 02:33:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15396 to 9460. [2022-11-03 02:33:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9460 states, 9459 states have (on average 5.302991859604609) internal successors, (50161), 9459 states have internal predecessors, (50161), 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-03 02:33:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9460 states to 9460 states and 50161 transitions. [2022-11-03 02:33:32,166 INFO L78 Accepts]: Start accepts. Automaton has 9460 states and 50161 transitions. Word has length 18 [2022-11-03 02:33:32,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:32,166 INFO L495 AbstractCegarLoop]: Abstraction has 9460 states and 50161 transitions. [2022-11-03 02:33:32,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-03 02:33:32,167 INFO L276 IsEmpty]: Start isEmpty. Operand 9460 states and 50161 transitions. [2022-11-03 02:33:32,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:33:32,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:32,176 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:32,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-03 02:33:32,176 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:33:32,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:32,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2132603843, now seen corresponding path program 1 times [2022-11-03 02:33:32,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:32,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798987102] [2022-11-03 02:33:32,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 02:33:32,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:32,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798987102] [2022-11-03 02:33:32,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798987102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:32,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:32,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:32,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406722646] [2022-11-03 02:33:32,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:32,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:32,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:32,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:32,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:32,502 INFO L87 Difference]: Start difference. First operand 9460 states and 50161 transitions. Second operand has 4 states, 3 states have (on average 5.0) 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-03 02:33:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:32,759 INFO L93 Difference]: Finished difference Result 8210 states and 43536 transitions. [2022-11-03 02:33:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:32,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) 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 22 [2022-11-03 02:33:32,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:32,794 INFO L225 Difference]: With dead ends: 8210 [2022-11-03 02:33:32,794 INFO L226 Difference]: Without dead ends: 8210 [2022-11-03 02:33:32,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:32,795 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 66 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:32,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 24 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8210 states. [2022-11-03 02:33:32,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8210 to 6250. [2022-11-03 02:33:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6250 states, 6250 states have (on average 5.39008) internal successors, (33688), 6249 states have internal predecessors, (33688), 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-03 02:33:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6250 states to 6250 states and 33688 transitions. [2022-11-03 02:33:33,002 INFO L78 Accepts]: Start accepts. Automaton has 6250 states and 33688 transitions. Word has length 22 [2022-11-03 02:33:33,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:33,002 INFO L495 AbstractCegarLoop]: Abstraction has 6250 states and 33688 transitions. [2022-11-03 02:33:33,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) 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-03 02:33:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 6250 states and 33688 transitions. [2022-11-03 02:33:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:33:33,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:33,011 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:33,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 02:33:33,011 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:33:33,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:33,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1869479816, now seen corresponding path program 1 times [2022-11-03 02:33:33,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:33,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602335094] [2022-11-03 02:33:33,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:33,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:33:33,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:33:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:33:33,225 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:33:33,225 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:33:33,225 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2022-11-03 02:33:33,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-03 02:33:33,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-03 02:33:33,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-11-03 02:33:33,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-11-03 02:33:33,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-11-03 02:33:33,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-03 02:33:33,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 02:33:33,226 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:33,227 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-03 02:33:33,227 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2022-11-03 02:33:33,285 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:33:33,288 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:33:33,289 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 356 places, 360 transitions, 810 flow [2022-11-03 02:33:33,289 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 356 places, 360 transitions, 810 flow [2022-11-03 02:33:33,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 356 places, 360 transitions, 810 flow [2022-11-03 02:33:33,390 INFO L130 PetriNetUnfolder]: 19/374 cut-off events. [2022-11-03 02:33:33,391 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-11-03 02:33:33,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 374 events. 19/374 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1332 event pairs, 0 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 401. Up to 12 conditions per place. [2022-11-03 02:33:33,425 INFO L118 LiptonReduction]: Number of co-enabled transitions 68582 [2022-11-03 02:33:45,162 INFO L133 LiptonReduction]: Checked pairs total: 60173 [2022-11-03 02:33:45,162 INFO L135 LiptonReduction]: Total number of compositions: 370 [2022-11-03 02:33:45,163 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 60 transitions, 210 flow [2022-11-03 02:33:47,939 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 55597 states, 55589 states have (on average 6.139955746640522) internal successors, (341314), 55596 states have internal predecessors, (341314), 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-03 02:33:47,941 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:33:47,943 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;@390af72b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:33:47,943 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-03 02:33:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 55597 states, 55589 states have (on average 6.139955746640522) internal successors, (341314), 55596 states have internal predecessors, (341314), 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-03 02:33:48,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 02:33:48,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:48,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 02:33:48,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2022-11-03 02:33:48,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:48,029 INFO L85 PathProgramCache]: Analyzing trace with hash 87486132, now seen corresponding path program 1 times [2022-11-03 02:33:48,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:48,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178159705] [2022-11-03 02:33:48,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:48,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:48,068 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-03 02:33:48,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:48,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178159705] [2022-11-03 02:33:48,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178159705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:48,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:48,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:33:48,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549802207] [2022-11-03 02:33:48,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:48,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:33:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:48,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:33:48,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:33:48,160 INFO L87 Difference]: Start difference. First operand has 55597 states, 55589 states have (on average 6.139955746640522) internal successors, (341314), 55596 states have internal predecessors, (341314), 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.0) internal successors, (4), 2 states have internal predecessors, (4), 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-03 02:33:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:49,028 INFO L93 Difference]: Finished difference Result 35294 states and 215214 transitions. [2022-11-03 02:33:49,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:33:49,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-11-03 02:33:49,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:49,361 INFO L225 Difference]: With dead ends: 35294 [2022-11-03 02:33:49,361 INFO L226 Difference]: Without dead ends: 35294 [2022-11-03 02:33:49,362 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-03 02:33:49,363 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:49,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 10 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35294 states. [2022-11-03 02:33:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35294 to 35294. [2022-11-03 02:33:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35294 states, 35293 states have (on average 6.097923100898195) internal successors, (215214), 35293 states have internal predecessors, (215214), 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-03 02:33:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35294 states to 35294 states and 215214 transitions. [2022-11-03 02:33:50,949 INFO L78 Accepts]: Start accepts. Automaton has 35294 states and 215214 transitions. Word has length 4 [2022-11-03 02:33:50,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:50,949 INFO L495 AbstractCegarLoop]: Abstraction has 35294 states and 215214 transitions. [2022-11-03 02:33:50,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-03 02:33:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 35294 states and 215214 transitions. [2022-11-03 02:33:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:33:50,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:50,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:50,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-03 02:33:50,951 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2022-11-03 02:33:50,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:50,952 INFO L85 PathProgramCache]: Analyzing trace with hash 350169222, now seen corresponding path program 1 times [2022-11-03 02:33:50,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:50,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550006383] [2022-11-03 02:33:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:50,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:51,107 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-03 02:33:51,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:51,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550006383] [2022-11-03 02:33:51,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550006383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:51,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:51,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:51,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237494011] [2022-11-03 02:33:51,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:51,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:51,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:51,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:51,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:51,111 INFO L87 Difference]: Start difference. First operand 35294 states and 215214 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 02:33:52,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:52,603 INFO L93 Difference]: Finished difference Result 50262 states and 295144 transitions. [2022-11-03 02:33:52,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:52,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 02:33:52,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:53,020 INFO L225 Difference]: With dead ends: 50262 [2022-11-03 02:33:53,021 INFO L226 Difference]: Without dead ends: 50262 [2022-11-03 02:33:53,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:53,022 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 82 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:53,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 24 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:33:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50262 states. [2022-11-03 02:33:55,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50262 to 45018. [2022-11-03 02:33:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45018 states, 45017 states have (on average 6.00377635115623) internal successors, (270272), 45017 states have internal predecessors, (270272), 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-03 02:33:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45018 states to 45018 states and 270272 transitions. [2022-11-03 02:33:55,714 INFO L78 Accepts]: Start accepts. Automaton has 45018 states and 270272 transitions. Word has length 10 [2022-11-03 02:33:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:55,714 INFO L495 AbstractCegarLoop]: Abstraction has 45018 states and 270272 transitions. [2022-11-03 02:33:55,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-03 02:33:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 45018 states and 270272 transitions. [2022-11-03 02:33:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:33:55,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:55,716 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:55,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-03 02:33:55,716 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2022-11-03 02:33:55,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:55,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1671478354, now seen corresponding path program 1 times [2022-11-03 02:33:55,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:55,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912866413] [2022-11-03 02:33:55,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:55,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:33:55,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:55,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912866413] [2022-11-03 02:33:55,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912866413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:55,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:55,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:55,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932080824] [2022-11-03 02:33:55,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:55,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:55,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:55,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:55,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:55,862 INFO L87 Difference]: Start difference. First operand 45018 states and 270272 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:33:57,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:57,286 INFO L93 Difference]: Finished difference Result 58410 states and 341244 transitions. [2022-11-03 02:33:57,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:33:57,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 14 [2022-11-03 02:33:57,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:57,694 INFO L225 Difference]: With dead ends: 58410 [2022-11-03 02:33:57,694 INFO L226 Difference]: Without dead ends: 58410 [2022-11-03 02:33:57,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:33:57,695 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 79 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:57,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 24 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:33:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58410 states. [2022-11-03 02:34:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58410 to 49818. [2022-11-03 02:34:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49818 states, 49817 states have (on average 5.9916895838769895) internal successors, (298488), 49817 states have internal predecessors, (298488), 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-03 02:34:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49818 states to 49818 states and 298488 transitions. [2022-11-03 02:34:00,659 INFO L78 Accepts]: Start accepts. Automaton has 49818 states and 298488 transitions. Word has length 14 [2022-11-03 02:34:00,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:00,659 INFO L495 AbstractCegarLoop]: Abstraction has 49818 states and 298488 transitions. [2022-11-03 02:34:00,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:34:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 49818 states and 298488 transitions. [2022-11-03 02:34:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:34:00,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:00,660 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:00,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-03 02:34:00,661 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2022-11-03 02:34:00,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1671481764, now seen corresponding path program 1 times [2022-11-03 02:34:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:00,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416027041] [2022-11-03 02:34:00,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:34:00,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:00,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416027041] [2022-11-03 02:34:00,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416027041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:34:00,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:34:00,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:34:00,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977047184] [2022-11-03 02:34:00,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:34:00,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:34:00,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:00,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:34:00,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:34:00,732 INFO L87 Difference]: Start difference. First operand 49818 states and 298488 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:34:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:02,350 INFO L93 Difference]: Finished difference Result 76362 states and 438620 transitions. [2022-11-03 02:34:02,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:34:02,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 14 [2022-11-03 02:34:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:02,925 INFO L225 Difference]: With dead ends: 76362 [2022-11-03 02:34:02,926 INFO L226 Difference]: Without dead ends: 76362 [2022-11-03 02:34:02,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:34:02,927 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 77 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:02,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 24 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:34:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76362 states. [2022-11-03 02:34:05,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76362 to 46794. [2022-11-03 02:34:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46794 states, 46793 states have (on average 5.976022054580813) internal successors, (279636), 46793 states have internal predecessors, (279636), 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-03 02:34:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46794 states to 46794 states and 279636 transitions. [2022-11-03 02:34:06,240 INFO L78 Accepts]: Start accepts. Automaton has 46794 states and 279636 transitions. Word has length 14 [2022-11-03 02:34:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:06,241 INFO L495 AbstractCegarLoop]: Abstraction has 46794 states and 279636 transitions. [2022-11-03 02:34:06,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-03 02:34:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 46794 states and 279636 transitions. [2022-11-03 02:34:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:34:06,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:06,242 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:06,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-03 02:34:06,243 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2022-11-03 02:34:06,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:06,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1332938276, now seen corresponding path program 1 times [2022-11-03 02:34:06,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:06,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875552155] [2022-11-03 02:34:06,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:06,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:34:06,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:06,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875552155] [2022-11-03 02:34:06,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875552155] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:34:06,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:34:06,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:34:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029536847] [2022-11-03 02:34:06,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:34:06,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:34:06,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:06,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:34:06,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:34:06,546 INFO L87 Difference]: Start difference. First operand 46794 states and 279636 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-03 02:34:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:08,359 INFO L93 Difference]: Finished difference Result 54914 states and 319706 transitions. [2022-11-03 02:34:08,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:34:08,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2022-11-03 02:34:08,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:08,749 INFO L225 Difference]: With dead ends: 54914 [2022-11-03 02:34:08,749 INFO L226 Difference]: Without dead ends: 54914 [2022-11-03 02:34:08,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:34:08,750 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 79 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:08,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 24 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:34:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54914 states. [2022-11-03 02:34:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54914 to 43050. [2022-11-03 02:34:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43050 states, 43049 states have (on average 5.957165090942879) internal successors, (256450), 43049 states have internal predecessors, (256450), 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-03 02:34:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43050 states to 43050 states and 256450 transitions. [2022-11-03 02:34:11,759 INFO L78 Accepts]: Start accepts. Automaton has 43050 states and 256450 transitions. Word has length 18 [2022-11-03 02:34:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:11,774 INFO L495 AbstractCegarLoop]: Abstraction has 43050 states and 256450 transitions. [2022-11-03 02:34:11,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-03 02:34:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 43050 states and 256450 transitions. [2022-11-03 02:34:11,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:34:11,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:11,805 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:11,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-03 02:34:11,814 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2022-11-03 02:34:11,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash 694356097, now seen corresponding path program 1 times [2022-11-03 02:34:11,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:11,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989529125] [2022-11-03 02:34:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:11,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 02:34:11,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:11,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989529125] [2022-11-03 02:34:11,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989529125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:34:11,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:34:11,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:34:11,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318050110] [2022-11-03 02:34:11,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:34:11,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:34:11,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:11,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:34:11,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:34:11,983 INFO L87 Difference]: Start difference. First operand 43050 states and 256450 transitions. Second operand has 4 states, 3 states have (on average 5.0) 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-03 02:34:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:12,836 INFO L93 Difference]: Finished difference Result 66618 states and 385290 transitions. [2022-11-03 02:34:12,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:34:12,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) 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 22 [2022-11-03 02:34:12,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:14,198 INFO L225 Difference]: With dead ends: 66618 [2022-11-03 02:34:14,199 INFO L226 Difference]: Without dead ends: 66618 [2022-11-03 02:34:14,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 02:34:14,200 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 73 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:14,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 24 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:34:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66618 states.